Дисертації з теми "Secure classification"

Ces dernières années ont vu le développement des techniques de fouille de données séquentielles dans de nombreux domaines d’applications dans le but d’analyser des données temporelles, volumineuses et complexes. Dans le cadre de cette thèse, nous nous intéressons aux problèmes de classification et de structuration de données séquentielles, que nous proposons d’étudier à travers trois approches principales. Dans la première, il s’agit de mettre en oeuvre une nouvelle approche de classification topographique probabiliste dédiée aux données séquentielles, nous l’appellerons PrSOMS. Cette approche consiste à adapter la carte topographique déterministe à des séquences tout en s’appuyant sur les modèles de Markov cachés. On aboutit ainsi à une approche qui bénéficie du pouvoir de visualisation des SOM et de celui de structuration (modélisation) de séquences des HMM. Dans la deuxième, nous proposons une extension hiérarchique de l’approche PrSOMS. Cette approche permet de tirer partie de l’aspect complexe des données au sein du processus de classification. Nous avons constaté que le modèle obtenu ”H-PrSOMS” assure une bonne interprétabilité des classes construites. Dans la troisième, nous proposons une autre approche statistique topologique MGTM-TT, qui repose sur le même paradigme que celui des HMM. Il s’agit d’une modélisation générative topographique à densité d’observations mélanges, qui s’apparente à une extension hiérarchique du modèle GTM temporel. Ces propositions ont ensuite été appliquées à des données de test et à des données réelles issues de l’INA (Institut National de l’Audiovisuel). Dans le cas de l’INA, Ces approches consistent à proposer dans un premier temps une classification plus fine des segments audiovisuels diffusés. Puis, elles cherchent à définir une typologie des enchainements des segments (diffusion multiple d’un même programme, un programme entre deux inter-programme) afin de prévoir de manière statistique les caractéristiques des segments diffusés. La méthodologie globale offre ainsi un outil pour la classification et la structuration des données séquentielles
Recent years have seen the development of data mining techniques in various application areas, with the purpose of analyzing sequential, large and complex data. In this work, the problem of clustering, visualization and structuring data is tackled by a three-stage proposal. The first proposal present a generative approach to learn a new probabilistic Self-Organizing Map (PrSOMS) for non independent and non identically distributed data sets. Our model defines a low dimensional manifold allowing friendly visualizations. To yield the topology preserving maps, our model exhibits the SOM like learning behavior with the advantages of probabilistic models. This new paradigm uses HMM (Hidden Markov Models) formalism and introduces relationships between the states. This allows us to take advantage of all the known classical views associated to topographic map. The second proposal concerns a hierarchical extension of the approach PrSOMS. This approach deals the complex aspect of the data in the classification process. We find that the resulting model ”H-PrSOMS” provides a good interpretability of classes built. The third proposal concerns an alternative approach statistical topological MGTM-TT, which is based on the same paradigm than HMM. It is a generative topographic modeling observation density mixtures, which is similar to a hierarchical extension of time GTM model. These proposals have then been applied to test data and real data from the INA (National Audiovisual Institute). This work is to provide a first step, a finer classification of audiovisual broadcast segments. In a second step, we sought to define a typology of the chaining of segments (multiple scattering of the same program, one of two inter-program) to provide statistically the characteristics of broadcast segments. The overall framework provides a tool for the classification and structuring of audiovisual programs

This paper presents a novel implementation of an embedded Java microarchitecture for secure, realtime, and multi-threaded applications. Together with the support of modern features of object-oriented languages, such as exception handling, automatic garbage collection and interface types, a general-purpose platform is established which also fits for the agent concept. Especially, considering real-time issues, new techniques have been implemented in our Java microarchitecture, such as an integrated stack and thread management for fast context switching, concurrent garbage collection for real-time threads and autonomous control flows through preemptive round-robin scheduling.

Current trend in automotive industry is moving towards adopting the multicore microcontrollers in Electronic Control Units (ECUs). Multicore microcontrollers give an opportunity to run a number of separated and dedicated operating systems on a single ECU. When two heterogeneous operating systems run in parallel on a multicore environment, the inter OS communication between these operating systems become the key factor in the overall performance. The inter OS communication based on shared memory is studied in this thesis work. In a setup where two operating systems namely EB Autocore OS which is based on AUTomotive Open System Architecture standard and Android are considered. Android being the gateway to the internet and due to its open nature and the increased connectivity features of a connected car, many attack surfaces are introduced to the system. As safety and security go hand in hand, the security aspects of the communication channel are taken into account. A portable prototype for multi OS communication based on shared memory communication with security considerations is developed as a plugin for EB tresos Studio.

Preventing the success of active attacks is of essential importance for network coding since even the infiltration of one single corrupted data packet can jam large parts of the network. The existing approaches for network coding schemes preventing such pollution attacks can be divided into two categories: utilize cryptographic approaches or utilize redundancy similar to error correction coding. Within this paper, we compared both paradigms concerning efficiency of data transmission under various circumstances. Particularly, we considered an attacker of a certain strength as well as the influence of the generation size. The results are helpful for selecting a suitable approach for network coding taking into account both security against pollution attacks and efficiency.

Network coding is a promising approach for increasing performance of multicast data transmission and reducing energy costs. Of course, it is essential to consider security aspects to ensure a reliable data transmission. Particularly, pollution attacks may have serious impacts in network coding since a single attacker can jam large parts of the network. Therefore, various approaches have been introduced to secure network coding against this type of attack. However, introducing security increases costs. Even though there are some performance analysis of secure schemes, to our knowledge there are no details whether these schemes are worthwhile to replace routing under the facet of efficiency. Thus, we discuss in this report parameters to assess the efficiency of secure network coding schemes. Using three network graphs, we evaluate parameters focusing on communication overhead for selected schemes. Our results show that there are still benefits in comparison to routing depending on the network topology.

Nous vivons actuellement dans une ère avec sans cesse de nouveaux appareils technologiques (smartphone, réseaux de capteurs sans fil, aux caméras haute résolution, etc). En partant des médias sociaux, en passant par des caméras de surveillance très puissantes, et sans oublier la surveillance de la santé en temps réel, on constate qu'une grande quantité de données est stockée dans le cloud et les serveurs. Cela représente un grand défi de stockage et de transmission, en particulier dans les plates-formes aux ressources limitées qui sont caractérisées par : (a) des capacités de calcul limitées, (b) une source d'énergie limitées et (c) des infrastructures ouvertes qui transmettent des données sur des réseaux sans fil peu fiables. Dans cette thèse, nous nous concentrons sur l'amélioration de la sécurité des contenus multimédia transmis sur des plates-formes à capacité de calcul limitée, tout en préservant un niveau de sécurité élevé. Dans la première partie, nous avons étudié les réseaux ad hoc véhiculaire. Nous avons proposé un état de l'art qui permet de résumer la plupart des travaux récents et d'explorer presque tous les aspects de ce domaine en illustrant les différents aspects que possède cette plateforme. Ensuite, afin de proposer une nouvelle solution de sécurité et de valider sa robustesse et le niveau de caractère aléatoire d'une image chiffrée, nous avons proposé un test simple et efficace. Celui-ci est basé sur des outils pour tester statistiquement le caractère aléatoire de nombres pseudo aléatoires, TestU01 et Practrand. Après avoir effectué ces tests sur des algorithmes de chiffrement bien connus, certaines failles ont été exposées et une nouvelle proposition visant à améliorer le système de chiffrement ultra-léger Speck est proposée. La principale contribution de ce travail est d'obtenir une meilleure version par rapport à Speck. Dans cette nouvelle proposition, appelée Speck-R, nous utilisons seulement 7 itérations contrairement à Speck qui en utilise 26 et nous réduisons le temps d'exécution d'au moins 50%. Tout d'abord, nous validons que Speck-R répond aux tests de statistiques pour mesurer l'aléatoire, proposés précédemment. De plus, nous avons rajouté un système de clé dynamique qui procure plus de sécurité contre les attaques liées à la clé. Speck-R a été implémenté sur différentes cartes de type arduino et dans tous les cas, Speck-R était plus rapide que Speck. Ensuite, afin de prouver que ce chiffrement peut être utilisé pour sécuriser les images, en particulier dans les réseaux VANETS/IoV, plusieurs tests ont été effectués et les résultats montrent que Speck-R possède effectivement le haut niveau de sécurité souhaité. Des expérimentations valident notre proposition du point de vue de la sécurité et de la performance et démontrent la robustesse du système proposé face aux types d'attaques les plus connus
Living in an era where new devices are astonishing considering their high capabilities, new visions and terms have emerged. Moving to smart phones, Wireless Sensor Networks, high-resolution cameras, pads and much more, has mandated the need to rethink the technological strategy that is used today. Starting from social media, where apparently everything is being exposed, moving to highly powerful surveillance cameras, in addition to real time health monitoring, it can be seen that a high amount of data is being stored in the Cloud and servers. This introduced a great challenge for their storage and transmission especially in the limited resourced platforms that are characterized by: (a) limited computing capabilities, (b) limited energy and source of power and (c) open infrastructures that transmit data over wireless unreliable networks. One of the extensively studied platforms is the Vehicular Ad-hoc Networks which tends to have many limitations concerning the security field. In this dissertation, we focus on improving the security of transmitted multimedia contents in different limited platforms, while preserving a high security level. Limitations of these platforms are taken into consideration while enhancing the execution time of the secure cipher. Additionally, if the proposed cipher is to be used for images, the intrinsic voluminous and complex nature of the managed images is also taken into account. In the first part, we surveyed one of the limited platforms that is interesting for many researchers, which is the Vehicular Ad-hoc Networks. In order to pave the way for researchers to find new efficient security solutions, it is important to have one reference that can sum most of the recent works. It almost investigates every aspect in this field shedding the light over different aspects this platform possesses. Then, in order to propose any new security solution and validate its robustness and the level of randomness of the ciphered image, a simple and efficient test is proposed. This test proposes using the randomness tools, TestU01 and Practrand, in order to assure a high level of randomness. After running these tests on well known ciphers, some flaws were exposed. Proceeding to the next part, a novel proposal for enhancing the well-known ultra lightweight cipher scheme, Speck, is proposed. The main contribution of this work is to obtain a better version compared to Speck. In this proposal, 26 rounds in Speck were reduced to 7 rounds in Speck-R while enhancing the execution time by at least 50%. First, we validate that Speck-R meets the randomness tests that are previously proposed. Additionally, a dynamic substitution layer adds more security against key related attacks and highly fortifies the cipher. Speck-R was implemented on different limited arduino chips and in all cases, Speck-R was ahead of Speck. Then, in order to prove that this cipher can be used for securing images, especially in VANETS/IoV, where images can be extensively re/transmitted, several tests were exerted and results showed that Speck-R indeed possesses the high level of security desired in any trusted cipher. Extensive experiments validate our proposal from both security and performance point of views and demonstrate the robustness of the proposed scheme against the most-known types of attacks

