Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, March 2005. / Thesis Advisor(s): John C. McEachen. Includes bibliographical references (p. 51-53). Also available online.

Thesis (M.S. in Information Technology Management and M.S. in Computer Science)--Naval Postgraduate School, March 2005. / Thesis Advisor(s): Alexander Bordetsky, Gilbert M. Lundy. Includes bibliographical references (p. 69-75). Also available online.

The aim of the thesis is to explain and introduce the indiviudal components and control proceedings in the systems of automatic control of intelligent houses. The thesis is divided into three parts. In the first part I deal with the general description and structure of the house automatic systems, their availability and application in wiring practise. The second part is focused on the proceedings used in RC5 infra-red area and the most used X10 PowerLine protocol and its processing by AVR microprocessors. The third part is concentrated on the practical construction of a module with a microprocessor enabling the development and education of user applications for the substance of the automation system and that extend it in other possibilities of communication such as ethernet and WiFi networks, eventually GSM mobile network.

Dans cette thèse nous étudions formellement la sécurité des protocoles de vote et d'enchère en ligne. Le vote en ligne est utilisé en Estonie et dans certaines régions de la Suisse. D'autre part, les enchères en ligne sont de plus en plus populaires: eBay comptait plus de 112 millions utilisateurs actifs et plus de 350 millions d'objets à vendre en 2012, avec un chiffre d'affaires de 14 milliards de dollars. Dans ces deux applications, la sécurité est primordiale, à cause d'enjeux financiers et politiques. Dans le cas des protocoles de vote, le secret du vote est crucial pour le libre choix des votants. Nous proposons une hiérarchie des notions de secret du vote par rapport à plusieurs niveaux de coercition, des attaques spécifiques (comme l'abstention forcé), et des votants corrompus. Nous développons également des notions généralisées pour le cas des votes pondérés (par exemple par rapport au nombre d'actions dans une société), et montrons que pour beaucoup de protocoles le cas avec plusieurs votants sous attaque se réduit au cas avec un seul votant sous attaque. Ce résultat a été obtenu grâce à un autre résultat dans le pi-calcul appliqué montrant que tout processus fini peut se décomposer de manière unique en processus premiers. Nous illustrons notre hiérarchie sur plusieurs exemples, soulignant comment elle permet d'évaluer le niveau d'anonymat d'un protocole donné. Dans le cas des protocoles d'enchère en ligne, nous proposons aussi une hiérarchie de notions d'anonymat, et plusieurs notions d'équité et d'authentification comme la non-interférence, la non-annulation et la non-répudiation. Nous analysons ces propriétés automatiquement à l'aide de l'outil ProVerif sur trois exemples, et découvrons plusieurs faiblesses. De plus, nous proposons une définition abstraite de la vérifiabilité, et l'appliquons sur des exemples aussi bien dans le modèle calculatoire que dans le modèle symbolique en utilisant CryptoVerif et ProVerif respectivement. Nous démontrons dans le modèle calculatoire qu'un des protocoles est vérifiable, et découvrons plusieurs faiblesses sur le deuxième exemple. Finalement nous étudions le concept d'«enchères vraiment vérifiable par les enchérisseurs», c'est-à-dire des protocoles d'enchère ou le bon déroulement peut être vérifié par un non-expert, car la sécurité est assurée par des moyens physiques, et non cryptographiques. Nous proposons deux tels protocoles, et une analyse formelle de ces protocoles avec ProVerif grâce à une modélisation symbolique des propriétés physiques. / In this document, we formally analyze security in electronic voting and electronic auctions. On-line voting over is now available in several countries, for example in Estonia or parts of Switzerland. Similarly, electronic auctions are increasingly used: eBay had over 112 million active users and over 350 million listings in 2012, and achieved a revenue of more than 14 billion US Dollars. In both applications, security is a main concern, as fairness is important and money is at stake. In the case of voting protocols, privacy is crucial to ensure free elections. We propose a hierarchy of privacy notions in the Applied Pi-Calculus, including different levels of coercion, special attacks such as forced-abstention attacks, and inside attackers. We also provide generalized notions for situations where votes are weighted (e.g. according to the number of shares in a company), and show that for many protocols the case with multiple coerced voters can be reduced to the case with one coerced voter. This result is made possible by a unique decomposition result in the Applied Pi-Calculus showing that any finite process has a unique normal form with respect to labeled bisimilarity. Moreover we provide multiple case studies illustrating how our taxonomy allows to assess the level of privacy ensured by a voting protocol. In the case of auction protocols we also consider a hierarchy of privacy notions, and several fairness and authentication properties such as Non-Interference, Non-Cancellation and Non-Repudiation. We analyze all these properties automatically using ProVerif on three case studies, and identify several flaws. Moreover we give an abstract definition of verifiability in auctions and provide case studies in the symbolic and computational model using ProVerif and CryptoVerif respectively. Again, we identify several shortcomings, but also give a computational proof for one protocol. Finally we explore the idea of ``true bidder-verifiable auctions'', i.e. auctions that can be verified by a non-expert, as the property is ensured through physical properties instead of complex cryptography. We propose two such protocols, discuss how to model the underlying physical properties, and provide a formal analysis of both protocols using ProVerif.

SMTP, the current protocol for sending electronic mail (e-mail) over the Internet, has for many years suffered from several problems and limitations. When it was designed, well over twenty years ago, the requirements for e-mail were very different from those of today. A message was a text message in English, and both user and machine were explicitly named in the address. The protocol was not designed to transfer other types of messages, and no mechanism was included to verify the identity of the sender. In order to solve these shortcomings, a new e-mail protocol needs to be defined. This report specifies a basis for what such a protocol may look like. The protocol has been designed to be easy to modify and expand, as well as to benefit from more recent ideas and technology. Binary message content is transferred without conversion, sender addresses are verified, and the address format is flexible. Along with the specification of the protocol, a sample implementation has been provided.

As part of a larger effort to improve telemetry link availability, the U.S. Army Yuma Proving Ground (YPG) is currently in the process of upgrading its telemetry receivers. As YPG begins integrating new receivers into existing range infrastructure, the question of where to place these receivers to provide maximum benefit must be considered. Should the receivers be placed at each of the remote antennas or should they be centrally located at the primary telemetry site? Although many Telemetry-over-Internet Protocol (TMoIP) and radio frequency (RF) over fiber solutions exist to transport these data, there are numerous concerns including network and Cybersecurity limitations to consider when implementing either of these approaches. This paper will document the trade study conducted at YPG to explore the benefits of each approach.

Radiologists' workload has been steadily increasing for decades. As digital technology matures it improves the workflow for radiology departments and decreases the time necessary to examine patients. Computer systems are widely used in health care and are for example used to view radiology images. To simplify this, display protocols based on examination data are used to automatically create a layout and hang images for the user. To cover a wide variety of examinations hundreds of protocols must be created, which is a time-consuming task and the system can still fail to hang series if strict requirements on the protocols are not met. To remove the need for this manual step we propose to use machine learning based on past manually corrected presentations. The classifiers are trained on the metadata in the examination and how the radiologist preferred to hang the series. The chosen approach was to create classifiers for different layout rules and then use these predictions in an algorithm for assigning series types to individual image slots according to categories based on metadata, similar to how display protocol works. The resulting presentations shows that the system is able to learn, but must increase its prediction accuracy if it is to be used commercially. Analyses of the different parts show that increased accuracy in early steps should improve overall success. / Röntgenläkares arbetsbörda har under flera årtionden ökat. Den digitala sjukvårdsteknologin utvecklas ständigt vilket bidrar till ett förbättrat arbetsflöde och kortare undersökningstider i radiologiavdelningar. Datorsystem används idag överallt inom sjukvården och används bland annat för att visa bilder åt röntgenläkare. För att underlätta visningen används display protocol som automatiskt skapar layouts och hänger bilder åt användaren. För att täcka ett stort antal olika undersökningstyper krävs att användaren skapar hundratals protokoll vilket är en tidskrävande uppgift, och systemet kan ändå misslyckas med att hänga upp bilder om de strikta kraven protokollen ställer inte uppfylls. För att ta bort detta manuella steg föreslår vi att man använder maskininlärning baserat på tidigare sparade presentationer.  Klassificerarna tränas på undersökningens metadata och radiologens preferenser på hängning av serier. Den valda metoden går ut på att skapa klassificerare för olika layout-regler och att sedan använda deras output i en algoritm som placerar ut series-typer till individuella bildplatser enligt kategorier baserade på metadata. Denna metod liknar den process de nuvarande display protokollen utför. De presentationer som skapats visar att systemet kan läras upp, men kräver högre precision om det ska användas kommersiellt. Analys av de olika delarna tyder på att ökad precision tidigt i systemet skulle öka den totala precision.

This diploma thesis deals with global environmental agreements and their effectiveness. Its aim is to disclose the causes of success of some agreements and, on the contrary, the motives of failure of other agreements. In the theoretical part, the specialities of the environmental problems are illustrated, followed by the introduction to the international environmental law and agreements. In the practical part, two well-known international agreements concerned with atmosphere are compared. They deal with similar problem, but they achieved very different results. The objective of step-by-step comparison of diverse aspects of both agreements is to discover what factors caused the great success of the Montreal Protocol in protecting the ozone layer and why the similarly conceived Kyoto Protocol failed in the combat against climate change. Last chapter concludes this comparison and defines key characteristics which are essential for the effectiveness of the global environmental agreements.

This thesis aimed to create a messaging protocol for OpenSpace to interoperate with other astronomy software. The goal was to create a messaging standard that was not language-dependent and could be implemented by any astronomy software. To establish an asynchronous communication between OpenSpace and connected software, the Transmission Control Protocol (TCP), threading, and Peer-To-Peer (P2P) were the techniques mainly used. TCP was used to achieve reliable communication between software connected to the network. The enabling of two-way communication was solved by threading. P2P was used as a network communication architecture to share resources between the connected software. By using Unicode characters expressed through UTF-8, the Unicode Standard was used to encode messages sent. The messages are structured by combinations of different sizes of bytes and are sent and received as binary strings. All messages contain a header and the data being sent. Different message types were created to specify which type of data is sent. The protocol works primarily between OpenSpace and Glue but is not limited to these software. The implementation serves as the basis of the messaging protocol for OpenSpace, where Glue represents future software integrations.

This diploma thesis explains the principle of SCADA systems and describes the DLMS/COSEM protocol. In the next part, it shortly describes the Modbus protocol and details the pros and cons of the Modbus protocol in comparison with the DLMS/COSEM protocol. In the next part, an open-source automated scanner was created. This scanner detects devices in a laboratory network. As the next step, the automated scanner finds out open ports and active services, which run on these devices, and tries to attack HTTP, SSH, and Telnet services. Next, the program checks, whether the found device is a smart-meter device and if it is compatible with DLMS/COSEM protocol. If yes, it checks, if the service is vulnerable to DOS attack and breaker disconnection. Scanner’s findings are presented in a newly created web application. NMAP, Masscan, and Metasploit open-source programs are used in the automated scanner. The whole automated scanner is optimized for the HW device Raspberry Pi with the operating system Raspbian Buster Lite installed. This work also describes the testing of the scanner on the laboratory environment and the results are evaluated afterwards.