Network Coding is a new possibility to transmit data through a network. By combining different packets instead of simply forwarding, network coding offers the opportunity to reach the Min-Cut/Max-Flow capacity in multicast data transmissions. However, the basic schemes are vulnerable to so-called pollution attacks, where an attacker can jam large parts of the transmission by infiltrating only one bogus message. In the literature we found several approaches which aim at handling this kind of attack with different amounts of overhead. Though, the cost for a specific secure network coding scheme highly depends on the underlying network. The goal of this paper is on the one hand to describe which network parameters influence the efficiency of a certain scheme and on the other hand to provide concrete suggestions for selecting the most efficient secure network coding scheme considering a given network. We will illustrate that there does not exist “the best” secure network scheme concerning efficiency, but all selected schemes are more or less suited under certain network topologies.

The number of secure data streams a relay-assisted interference channel can support has been an intriguing problem. The problem is not solved even for a fundamental scenario with a single antenna at each transmitter, receiver and relay. In this paper, we study the achievable secure degrees of freedom of instantaneous relay-assisted interference channels with real and complex coefficients. The study of secure degrees of freedom with complex coefficients is not a trivial multiuser extension of the scenarios with real channel coefficients as in the case for the degrees of freedom, due to secrecy constraints. We tackle this challenge by jointly designing the improper transmit signals and widely-linear relay processing strategies.

La croissance exponentielle dans l’utilisation du réseau Internet ainsi que l’apparition de nouveaux types d’applications ont augmenté les contraintes du réseau en termes de sécurité. Depuis quelques années, les techniques biométriques ont prouvé une grande précision et fiabilité et ont été utilisées dans plusieurs domaines afin de sécuriser l’accès à différentes ressources. Des solutions intégrant des agents et des systèmes multi-agents (SMA) ont aussi prouvé leur efficacité pour la résolution de nombreux problèmes dans les réeaux. Nous proposons un modèle « IrisCrptoAgentSystem » (ICAS) basé sur la méthode biométrique pour l’authentification utilisant l’iris de l’œil et la méthode de cryptographie asymétrique utilisant l’algorithme « Rivest-Shamir-Adleman » (RSA), et en intégrant des agents. Ce modèle doit assurer un accès sécurisé aux informations et garantir la protection des informations confidentielles. Notre travail porte sur la mise en place de nouvelles méthodes dans le modèle d’authentification biométrique afin de donner plus d’efficacité à notre modèle ICAS. Nous introduisons des aspects prétopologiques dans l’élaboration de la hiérarchie indexée pour classer les gabarits DHVA. Notre approche consiste à améliorer les méthodes relatives à la localisation des contours externe et interne de l’iris
The exponential growth in the use of the Internet as well as the emergence of new types of applications has increased the network’s constraints in terms f security. Fort the last several years, biometric techniques have proven their applicability and reliability in providing secure access to shared resources in different domains. Furthermore, software agents and multi-agent systems (MAS) have evidently been efficient in resolving several problems in network. Therefore, the aim of this research is to propose a model “IrisCryptoAgentSystem” (ICAS) that is based on a biometric method for authentication using the iris of the eyes and an asymmetric cryptography method using “Rivest-Shamir-Adleman” (RSA) in an agent-based architecture. This model should provide secure access to information and ensure the protection of confidential information. Therefore, our work focuses on the development of new methods in biometric autheitcation in order to provide greater efficiency in the ICAS model. We introduce pretopological aspects in the development of the indexed hierarchy to classify DHVA templates. Our approach aims to improve the existing methods for the localization of the external and the internal edges of the iris

The use of machine-learning for multimedia forensics is gaining more and more consensus, especially due to the amazing possibilities offered by modern machine learning techniques. By exploiting deep learning tools, new approaches have been proposed whose performance remarkably exceed those achieved by state-of-the-art methods based on standard machine-learning and model-based techniques. However, the inherent vulnerability and fragility of machine learning architectures pose new serious security threats, hindering the use of these tools in security-oriented applications, and, among them, multimedia forensics. The analysis of the security of machine learning-based techniques in the presence of an adversary attempting to impede the forensic analysis, and the development of new solutions capable to improve the security of such techniques is then of primary importance, and, recently, has marked the birth of a new discipline, named Adversarial Machine Learning. By focusing on Image Forensics and image manipulation detection in particular, this thesis contributes to the above mission by developing novel techniques for enhancing the security of binary manipulation detectors based on machine learning in several adversarial scenarios. The validity of the proposed solutions has been assessed by considering several manipulation tasks, ranging from the detection of double compression and contrast adjustment, to the detection of geometric transformations and ltering operations.

Purpose - The purpose of this master thesis is to investigate the possibilities to extend or change the base of IKEA’s SL classification and give recommendations concerning potential improvements.  Method - This thesis has an inductive research strategy since data has been collected to build theory rather than the other way around (Bryman and Bell, 2007). The data has been collected by qualitative research, mainly through interviews with employees at the different IKEA organisations. Empirics - The empirical data gathered describes the service level in practice at IKEA. In order to get an overview of the conflicting interests in the different functions, the chapter is divided into four themes; how IKEA works with SL, the purpose of SL, customer service and suggestion to the design of the SL classification. Theory - The theory has been based on our empirical findings in order to find the best solution for IKEA. The theory includes different classification models, the relationship between customer service and SL and is finished with a section on how to measure availability. Conclusions - The conclusion that could be drawn was that the purpose of the classification was not perceived in the same way within the company and that both internal and external information is needed. A new model is presented that takes into account the different products, buying situations, and customer reactions on OOS, which are important parameters for consumer perception of availability and customer service. By using this model IKEA will be able to fulfil the two, sometimes conflicting purposes; to secure the sales and increase customer satisfaction.

We consider the problem of secure communications in a Gaussian two-way relay network where two nodes exchange confidential messages only via an untrusted relay. The relay is assumed to be honest but curious, i.e., an eavesdropper that conforms to the system rules and applies the intended relaying scheme. We analyze the achievable secrecy rates by applying network coding on the physical layer or the network layer and compare the results in terms of complexity, overhead, and efficiency. Further, we discuss the advantages and disadvantages of the respective approaches.

Perspektiven im Netzbereich C.A.N. - Chemnitzer AbsolventenNetz Grafische Benutzeroberfl¨achen im Netz (VNC) PGP 5.x und GNUPG Neuigkeiten bei der Secure Shell (SSH) Vim 5.x Richtlinien zur Sicherheit im Campusnetz Ein Jahr Einsatz von Windows NT im URZ

Вислоцька Т.Ю. Кримінально-правова охорона таємниці в Україні: дисертація на здобуття наукового ступеня кандидата юридичних наук за спеціальністю 12.00.08 – кримінальне право та кримінологія; кримінально-виконавче право / Вислоцька Тетяна Юріївна. – Львів: ЛьвДУВС, 2017. - 275 с.
Дисертація є комплексним дослідженням охорони таємниці. У роботі проаналізовано стан теоретичного дослідження питання кримінально-правової охорони таємниці та розвиток нормативного закріплення охорони таємниці в пам’ятках вітчизняного кримінального права. Констатовано, що попри відповідну увагу до охорони таємниці в теорії кримінального права, сьогодні вчені одностайні лише щодо того, що таємниця є інформацією, обмеженою в доступі, відомості (інформація), що складають ту чи іншу таємницю, повинні розцінюватися в кримінальному праві як предмет кримінально-правової охорони, питання захисту тієї чи іншої таємниці повинні бути врегульовані нормами Особливої частини КК України, таємниця має свою видову класифікацію в кримінальному праві, пов’язану з особливостями предмета охорони. Водночас низка інших питань, які стосуються охорони таємниці, залишаються недослідженими або ж дискусійними. Досліджено історію становлення охорони таємниці в кримінальному законодавстві України. Аргументовано, що норми про охорону таємниці були розміщені в Литовських статутах. Поступово законодавець виокремлює окремі види таємниці, охоронюваної у кримінальному законі. Спочатку своє закріплення знайшли норми про охорону державної таємниці, згодом - сімейної та особистої таємниці, таємниці листування, різновидів професійної таємниці, комерційної таємниці тощо. Рівень захисту таємниці в кримінальному законодавстві залежав від конкретної історичної епохи. Здійснено порівняльний аналіз нормативної регламентації охорони таємниці в кримінальних законах України та окремих зарубіжних держав. Встановлено, що положення більшості проаналізованих кримінальних законів мають, порівняно зі законодавством України, низку як спільних, так і відмінних рис. До спільних, зокрема, належать: відсутність законодавчого визначення поняття таємниці та однозначності його тлумачення; закріплення норм про охорону окремих видів таємниці в кримінальному законі; тощо. Аналіз санкцій за посягання на таємницю, що охороняється нормами кримінального права, свідчить про те, що в КК зарубіжних держав по-різному визначена суспільна небезпечність аналізованих діянь. Узагальнено систему норм та дано загальну характеристику типових посягань на таємницю. Автором систематизовано норми в залежності від суб’єкта, якому належить таємниця. Зокрема запропонована класифікація передбачає поділ таємниць на приватні (що належать фізичним і юридичним особам, які вправі самостійно визначати, яка інформація повинна залишатися в обмеженому доступі) і публічні (що належать державі)). Обґрунтовано доцільність перегляду особливостей побудови Особливої частини КК України. З метою систематизації та згрупування в межах певного структурного елементу КК України норм про охорону таємниці, запропоновано в Особливій частині передбачити розділи «Злочини проти приватного життя фізичної особи», «Злочини проти приватного життя юридичної особи» та ін. розмістити окремі види таємниці, що охороняються нормами кримінального законодавства. Проаналізовано види діянь, пов’язані з посяганням на таємницю, яких є більше 10, зокрема розголошення, збирання, порушення, передача, зберігання, використання, знищення, поширення, зміна, втрата, отримання (з метою розголошення). Доведено, що державна таємниця захищена гірше ніж комерційна чи банківська, оскільки не передбачено кримінальну відповідальність за незаконне збирання з метою використання або використання відомостей, що становлять державну таємницю за відсутності ознак державної зради або шпигунства. Сформульовано дефініцію поняття таємниці та визначено її істотні ознаки. Встановлено співвідношення поняття таємниця та секрет. Розглянуто класифікацію таємниць, що охороняються нормами кримінального права. Запропоновано для виділення критерію класифікації таємниць, які охороняються кримінальним законодавством, врахувати такі основні умови: 1) критерієм класифікації повинні стати істотні ознаки поняття таємниці; 2) він повинен виражати найбільш характерну, суттєву ознаку кола таємниць, що охороняються кримінальним законодавством; 3) критерій повинен бути спроможним виступати в якості підстави для поділу. Наведено приклади класифікації таємниць з використанням різних критеріїв в доктрині кримінального права та критично проаналізовано позитивні та негативні особливості запропонованих варіантів класифікації таємниці. Обґрунтовано положення класифікувати таємницю в залежності від суб’єктного складу правовідносин. Здійснено комплексне дослідження меж кримінально-правової охорони таємниці за чинним КК України. Встановлено, що особиста і сімейна, професійна і службова, медична і лікарська, комерційна і банківська таємниці комерційна таємниця та ноу-хау є пов’язаними між собою, однак їх не можна ототожнювати. Конкретизовано перелік відомостей, що характеризують зміст різних видів таємниці. Удосконалено підхід про недоцільність встановлення кримінальної відповідальності за порушення священнослужителем таємниці сповіді, оскільки для реагування на відповідне діяння достатньо засобів, які містяться в нормах канонічного права. Наведені додаткові аргументи щодо необхідності встановлення кримінальної відповідальності за розголошення адвокатської і нотаріальної таємниці особою, якій вона стала відома у зв’язку із професійною діяльністю. Зроблено висновок щодо доцільності законодавчого закріплення визначених критеріїв оцінки інформації, що належить до державної таємниці, розробки критеріїв здійснення поділу відомостей за ступенем таємності відповідно до розміру можливих суспільно-небезпечних наслідків за спеціально розробленою методикою, перегляду відомостей, що входять до ЗВДТ-2005 щодо їх відповідності принципу законності та усунення суб’єктивного фактору на визначення цінності інформації та надання їй відповідного грифу таємності. Встановлено співвідношення складів злочинів, які забезпечують охорону таємниці, між собою та з іншими складами злочинів. В процесі розмежування складів злочинів, що посягають на таємницю, приділено увагу конкуренції кримінальних норм. Проаналізовано змістову конкуренцію норм, що посягають на таємницю, зокрема: 1) конкуренцію загальної і спеціальної норми; 2) конкуренцію частини і цілого. Проведено порівняння об’єктивних та суб’єктивних ознак посягання на таємницю з метою встановлення правильної кваліфікації злочинних діянь, предметом яких є таємна інформація. Розглянуто недоліки правозастосовної практики у частині призначення покарання за посягання на таємницю. Доведено непослідовність законодавця при конструюванні санкцій статей Особливої частини КК України щодо таємниці. Обґрунтовано, що призначення такого покарання як виправні роботи у складах злочинів передбачених в ст.ст. 381, 387 (ч. 2) КК України є неможливим, зважаючи на те, що відповідно до ч. 2 ст. 57 КК України виправні роботи не застосовуються, з-поміж інших, до працівників правоохоронних органів, прокурорів, службових осіб, якими прийнято рішення про відповідні заходи, якими і є працівники правоохоронних органів, прокуратури тощо. У зв’язку із цим, даний вид покарання має бути вилучений законодавцем із відповідних санкцій. Констатовано, що при реалізації кримінальної відповідальності, доцільно виходити з того, що чим вищий рівень таємності відомостей, що становлять державну таємницю, тим суворішим має бути покарання за посягання на даний вид таємниці. Запропоновано зміни до статей Загальної та Особливої частин КК України, пов’язаних з охороною таємниці, з метою вдосконалення практики їх застосування. The dissertation is a comprehensive research on secrecy. The article analyzes the state of theoretical study of the issue of criminal-legal secrecy and the development of normative securing of secrecy in the monuments of domestic criminal law. It is stated that despite the appropriate attention to the protection of secrecy in the theory of criminal law, today scientists are unanimous only about that the secret is information restricted in access, data (information), which constitutes one or another of the secrets, should be regarded as the subject of criminal law protection of criminal law, the issues of protection of one or another secret must be regulated by the norms of the Special Section of the Criminal Code of Ukraine, the secret has its own classification in criminal law, related to the peculiarities of the subject of protection. At the same time, a number of other issues relating to the protection of secrecy remain unexplored or controversial. The history of secrecy in the criminal legislation of Ukraine has been researched. It is argued that the rules on the protection of secrecy were placed in Lithuanian statutes. Gradually, the legislator distinguishes certain types of secrets protected by the criminal law. At first, the rules on the protection of state secrets were established, and then family and personal secrets, the secrets of correspondence, types of professional secrecy, commercial secrets, etc. The level of protection of secrecy in criminal law depended on a particular historical epoch. A comparative analysis of regulatory regulation of secrecy in the criminal laws of Ukraine and certain foreign countries was carried out. It is established that the provisions of the majority of analyzed criminal laws have a range of both common and distinctive features, in comparison with the legislation of Ukraine. Common ones include, in particular, the lack of a legislative definition of the concept of secrecy and the uniqueness of its interpretation; securing the rules on the protection of certain types of secrecy in the criminal law; etc. Analysis of sanctions for encroachment on the secrets protected by the rules of criminal law, shows that in the Criminal Code of foreign countries differently defined the social danger of the analyzed acts. The system of norms is generalized and the general characteristic of typical encroachments on the secret is given. The author systematized the rules, depending development of normative securing of secrecy in the monuments of domestic criminal law. It is stated that despite the appropriate attention to the protection of secrecy in the theory of criminal law, today scientists are unanimous only about that the secret is information restricted in access, data (information), which constitutes one or another of the secrets, should be regarded as the subject of criminal law protection of criminal law, the issues of protection of one or another secret must be regulated by the norms of the Special Section of the Criminal Code of Ukraine, the secret has its own classification in criminal law, related to the peculiarities of the subject of protection. At the same time, a number of other issues relating to the protection of secrecy remain unexplored or controversial. The history of secrecy in the criminal legislation of Ukraine has been researched. It is argued that the rules on the protection of secrecy were placed in Lithuanian statutes. Gradually, the legislator distinguishes certain types of secrets protected by the criminal law. At first, the rules on the protection of state secrets were established, and then family and personal secrets, the secrets of correspondence, types of professional secrecy, commercial secrets, etc. The level of protection of secrecy in criminal law depended on a particular historical epoch. A comparative analysis of regulatory regulation of secrecy in the criminal laws of Ukraine and certain foreign countries was carried out. It is established that the provisions of the majority of analyzed criminal laws have a range of both common and distinctive features, in comparison with the legislation of Ukraine. Common ones include, in particular, the lack of a legislative definition of the concept of secrecy and the uniqueness of its interpretation; securing the rules on the protection of certain types of secrecy in the criminal law; etc. Analysis of sanctions for encroachment on the secrets protected by the rules of criminal law, shows that in the Criminal Code of foreign countries differently defined the social danger of the analyzed acts. The system of norms is generalized and the general characteristic of typical encroachments on the secret is given. The author systematized the rules, depending The comprehensive study of the criminal law secrets under the current Criminal Code of Ukraine was conducted. It has been established that personal and family, professional and service, medical, commercial and banking secrets and know-how are interrelated, but they cannot be identified. A list of information characterizing the content of different types of secrets is specified. The approach to the inappropriateness of establishing criminal liability for the violation of a clergyman’s secrecy of confession is improved, so far as for responding to the relevant act there are sufficient means, which are contained in the norms of canon law. The additional arguments regarding the need to establish criminal liability for the disclosure of lawyer’s and notary’s secrecy by a person to whom they became aware in connection with professional activities are described. The conclusion is made on the appropriateness of the legislative consolidation of stated criteria for the evaluation of information that is classified as state secrets, the development of criteria for the division of information by degree of secrecy in accordance with the size of possible social and dangerous consequences by a specially designed methodology, revision of the information included in the code that constituting the state secret-2005 on their compliance the principle of legality and the elimination of the subjective factor in determining the value of information and giving it an appropriate privacy seal. The correlation of the body of crimes, securing the secrecy, between themselves and with others body of crimes is established. In the process of delimiting the body of crimes that encroach on the secret, attention is paid to the competition of criminal norms. The content competition of the norms encroaching on the secret is analyzed, in particular: 1) competition of general and special norms; 2) competition part and whole. The comparison of objective and subjective features of encroachment on secrets was conducted in order to establish the correct qualification of criminal acts, the subject of which is secret information. The shortcomings of the practice of law enforcement in the part of imposing punishment for encroachment on the secret are considered. The inconsistency of the legislator in the designing of sanctions on articles of the Special Section of the Criminal Code of Ukraine on secrecy has been proved. It is motivated that the purpose of such a punishment as correctional practice in the body of the crimes provided in Art. 381, 387 (part 2) of the Criminal Code of Ukraine is impossible, considering that in accordance with Part 2 of Art. 57 of the Criminal Code of Ukraine correctional practice is not applied, among other things, to law enforcement officers, prosecutors, officials who have decided on appropriate measures, that are the employees of law enforcement agencies, prosecutors, etc. In this regard, this type of punishment should be removed by the legislator from the appropriate sanctions. It is stated that in the realization of criminal liability, it is reasonable to proceed from the fact that the higher the level of secrecy of the information constituting the state secret, the more severe should be punishment for encroachment on this kind of secrecy. The changes to articles of the General and Special Sections of the Criminal Code of Ukraine related to the protection of the secrecy, with the aim of improving the practice of their application are proposed.

Secret key generation from reciprocal multi-antenna channels is an interesting alternative to cryptographic key management in wireless systems without infrastructure access. In this work, we study the secret key rate for the basic source model with a MIMO channel. First, we derive an expression for the secret key rate under spatial correlation modelled by the Kronecker model and with spatial precoding at both communication nodes. Next, we analyze the result for uncorrelated antennas to understand the optimal precoding for this special case, which is equal power allocation. Then, the impact of correlation is characterized using Majorization theory. Surprisingly for small SNR, spatial correlation increases the secret key rate. For high SNR, the maximum secret key rate is achieved for uncorrelated antennas. The results indicate that a solid system design for reciprocal MIMO key generation is required to establish the secret key rate gains.

Meiosis is a specialized cell cycle, which generates haploid gametes from diploid parental cells. During meiosis one round of cohesion establishment during premeiotic DNA replication mediates two rounds of chromosome segregation. During meiosis I homologous chromosomes separate, whereas sister chromatids segregate during the second meiotic division without an intervening round of DNA replication. Both rounds of chromosome segregation are triggered by an ubiquitin ligase called the Anaphase-Promoting Complex or Cyclosome (APC/C). APC/C-dependent destruction of securin/Pds1 is required to activate separase, a thiol protease that mediates chromosome segregation by cleavage of the cohesin complex. The first meiotic division is preceded by an extended prophase I, during which maternal and paternal chromatids undergo recombination. The persistence of cohesion during premeiotic S- and prophase I is essential for recombination and both meiotic nuclear divisions. In order to prevent premature loss of cohesion, the APC/C has to be inactivated during early meiosis. How the APC/C is kept inactive during premeiotic S- and prophase I was unknown. This question has been addressed by studying the APC/C subunit Mnd2 from the budding yeast Saccharomyces cerevisiae. This work demonstrates that Mnd2 is required for the persistence of cohesion during premeiotic S- and prophase I. Mnd2 prevents premature activation of the APC/C by the meiosis-specific substrate recognition factor Ama1. In cells lacking Mnd2, the APC/C-Ama1 enzyme triggers premature ubiquitin-dependent degradation of Pds1, which leads to premature separation of sister chromatids due to an unrestrained activity of separase. Thus, chromosome segregation during meiosis depends on both inhibition of a meiosis-specific APC/C and timely activation of APC/C- dependent proteolysis.
Die Meiose ist ein spezialisierter Zellzyklus, der zum Ziel hat haploide Gameten aus diploiden Vorläuferzellen zu produzieren. Dafür erfolgen nach der prä-meiotischen DNA Replikation zwei aufeinanderfolgende Kernteilungen. In der ersten meiotischen Teilung erfolgt die Trennung der homologen Chromosomen. In einer zweiten meiotischen Teilung werden dann die Schwesterchromatiden getrennt. Die Trennung der Chromosomen wird durch den Anaphase-Promoting Complex oder Cyclosome (APC/C), einer Ubiquitin Ligase, reguliert. Der APC/C initiiert den Abbau von Securin/Pds1, einem Inhibitor der Thiol-Protease Separase, welche für die Trennung der Chromosomen zum Beginn der Anaphase verantwortlich ist. In einer im Vergleich zur Mitose extrem langen meiotischen Prophase I findet Rekombination zwischen maternalen und paternalen Chromosomen statt. Für diesen Vorgang, sowie für die beiden folgenden meiotischen Teilungen, wird Kohäsion zwischen den Schwesterchromatiden benötigt. Ein frühzeitiger Verlust der Kohäsion führt zur frühzeitigen Trennnung der Schwesterchromatiden, wodurch aneuploide Gameten produziert werden können. Daher muss die Aktivität des APC/C während der meiotischen Prophase I inhibiert werden. Wie der APC/C während der Prophase I inaktiviert wird, war bisher unbekannt. Einsicht in dieses Problem ergab sich aus der Untersuchung der APC/C Untereinheit Mnd2 aus der Bäckerhefe Saccharomyces cerevisiae. Es wird gezeigt, dass Mnd2 für den Verbleib der Kohäsion zwischen den Schwesterchromatiden während der meiotischen S- und Prophase I benötigt wird. Während dieser Phase verhindert Mnd2 die frühzeitige Aktivierung der Meiose-spezifischen Form des APC/C-Ama1. In meiotischen Zellen, die kein Mnd2 besitzen, löst das APC/C-Ama1 Enzym die Ubiquitin-abhängige Zerstörung von Pds1 aus. Dies führt zu einer frühzeitigen Aktivierung von Separase, welches die Trennung der Schwesterchromatiden schon während der meiotischen S- und Prophase I zur Folge hat. Die korrekte Verteilung der Chromosomen hängt daher sowohl von der Inhibierung als auch der Aktivierung des APC/C ab.

Security defects or vulnerabilities are inescapable in software development. Thus, it is always better to address security issues during the software development phases, rather than developing patches after the security threats are already in place. In line with this, a number of secure software development approaches have been proposed so far to address the security issues during the development processes. However, most of these approaches lack specific process improvement activities. The practice of taking adequate corrective measures at the earliest possible time by learning from the past mistakes is absent in case of such security-aware iterative software development processes. As one might imagine, software security defect data provide an invaluable source of information for a software development team. This thesis aims at investigating existing security defect classification schemes and providing a structured security-specific defect classification and analysis methodology. Our methodology which we build on top of the Orthogonal Defect Classification (ODC) scheme, is customized to generate in-process feedback by analyzing security defect data. More specifically, we perform a detailed analysis on the classified security defect data and obtain in-process feedback using which the next version of software can be more secure and reliable. We experiment our methodology on the Mozilla Firefox and Chrome security defect repositories using six consecutive versions and milestones, respectively. We find that the in-process feedback generated by applying this methodology can help take corrective actions as early as possible in iterative secure software development processes. Finally, we study the correlations between software security defect types and the phases of software development life-cycle to understand development improvement by complementing the previous ODC scheme.
Thesis (Master, Computing) -- Queen's University, 2012-10-30 15:47:34.47

Virtualization is a mature technology in server and desktop environments where multiple systems are consolidate onto a single physical hardware platform, increasing the utilization of todays multi-core systems as well as saving resources such as energy, space and costs compared to multiple single systems. Looking at embedded environments reveals that many systems use multiple separate computing systems inside, including requirements for real-time and isolation properties. For example, modern high-comfort cars use up to a hundred embedded computing systems. Consolidating such diverse configurations promises to save resources such as energy and weight. In my work I propose a secure software architecture that allows consolidating multiple embedded software systems with timing constraints. The base of the architecture builds a microkernel-based operating system that supports a variety of different virtualization approaches through a generic interface, supporting hardware-assisted virtualization and paravirtualization as well as multiple architectures. Studying guest systems with latency constraints with regards to virtualization showed that standard techniques such as high-frequency time-slicing are not a viable approach. Generally, guest systems are a combination of best-effort and real-time work and thus form a mixed-criticality system. Further analysis showed that such systems need to export relevant internal scheduling information to the hypervisor to support multiple guests with latency constraints. I propose a mechanism to export those relevant events that is secure, flexible, has good performance and is easy to use. The thesis concludes with an evaluation covering the virtualization approach on the ARM and x86 architectures and two guest operating systems, Linux and FreeRTOS, as well as evaluating the export mechanism.

碩士
國立中興大學
資訊科學系所
94
Peer-to-peer (P2P) systems are gaining a wide popularity in actual networks, due to their decentralized structure in offering services to users. The inherent problem of such an open and anonymous environment is its weakness to attackers. A reputation system is believed to be a solution to alleviate or even stop malicious peers from harming the system. However, this reputation system should be strong enough, well designed and based on certain rules to discourage attackers and inject trust and incentives to participation into the system. In this paper, we propose a secure reputation system based on group transitivity where every requester and provider is selected according to her reputation and participation in the community service. The network is organized by area, each having a manager responsible for handling its peers’ access to other groups’ peers. In every area the transactions between the different peers and Area Managers are insured through different protocols that we designed for this purpose. A self-certification generating a Simple Distributed Security Infrastructure (SDSI) certificate is used for each transaction’s signature and uniquely identifies every peer in the network. We believe that this kind of reputation system where no contribution results in no service will have its domain of application in the large world of P2P network.

A vast number of online services is based on users contributing their personal information. Examples are manifold, including social networks, electronic commerce, sharing websites, lodging platforms, and genealogy. In all cases user privacy depends on a collective trust upon all involved intermediaries, like service providers, operators, administrators or even help desk staff. A single adversarial party in the whole chain of trust voids user privacy. Even more, the number of intermediaries is ever growing. Thus, user privacy must be preserved at every time and stage, independent of the intrinsic goals any involved party. Furthermore, next to these new services, traditional offline analytic systems are replaced by online services run in large data centers. Centralized processing of electronic medical records, genomic data or other health-related information is anticipated due to advances in medical research, better analytic results based on large amounts of medical information and lowered costs. In these scenarios privacy is of utmost concern due to the large amount of personal information contained within the centralized data. We focus on the challenge of privacy-preserving processing on genomic data, specifically comparing genomic sequences. The problem that arises is how to efficiently compare private sequences of two parties while preserving confidentiality of the compared data. It follows that the privacy of the data owner must be preserved, which means that as little information as possible must be leaked to any party participating in the comparison. Leakage can happen at several points during a comparison. The secured inputs for the comparing party might leak some information about the original input, or the output might leak information about the inputs. In the latter case, results of several comparisons can be combined to infer information about the confidential input of the party under observation. Genomic sequences serve as a use-case, but the proposed solutions are more general and can be applied to the generic field of privacy-preserving comparison of sequences. The solution should be efficient such that performing a comparison yields runtimes linear in the length of the input sequences and thus producing acceptable costs for a typical use-case. To tackle the problem of efficient, privacy-preserving sequence comparisons, we propose a framework consisting of three main parts. a) The basic protocol presents an efficient sequence comparison algorithm, which transforms a sequence into a set representation, allowing to approximate distance measures over input sequences using distance measures over sets. The sets are then represented by an efficient data structure - the Bloom filter -, which allows evaluation of certain set operations without storing the actual elements of the possibly large set. This representation yields low distortion for comparing similar sequences. Operations upon the set representation are carried out using efficient, partially homomorphic cryptographic systems for data confidentiality of the inputs. The output can be adjusted to either return the actual approximated distance or the result of an in-range check of the approximated distance. b) Building upon this efficient basic protocol we introduce the first mechanism to reduce the success of inference attacks by detecting and rejecting similar queries in a privacy-preserving way. This is achieved by generating generalized commitments for inputs. This generalization is done by treating inputs as messages received from a noise channel, upon which error-correction from coding theory is applied. This way similar inputs are defined as inputs having a hamming distance of their generalized inputs below a certain predefined threshold. We present a protocol to perform a zero-knowledge proof to assess if the generalized input is indeed a generalization of the actual input. Furthermore, we generalize a very efficient inference attack on privacy-preserving sequence comparison protocols and use it to evaluate our inference-control mechanism. c) The third part of the framework lightens the computational load of the client taking part in the comparison protocol by presenting a compression mechanism for partially homomorphic cryptographic schemes. It reduces the transmission and storage overhead induced by the semantically secure homomorphic encryption schemes, as well as encryption latency. The compression is achieved by constructing an asymmetric stream cipher such that the generated ciphertext can be converted into a ciphertext of an associated homomorphic encryption scheme without revealing any information about the plaintext. This is the first compression scheme available for partially homomorphic encryption schemes. Compression of ciphertexts of fully homomorphic encryption schemes are several orders of magnitude slower at the conversion from the transmission ciphertext to the homomorphically encrypted ciphertext. Indeed our compression scheme achieves optimal conversion performance. It further allows to generate keystreams offline and thus supports offloading to trusted devices. This way transmission-, storage- and power-efficiency is improved. We give security proofs for all relevant parts of the proposed protocols and algorithms to evaluate their security. A performance evaluation of the core components demonstrates the practicability of our proposed solutions including a theoretical analysis and practical experiments to show the accuracy as well as efficiency of approximations and probabilistic algorithms. Several variations and configurations to detect similar inputs are studied during an in-depth discussion of the inference-control mechanism. A human mitochondrial genome database is used for the practical evaluation to compare genomic sequences and detect similar inputs as described by the use-case. In summary we show that it is indeed possible to construct an efficient and privacy-preserving (genomic) sequences comparison, while being able to control the amount of information that leaves the comparison. To the best of our knowledge we also contribute to the field by proposing the first efficient privacy-preserving inference detection and control mechanism, as well as the first ciphertext compression system for partially homomorphic cryptographic systems.

The importance of knowing what type of traffic is flowing through a network is paramount to its success. Traffic shaping, Quality of Service, identifying critical business applications, Intrusion Detection Systems, as well as network administra- tion activities all require the base knowledge of what traffic is flowing over a network before any further steps can be taken. With SSL traffic on the rise due to applica- tions securing or concealing their traffic, the ability to determine what applications are running within a network is getting more and more difficult. Traditional methods of traffic classification through port numbers or deep packet inspection have been deemed inadequate by researchers thus making way for new methods. The purpose of this thesis is to investigate if a machine learning approach can be used with flow features to identify SSL in a given network trace. To this end, different machine learning methods are investigated without the use of port numbers, Internet Protocol addresses, or payload information. Various machine learning models are investigated including AdaBoost, Naive Bayes, RIPPER, and C4.5. The robustness of the results are tested against unseen datasets during training. Moreover, the proposed approach is compared to the Wireshark traffic analysis tool. Results show that the proposed ap- proach is very promising in identifying SSL traffic from a given network trace without using port numbers, Internet protocol addresses, or payload information.

Die Sicherheit und Zuverlässigkeit von Anwendungen, welche schutzwürdige Daten verarbeiten, lässt sich durch die geschützte Verlagerung in die Cloud mit einer Kombination aus zielgrößenabhängiger Datenkodierung, kontinuierlicher mehrfacher Dienstauswahl, dienstabhängiger optimierter Datenverteilung und kodierungsabhängiger Algorithmen deutlich erhöhen und anwenderseitig kontrollieren. Die Kombination der Verfahren zu einer anwendungsintegrierten Stealth-Schutzschicht ist eine notwendige Grundlage für die Konstruktion sicherer Anwendungen mit zusicherbaren Sicherheitseigenschaften im Rahmen eines darauf angepassten Softwareentwicklungsprozesses.:1 Problemdarstellung 1.1 Einführung 1.2 Grundlegende Betrachtungen 1.3 Problemdefinition 1.4 Einordnung und Abgrenzung 2 Vorgehensweise und Problemlösungsmethodik 2.1 Annahmen und Beiträge 2.2 Wissenschaftliche Methoden 2.3 Struktur der Arbeit 3 Stealth-Kodierung für die abgesicherte Datennutzung 3.1 Datenkodierung 3.2 Datenverteilung 3.3 Semantische Verknüpfung verteilter kodierter Daten 3.4 Verarbeitung verteilter kodierter Daten 3.5 Zusammenfassung der Beiträge 4 Stealth-Konzepte für zuverlässige Dienste und Anwendungen 4.1 Überblick über Plattformkonzepte und -dienste 4.2 Netzwerkmultiplexerschnittstelle 4.3 Dateispeicherschnittstelle 4.4 Datenbankschnittstelle 4.5 Stromspeicherdienstschnittstelle 4.6 Ereignisverarbeitungsschnittstelle 4.7 Dienstintegration 4.8 Entwicklung von Anwendungen 4.9 Plattformäquivalente Cloud-Integration sicherer Dienste und Anwendungen 4.10 Zusammenfassung der Beiträge 5 Szenarien und Anwendungsfelder 5.1 Online-Speicherung von Dateien mit Suchfunktion 5.2 Persönliche Datenanalyse 5.3 Mehrwertdienste für das Internet der Dinge 6 Validierung 6.1 Infrastruktur für Experimente 6.2 Experimentelle Validierung der Datenkodierung 6.3 Experimentelle Validierung der Datenverteilung 6.4 Experimentelle Validierung der Datenverarbeitung 6.5 Funktionstüchtigkeit und Eigenschaften der Speicherdienstanbindung 6.6 Funktionstüchtigkeit und Eigenschaften der Speicherdienstintegration 6.7 Funktionstüchtigkeit und Eigenschaften der Datenverwaltung 6.8 Funktionstüchtigkeit und Eigenschaften der Datenstromverarbeitung 6.9 Integriertes Szenario: Online-Speicherung von Dateien 6.10 Integriertes Szenario: Persönliche Datenanalyse 6.11 Integriertes Szenario: Mobile Anwendungen für das Internet der Dinge 7 Zusammenfassung 7.1 Zusammenfassung der Beiträge 7.2 Kritische Diskussion und Bewertung 7.3 Ausblick Verzeichnisse Tabellenverzeichnis Abbildungsverzeichnis Listings Literaturverzeichnis Symbole und Notationen Software-Beiträge für native Cloud-Anwendungen Repositorien mit Experimentdaten
The security and reliability of applications processing sensitive data can be significantly increased and controlled by the user by a combination of techniques. These encompass a targeted data coding, continuous multiple service selection, service-specific optimal data distribution and coding-specific algorithms. The combination of the techniques towards an application-integrated stealth protection layer is a necessary precondition for the construction of safe applications with guaranteeable safety properties in the context of a custom software development process.:1 Problemdarstellung 1.1 Einführung 1.2 Grundlegende Betrachtungen 1.3 Problemdefinition 1.4 Einordnung und Abgrenzung 2 Vorgehensweise und Problemlösungsmethodik 2.1 Annahmen und Beiträge 2.2 Wissenschaftliche Methoden 2.3 Struktur der Arbeit 3 Stealth-Kodierung für die abgesicherte Datennutzung 3.1 Datenkodierung 3.2 Datenverteilung 3.3 Semantische Verknüpfung verteilter kodierter Daten 3.4 Verarbeitung verteilter kodierter Daten 3.5 Zusammenfassung der Beiträge 4 Stealth-Konzepte für zuverlässige Dienste und Anwendungen 4.1 Überblick über Plattformkonzepte und -dienste 4.2 Netzwerkmultiplexerschnittstelle 4.3 Dateispeicherschnittstelle 4.4 Datenbankschnittstelle 4.5 Stromspeicherdienstschnittstelle 4.6 Ereignisverarbeitungsschnittstelle 4.7 Dienstintegration 4.8 Entwicklung von Anwendungen 4.9 Plattformäquivalente Cloud-Integration sicherer Dienste und Anwendungen 4.10 Zusammenfassung der Beiträge 5 Szenarien und Anwendungsfelder 5.1 Online-Speicherung von Dateien mit Suchfunktion 5.2 Persönliche Datenanalyse 5.3 Mehrwertdienste für das Internet der Dinge 6 Validierung 6.1 Infrastruktur für Experimente 6.2 Experimentelle Validierung der Datenkodierung 6.3 Experimentelle Validierung der Datenverteilung 6.4 Experimentelle Validierung der Datenverarbeitung 6.5 Funktionstüchtigkeit und Eigenschaften der Speicherdienstanbindung 6.6 Funktionstüchtigkeit und Eigenschaften der Speicherdienstintegration 6.7 Funktionstüchtigkeit und Eigenschaften der Datenverwaltung 6.8 Funktionstüchtigkeit und Eigenschaften der Datenstromverarbeitung 6.9 Integriertes Szenario: Online-Speicherung von Dateien 6.10 Integriertes Szenario: Persönliche Datenanalyse 6.11 Integriertes Szenario: Mobile Anwendungen für das Internet der Dinge 7 Zusammenfassung 7.1 Zusammenfassung der Beiträge 7.2 Kritische Diskussion und Bewertung 7.3 Ausblick Verzeichnisse Tabellenverzeichnis Abbildungsverzeichnis Listings Literaturverzeichnis Symbole und Notationen Software-Beiträge für native Cloud-Anwendungen Repositorien mit Experimentdaten

The cloud computing business grows year after year. To keep up with increasing demand and to offer more services, data center providers are always searching for novel architectures. One of them are FPGAs, reconfigurable hardware with high compute power and energy efficiency. But some clients cannot make use of the remote processing capabilities. Not every involved party is trustworthy and the complex management software has potential security flaws. Hence, clients’ sensitive data or algorithms cannot be sufficiently protected. In this thesis state-of-the-art hardware, cloud and security concepts are analyzed and com- bined. On one side are reconfigurable virtual FPGAs. They are a flexible resource and fulfill the cloud characteristics at the price of security. But on the other side is a strong requirement for said security. To provide it, an immutable controller is embedded enabling a direct, confidential and secure transfer of clients’ configurations. This establishes a trustworthy compute space inside an untrusted cloud environment. Clients can securely transfer their sensitive data and algorithms without involving vulnerable software or a data center provider. This concept is implemented as a prototype. Based on it, necessary changes to current FPGAs are analyzed. To fully enable reconfigurable yet secure hardware in the cloud, a new hybrid architecture is required.
Das Geschäft mit dem Cloud Computing wächst Jahr für Jahr. Um mit der steigenden Nachfrage mitzuhalten und neue Angebote zu bieten, sind Betreiber von Rechenzentren immer auf der Suche nach neuen Architekturen. Eine davon sind FPGAs, rekonfigurierbare Hardware mit hoher Rechenleistung und Energieeffizienz. Aber manche Kunden können die ausgelagerten Rechenkapazitäten nicht nutzen. Nicht alle Beteiligten sind vertrauenswürdig und die komplexe Verwaltungssoftware ist anfällig für Sicherheitslücken. Daher können die sensiblen Daten dieser Kunden nicht ausreichend geschützt werden. In dieser Arbeit werden modernste Hardware, Cloud und Sicherheitskonzept analysiert und kombiniert. Auf der einen Seite sind virtuelle FPGAs. Sie sind eine flexible Ressource und haben Cloud Charakteristiken zum Preis der Sicherheit. Aber auf der anderen Seite steht ein hohes Sicherheitsbedürfnis. Um dieses zu bieten ist ein unveränderlicher Controller eingebettet und ermöglicht eine direkte, vertrauliche und sichere Übertragung der Konfigurationen der Kunden. Das etabliert eine vertrauenswürdige Rechenumgebung in einer nicht vertrauenswürdigen Cloud Umgebung. Kunden können sicher ihre sensiblen Daten und Algorithmen übertragen ohne verwundbare Software zu nutzen oder den Betreiber des Rechenzentrums einzubeziehen. Dieses Konzept ist als Prototyp implementiert. Darauf basierend werden nötige Änderungen von modernen FPGAs analysiert. Um in vollem Umfang eine rekonfigurierbare aber dennoch sichere Hardware in der Cloud zu ermöglichen, wird eine neue hybride Architektur benötigt.

The chasm in the protection of classified information in South African government indicates that all the departments have at their disposal information that is to some extent sensitive in nature and obviously requires security measures. This study shows that government officials who in their official duties come to contact with classified information are either vulnerable or are implementing the security controls incorrectly. It is also clear that in the absence of a comprehensive statutory framework, the government departments’ classified information has resulted in an unstable and inconsistent classification and declassification environment. The statutory framework would, in addition to other things, address the rising threat of espionage and antagonistic activities, the selling of information and the protection of critical records in government, without hindering the constitutional rights of citizens to access information. This would create a system of valuable informantion and clarify which information requires security measures with respect to the protection of classified information.
Kgaohanao e tshireletsong ya tlhahisoleseding e sireleditsweng ke mmuso wa Afrika Borwa e supa hore mafapha ohle a ona a na le tlhahisoleseding eo, ka ho hong, e leng ya sephiri mme e hloka maemo a tshireletso. Boithuto bona bo bontsha hore bahlanka ba mmuso bao, tshebetsong ya bona ya semmuso, ba teanang le tlhahisoleseding ya sephiri, ba kotsing hobane ba sebedisa ditaelo tsa polokeho ka mokgwa o fosahetseng. Ho boetse ho hlakile hore, bosikong ba moralo o phethahetseng wa semolao, disistimi tse sa sebetseng hantle tsa mafapa a mmuso tsa tlhahisoleseding ya sephiri di bakile tikoloho e sa tsitsang hape e sa hlophiswang ya tlhophiso le tloso ya tlhophiso ya tlhahisoleseding. Moralo wa semolao, hara tse ding, o ka sebetsana le phephetso e eketsehang ya bohlwela le diketsahalo tse ding tse belaetsang tse jwalo ka thekiso ya tlhahisoleseding, mme o sireletse direkote tsa mmuso tsa bohlokwa ntle le ho hatakela tokelo ya Molaotheo ya baahi ya phihlello ho tlhahisoleseding. Hona ho ka theha sistimi ya tlhahisoleseding ya bohlokwa le ho hlakisa hore na ke tlhahisoleseding efe e hlokang maemo a tshireletso ha ho tluwa ntlheng polokeho ya tlhahisoleseding ya sephiri.
Umsantsa okhoyo ekukhuseleni ulwazi olukhethekileyo kurhulumente woMzantsi Afrika ubonisa ukuba onke amaSebe anolwazi analo olunokuba nkenenkene, kwaye oludinga ukhuseleko. Esi sifundo sibonisa ukuba asesichengeni amagosa karhulumente aye athi apha ekusebenzeni kwawo, adibane nolwazi olukhethekileyo, ngoba azisebenzisa gwenxa iindlela zokulawula ukhuseleko. Kukwacaca ukuba, ekubeni kungekho sikhokelo namigaqo isemthethweni, iinkqubo ezingasebenzi kakuhle zamaSebe karhulumente, ulwazi olukhethekileyo aluhlelwa ngendlela eyiyo kwaye lufumaneka kwiimeko ezingaluphathi ngokukhetheka. Ubukho besikhokelo nemigaqo yokhuseleko lolwazi inganceda ekunqandeni isoyikiso esikhulu sobhukuqo mbuso nezinye iziganeko ezikrokrisayo, ezifana nokuthengiswa kolwazi, Esi sikhokelo singanceda nasekukhuseleni iingxelo zikarhulumente ezinkenenkene ngaphandle kokucinezela amalungelo abemi okufumana ulwazi njengoko uvuma uMgaqo Siseko. Oku kuya kuvelisa inkqubo yolwazi olunexabiso kwaye kuya kucacisa ukuba loluphi ulwazi oludinga imimiselo yokhuseleko malunga nokukhuselwa kolwazi olukhethekileyo.
Criminology and Security Science
M. Tech. (Forensic Investigation)

Загородный І.В. Розслідування злочинів, пов’язаних із нанесенням тілесних ушкоджень: дис. ... канд. юрид .наук: 12.00.09 / Загородній Ігор Вікторович. - О., 2018. - 242 с.
Дисертація на здобуття наукового ступеня кандидата юридичних наук за спеціальністю 12.00.09 - кримінальний процес та криміналістика; судова експертиза; оперативно-розшукова діяльність. - Національний університет «Одеська юридична академія», Одеса, 2018. Дисертація є одним із перших після прийняття нового КПК України спеціальним комплексним дослідженням розслідування злочинів, пов’язаних із нанесенням тілесних ушкоджень. У дисертації розглянуто сучасний стан наукового забезпечення розслідування злочинів, пов’язаних із нанесенням тілесних ушкоджень, та виокремлено комплекси невирішених проблем. Розроблено класифікацію злочинів цієї категорії з урахуванням криміналістично значимих критеріїв. З урахуванням сучасної практики розслідування вказаних злочинів оновлено їх криміналістичну характеристику. На основі наявних теоретичних напрацюваннь та матеріалів практики виокремлено типові слідчі ситуації початкового етапу розслідування, визначено систему завдань, які підлягають розв’язанню, та відповідних алгоритмів їх вирішення для кожної ситуації. З урахуванням положень оновленого кримінального процесуального законодавства розроблено систему обставин, які підлягають встановленню, що включає вісім блоків даних. Враховуючи зміни у системі слідчих (розшукових) дій, виокремлено тактичні особливості їх проведення та функціональне признання під час розслідування кримінальних проваджень за злочинами цієї категорії. Окреслено систему негласних слідчих (розшукових) дій, які проводяться під час досудового розслідування таких злочинів, а також виокремлено відповідні завдання, що вирішуються за допомогою кожної з них. Досліджено основні форми використання спеціальних знань під час розслідування та окреслено типове коло завдань, які вирішуються за допомогою конкретних судових чи криміналістичних експертиз.
Диссертация на соискание научной степени кандидата юридических наук по специальности 12.00.09 - уголовный процесс и криминалистика; судебная экспертиза; оперативно-розыскная деятельность. - Национальный университет «Одесская юридическая академия», Одесса, 2018. Диссертация является одним из первых комплексных исследований расследования нанесения телесных повреждений после принятия нового УПК Украины. В диссертации проанализированы наработки ученых-криминологов и криминалистов касательно особенностей предупреждения и расследования преступлений, связанных с нанесением телесных повреждений, в результате чего выделены комплексы проблем, которые требуют дополнительного научного обоснования. Исходя из анализа практики работы следственных подразделений, предложена классификация таких преступлений на основании криминалистических критериев (способ совершения преступления, обстановка совершения преступления, взаимоотношений жертвы и преступника, личности жертвы). Уточнена характеристика составляющих криминалистической характеристики данных преступлений, в частности, типичные способы совершения, данные о личности преступника и жертвы, обстановка совершения преступлений, а также система средств, применяемых для их совершения. С учетом следственной практики предложена система обстоятельств, подлежащих установлению во время расследования, которая включает восемь блоков вопросов. Базируясь на теоретических наработках ученых, а также современной практике расследования данных преступлений предложены типичные ситуации начального этапа расследования: лицо задержано на месте преступления, личность потерпевшего известна, очевидцы преступления установлены; преступник скрылся с места происшествия, но есть первичные данные о нем; преступник скрылся с места происшествия, а информация о нем отсутствует или ограничена. Предложена типичная система задач, которые подлежат решению в таких ситуациях, а также алгоритмы их решения. Выделена система следственных (розыскных) действий, типичных для расследования таких преступлений: осмотр места происшествия, допрос, освидетельствование, следственный эксперимент. Обосновано, что во время расследования отдельных видов нанесения телесных повреждений целесообразно проводить такие негласные следственные (розыскные) действия: аудио-, видеоконтроль лица; снятие информации с транспортных телекоммуникационных систем и сетей; обследование публично недоступных мест, жилища или иного владения лица; установление места нахождения радиоэлектронного средства; наблюдение за лицом или местом. Определена система задач, которая решается при помощи указанных следственных действий во время досудебного расследования нанесения телесных повреждений. Установлено, что специальные знания при расследовании таких преступлений предусматривают проведение судебных экспертиз: судебномедицинской; геноидентификационной; судебно-психиатрической; наркологической; судебно-психологической; криминалистических; комплексных (психолого-психиатрической, медико-криминалистической).
Dissertation for obtaining the degree of Ph.D. in Law Science by specialty 12.00.09 - Criminal Procedure and Criminalistics; Forensics examination; Operatively-Search Activity. - National University “Odessa Law Academy”, Odesa, 2018. The dissertation is one of the first after the adoption of the new criminal procedural law by a special complex investigation of the investigation of crimes related to the infliction of bodily injuries. The dissertation considers the current state of scientific support for the investigation of crimes related to the infliction of bodily injuries and identifies complexes of unresolved problems. The classification of crimes in this category is developed taking into account forensic criteria. In view of the current practice of investigating these crimes, their forensic characterization has been updated in terms of specifying the methods of their commission, the identification of typical instruments used and the personal characteristics of the perpetrator’s and victim’s personality. Based on available theoretical developments and materials of practice, typical investigative situations of the initial stage of investigation are identified, the system of tasks to be solved and the corresponding algorithms for their solution for each situation are determined. Taking into account the provisions of the new criminal procedural law, a system of circumstances to be established, which includes eight blocks of data, has been developed. Taking into account changes in the system of investigative (search) actions, the tactical peculiarities of their conduct and functional recognition in the investigation of criminal proceedings for crimes in this category are singled out. The system of secret investigative (search) actions carried out during the pre-trial investigation of such crimes is outlined, as well as the corresponding tasks, which are solved with the help of each of them, are outlined. The main forms of using special knowledge during the investigation are investigated and a typical range of tasks, which are solved with the help of specific judicial or forensic examinations, is outlined.

The thesis focuses on the privacy of communication that can be ensured by means of the physical layer, i.e., by appropriately chosen coding and resource allocation schemes. The fundamentals of physical-layer security have been already formulated in the 1970s by Wyner (1975), Csiszár and Körner (1978). But only nowadays we have the technical progress such that these ideas can find their way in current and future communication systems, which has driven the growing interest in this area of research in the last years. We analyze two physical-layer approaches that can ensure the secret transmission of private information in wireless systems in presence of an eavesdropper. One is the direct transmission of the information to the intended receiver, where the transmitter has to simultaneously ensure the reliability and the secrecy of the information. The other is a two-phase approach, where two legitimated users first agree on a common and secret key, which they use afterwards to encrypt the information before it is transmitted. In this case, the secrecy and the reliability of the transmission are managed separately in the two phases. The secrecy of the transmitted messages mainly depends on reliable information or reasonable and justifiable assumptions about the channel to the potential eavesdropper. Perfect state information about the channel to a passive eavesdropper is not a rational assumption. Thus, we introduce a deterministic model for the uncertainty about this channel, which yields a set of possible eavesdropper channels. We consider the optimization of worst-case rates in systems with multi-antenna Gaussian channels for both approaches. We study which transmit strategy can yield a maximum rate if we assume that the eavesdropper can always observe the corresponding worst-case channel that reduces the achievable rate for the secret transmission to a minimum. For both approaches, we show that the resulting max-min problem over the matrices that describe the multi-antenna system can be reduced to an equivalent problem over the eigenvalues of these matrices. We characterize the optimal resource allocation under a sum power constraint over all antennas and derive waterfilling solutions for the corresponding worst-case channel to the eavesdropper for a constraint on the sum of all channel gains. We show that all rates converge to finite limits for high signal-to-noise ratios (SNR), if we do not restrict the number of antennas for the eavesdropper. These limits are characterized by the quotients of the eigenvalues resulting from the Gramian matrices of both channels. For the low-SNR regime, we observe a rate increase that depends only on the differences of these eigenvalues for the direct-transmission approach. For the key generation approach, there exists no dependence from the eavesdropper channel in this regime. The comparison of both approaches shows that the superiority of an approach over the other mainly depends on the SNR and the quality of the eavesdropper channel. The direct-transmission approach is advantageous for low SNR and comparably bad eavesdropper channels, whereas the key generation approach benefits more from high SNR and comparably good eavesdropper channels. All results are discussed in combination with numerous illustrations.
Der Fokus dieser Arbeit liegt auf der Abhörsicherheit der Datenübertragung, die auf der Übertragungsschicht, also durch geeignete Codierung und Ressourcenverteilung, erreicht werden kann. Die Grundlagen der Sicherheit auf der Übertragungsschicht wurden bereits in den 1970er Jahren von Wyner (1975), Csiszár und Körner (1978) formuliert. Jedoch ermöglicht erst der heutige technische Fortschritt, dass diese Ideen in zukünftigen Kommunikationssystemen Einzug finden können. Dies hat in den letzten Jahren zu einem gestiegenen Interesse an diesem Forschungsgebiet geführt. In der Arbeit werden zwei Ansätze zur abhörsicheren Datenübertragung in Funksystemen analysiert. Dies ist zum einen die direkte Übertragung der Information zum gewünschten Empfänger, wobei der Sender gleichzeitig die Zuverlässigkeit und die Abhörsicherheit der Übertragung sicherstellen muss. Zum anderen wird ein zweistufiger Ansatz betrachtet: Die beiden Kommunikationspartner handeln zunächst einen gemeinsamen sicheren Schlüssel aus, der anschließend zur Verschlüsselung der Datenübertragung verwendet wird. Bei diesem Ansatz werden die Abhörsicherheit und die Zuverlässigkeit der Information getrennt voneinander realisiert. Die Sicherheit der Nachrichten hängt maßgeblich davon ab, inwieweit zuverlässige Informationen oder verlässliche Annahmen über den Funkkanal zum Abhörer verfügbar sind. Die Annahme perfekter Kanalkenntnis ist für einen passiven Abhörer jedoch kaum zu rechtfertigen. Daher wird hier ein deterministisches Modell für die Unsicherheit über den Kanal zum Abhörer eingeführt, was zu einer Menge möglicher Abhörkanäle führt. Die Optimierung der sogenannten Worst-Case-Rate in einem Mehrantennensystem mit Gaußschem Rauschen wird für beide Ansätze betrachtet. Es wird analysiert, mit welcher Sendestrategie die maximale Rate erreicht werden kann, wenn gleichzeitig angenommen wird, dass der Abhörer den zugehörigen Worst-Case-Kanal besitzt, welcher die Rate der abhörsicheren Kommunikation jeweils auf ein Minimum reduziert. Für beide Ansätze wird gezeigt, dass aus dem resultierenden Max-Min-Problem über die Matrizen des Mehrantennensystems ein äquivalentes Problem über die Eigenwerte der Matrizen abgeleitet werden kann. Die optimale Ressourcenverteilung für eine Summenleistungsbeschränkung über alle Sendeantennen wird charakterisiert. Für den jeweiligen Worst-Case-Kanal zum Abhörer, dessen Kanalgewinne einer Summenbeschränkung unterliegen, werden Waterfilling-Lösungen hergeleitet. Es wird gezeigt, dass für hohen Signal-Rausch-Abstand (engl. signal-to-noise ratio, SNR) alle Raten gegen endliche Grenzwerte konvergieren, wenn die Antennenzahl des Abhörers nicht beschränkt ist. Die Grenzwerte werden durch die Quotienten der Eigenwerte der Gram-Matrizen beider Kanäle bestimmt. Für den Ratenanstieg der direkten Übertragung ist bei niedrigem SNR nur die Differenz dieser Eigenwerte maßgeblich, wohingegen für den Verschlüsselungsansatz in dem Fall keine Abhängigkeit vom Kanal des Abhörers besteht. Ein Vergleich zeigt, dass das aktuelle SNR und die Qualität des Abhörkanals den einen oder anderen Ansatz begünstigen. Die direkte Übertragung ist bei niedrigem SNR und verhältnismäßig schlechten Abhörkanälen überlegen, wohingegen der Verschlüsselungsansatz von hohem SNR und vergleichsweise guten Abhörkanälen profitiert. Die Ergebnisse der Arbeit werden umfassend diskutiert und illustriert.

Die Arbeit behandelt die beiden Übersetzungsversionen des Lukasevangeliums ins Caló, die George Borrow 1837 und 1872 anfertigte. Sie hat mehrere Zielstellungen. Der erste Teil geht der Frage nach: Wie kam es zu den beiden Schriften? Er legt dar, welche Einflussfaktoren das authentische Caló im Spanien der 1830er Jahre herausgeprägt haben konnten und welche Einflüsse durch den Übersetzer George Borrow auf die Übersetzungen wirkten. Als extralinguistische Faktoren wird dafür die (Kultur-)Geschichte der Gitanos herangezogen, werden Borrows Biographie sowie seine Sprachkenntnisse untersucht und werden die Aufsätze namhafter Autoren über die Entstehung des Calós diskutiert und gegeneinander abgewogen. So entsteht zum ersten Mal eine komplexe Zusammenfassung der Vorgeschichte des Calós der Evangelien. Der zweite Teil der Arbeit ist einerseits eine Anleitung, die das Caló anhand von Textbeispielen für Hispanisten lesbar macht, und prüft andererseits, ob und wie die Aussage zutrifft, dass Borrows Purifizierungsbestrebungen in der zweiten Übersetzungsversion ein Caló schufen, das einen wesentlich geringeren Anteil an spanischer Sprache hat als in der ersten Version. Die Frage nach der Purifizierung erscheint vor dem Hintergrund der damaligen verklärenden Zigeunermode, der Afición, in Spanien sowie angesichts des Polyglotten Borrow bedeutsam. Um ihr nachzugehen, werden die ersten siebeneinhalb Kapitel beider Übersetzungen mit Hilfe von Textanalyseprogrammen wortartenspezifisch untersucht. Das Ergebnis bestätigt die Annahme bei zehn von sechzehn Wortarten und zeigt auf, dass besonders bei den Autosemantika Purifizierungsversuche unternommen wurden. Wahrscheinlich war aber schon die erste Übersetzungsversion purifiziert. Die Arbeit liefert einen ersten detaillierten linguistischen Vergleich eines Teiles der beiden Versionen und stellt das Caló der Evangelien in einem sehr umfassenden Kontext vor, wodurch sich eine Vernetzung linguistischer, kulturwissenschaftlicher und literaturwissenschaftlich interessanter Aspekte ergibt.:o. Vorwort & Danksagung i. Einleitung i.i. Begriffsbestimmung i.ii. Zielsetzung der Arbeit Teil I: Die Ursachen der Sprachinterferenz in den Lukasevangelien I.1. Die Geschichte der Gitanos bis ins 19. Jahrhundert I.1.1. Die prähispanische Phase I.1.2. Die erste Phase von 1425 bis 1499 I.1.3. Die zweite Phase von 1499 bis 1783 I.1.4. Die dritte Phase im 19. Jahrhundert I.2. Die Genese des Calós bis ins 19. Jahrhundert I.2.1. Denkmäler des Calós vor den Evangelien I.2.2. Die Debatte um die Genese des Calós I.2.2.1. Caló versus Pidgin-/ Kreolsprachen: Boretzky (1985) und Romero Yantorno I.2.2.2. Code-Switching, Pogadisierung, Geheimsprachen und Language Intertwining: Bakker & van der Voort (1991) I.2.2.3. Archaismen, kryptische Formationen, andalusische Merkmale und unabhängige Lexikentwicklung: Bakker (1995) I.2.2.4. Das katalonische Romaní als Indiz für die zeitliche Einordnung: Boretzky (1992) I.2.2.5. Das Caló als Alltagssprache und im Vergleich mit anderen Romaní-Dialekten: Boretzky (1998) I.2.2.6. Von der Alltagssprache zum geheimsprachlichen Vokabular: Bakker (1998) I.2.2.7. Zusammenfassung der Debatte I.3. George Henry Borrow I.3.1. Kurzbiographie I.3.2. Borrows Romaní-, Spanisch- und Caló-Kenntnisse Teil II: Der Anteil des Spanischen in den Lukasevangelien II.1. Texterschließung für Hispanisten II.1.1. Wörterbücher II.1.2. Grammatik II.1.2.1. Caló-Deklinationssuffixe II.1.2.2. Caló-Hilfsverben II.1.3. Textausschnitte II.1.3.1. Textausschnitt 1: Titelseiten und Vorworte Borrows II.1.3.2. Textausschnitt 2: Lukas 15, 1 - 4 . II.2. Wortartenspezifische Analyse des Anteils des Spanischen II.2.1. Vorgehen II.2.2. Auswertung II.3. Schluss Anhänge Anhang 1: Vergleich des Anteils des Spanischen an den Lukasevangelien 1 - 8,25 auf Caló von 1837 und 1872 in wortartenspezifischen, systematisierten und kommentierten Wortfrequenzlisten A.1. Flektierbare Wortarten A.1.1. Die Artikel A.1.2. Die Substantive A.1.3. Die Eigennamen A.1.4. Die Pronomina A.1.4.1. Die Personal- und Reflexivpronomina A.1.4.2. Die Demonstrativpronomina A.1.4.3. Die Possesivpronomina A.1.4.4. Die Relativpronomina A.1.4.5. Die Indefinitpronomina A.1.5. Die Adjektiva A.1.6. Die Verba A.1.7. Die Numeralia A.2. Unflektierbare Wortarten A.2.1. Die Adverbien A.2.2. Die Präpositionen A.2.3. Die Interrogativa A.2.4. Die Konjunktionen A.2.5. Die Interjektionen Anhang 2: Paralleltexte: Die Lukasevangelien 1 - 8,25 auf Caló von 1837 und von 1872 und das spanische Lukasevangelium 1 - 8,25 übersetzt von Scío Abbildungsverzeichnis Quellenverzeichnis Tabellenverzeichnis