No description available.

To prevent unauthorized access of multimedia content, effective access control and efficient key management schemes are of crucial importance for multimedia live streaming applications. To address the network heterogeneity, this thesis investigates scalable and multilevel access control, where a single bit stream can offer access to different levels of service. It uses the POSET hash-based structure to explore the data dependency between different layers in scalable coding, and proposes a secure and efficient key management scheme that uses public information and hash functions to reduce the rekey overhead. For those applications that require strict forward/backward security, sequential rekey is used to update keys. This thesis also addresses frequent membership update in live streaming, and considers applications that can tolerate a small amount of content leak. Through exploring their unique characteristics in membership dynamics, the proposed schemes reduce the rekey cost significantly. / Digital Signals and Image Processing

The key update cost is an important parameter of the performance evaluation of the secure group communications in the wireless networks. It is a very public issue to reduce the key update cost. In the tree-based multicast key management scheme, a user is randomly assigned to one of the all leaf nodes. In this thesis, we divide the users into two groups which are new call users and handoff call users. Then, we propose that new call users are assigned to some of the special leaf nodes in the key tree and the handoff call users are assigned to others. This scheme is called class-based multicast key management scheme. We analyze this two multicast key management schemes for secure group communications. This thesis shows that class-based scheme could reduce the key update cost in some special case.

This research investigated key management in a Mobile Ad Hoc Network (MANET) environment. At the time this research began key management schemes provided limited functionality and low service availability in a highly partitioned ad hoc environment. The purpose of this research was to develop a framework that provides redundancy and robustness for Security Association (SA) establishment between pairs of nodes. The key contribution of this research is the Key Management System (KMS) framework and, more specifically, the unique way the various components are integrated to provide the various functionalities. The KMS overcomes the limitations of previous systems by (1) minimizing pre-configuration, (2) increasing service availability, (3) and increasing flexibility for new nodes joining the network. A behavior grading scheme provides the network with a system-wide view of the trustworthiness of nodes and enables the KMS to dynamically adjust its configuration according to its environment. The introduction of behavior grading allows nodes to be less dependent on strict identity verification. This KMS was simulated with Monte Carlo and NS2 simulations and was shown to interoperate with IP Security (IPsec) to enable the establishment of IPsec SAs. The simulations have proven the effectiveness of the system in providing service to the nodes in a highly partitioned environment. / Ph. D.

Com a popularização da rede global, a Internet, as aplicações colaborativas ganharam destaque, sendo imprescindíveis nas mais diversas atividades pessoais e comerciais. Os avanços tecnológicos modernos trouxeram novas demandas de aplicações, com a inclusão de diversas funcionalidades em ambientes cooperativos como, por exemplo, a distribuição de dados multimídia sobre redes de comunicação. Entretanto, quando estas ferramentas são aplicadas em ambientes coletivos com muitos usuários, o uso das mesmas é deteriorado pelas limitações da rede. Protocolos Multicast possibilitam o uso destas aplicações colaborativas em razão de proporcionarem a redução do uso da rede para atividades coletivas, possibilitando a interação com dezenas, centenas ou milhares de usuários simultaneamente. Na medida em que as ferramentas colaborativas ganham espaço entre os usuários, surge também a necessidade do emprego de segurança entre grupos de usuários. Os grupos devem ser capazes de estabelecer comunicações Multicast seguras em que apenas os membros autorizados sejam hábeis a acessar os conteúdos veiculados pelo grupo. São exemplos de aplicativos que exigem Multicast seguro: videoconferências confidenciais, sincronismo de tabelas financeiras entre matriz e filiais, distribuição de vídeo e áudio para um grupo de assinantes, dentre inúmeras outras utilizações. A proteção do conteúdo do grupo é alcançada por meio de criptografia e as chaves devem ser atualizadas quando do ingresso de novo usuário ou na hipótese de desistência de algum membro do grupo. As técnicas de gerenciamento de chaves devem ser eficientes, tanto no aspecto de segurança, quanto no que pertine ao desempenho. Devem, ainda, possibilitar a sua utilização em grupos com quantidades massivas de usuários. Os objetivos do presente trabalho são, em suma, estudar os esquemas de gerenciamento de chaves de grupo, propor uma nova técnica cujo foco seja a minimização do uso dos recursos de rede em ambientes limitados, simular os modelos avaliados pelo simulador de rede NS-2 e analisar os impactos destes esquemas em aplicações colaborativas. Para tanto, desenvolveu-se um módulo para o NS-2 que permitiu ao simulador prover suporte ao gerenciamento de chaves, e, ainda, construíram-se dois aplicativos auxiliares para a geração de cenários e análise de resultados em simulações NS-2. / With the popularization of the Internet, collaborative applications have been gaining marketshare, becoming intrinsic to a wide range of personal and commercial activities. Modern technological improvement brought new demands for these applications, such as the inclusion of new features in cooperative environments, such as the distribution of multimedia data over communication networks. However, when these tools are applied to collective environments with many users, their usability is hindered by the network limits. Multicast protocols allow the use of these collaborative applications, since they reduce the necessary network bandwidth, allowing the interaction with tens, hundreds or thousands of users simultaneously. As collaborative tools become more popular among users, there comes also the problem of security in user groups. The groups must be able to establish secure multicast communications in which only the authorized members can access the content distributed to the group. Examples of applications which demand secure multicast are confidential videoconferences, synchronization of financial tables between the headquarter and filials, distribution of video and audio to a group of users, among many others. The protection of group contents is achieved by cryptography and the keys must be updated whenever a new users joins or leaves the group. The techniques for key management must be eficient, in terms of security and performance, and also be passible of use in groups with massive amounts of users. The goals of this work are: to study the group key management systems, to propose a new technique whose focus is to minimize the use of network resources in limited environments, to simulate the models evaluated by the network simulator NS-2 and to analyze the impacts of these systems in collaborative applications. For that, a module for NS-2 has been developed that allows the simulator to provide support to key management and, moreover, two auxiliar applications were written to generate the scenarions and analyse the simulations returned by NS-2.

Com a popularização da rede global, a Internet, as aplicações colaborativas ganharam destaque, sendo imprescindíveis nas mais diversas atividades pessoais e comerciais. Os avanços tecnológicos modernos trouxeram novas demandas de aplicações, com a inclusão de diversas funcionalidades em ambientes cooperativos como, por exemplo, a distribuição de dados multimídia sobre redes de comunicação. Entretanto, quando estas ferramentas são aplicadas em ambientes coletivos com muitos usuários, o uso das mesmas é deteriorado pelas limitações da rede. Protocolos Multicast possibilitam o uso destas aplicações colaborativas em razão de proporcionarem a redução do uso da rede para atividades coletivas, possibilitando a interação com dezenas, centenas ou milhares de usuários simultaneamente. Na medida em que as ferramentas colaborativas ganham espaço entre os usuários, surge também a necessidade do emprego de segurança entre grupos de usuários. Os grupos devem ser capazes de estabelecer comunicações Multicast seguras em que apenas os membros autorizados sejam hábeis a acessar os conteúdos veiculados pelo grupo. São exemplos de aplicativos que exigem Multicast seguro: videoconferências confidenciais, sincronismo de tabelas financeiras entre matriz e filiais, distribuição de vídeo e áudio para um grupo de assinantes, dentre inúmeras outras utilizações. A proteção do conteúdo do grupo é alcançada por meio de criptografia e as chaves devem ser atualizadas quando do ingresso de novo usuário ou na hipótese de desistência de algum membro do grupo. As técnicas de gerenciamento de chaves devem ser eficientes, tanto no aspecto de segurança, quanto no que pertine ao desempenho. Devem, ainda, possibilitar a sua utilização em grupos com quantidades massivas de usuários. Os objetivos do presente trabalho são, em suma, estudar os esquemas de gerenciamento de chaves de grupo, propor uma nova técnica cujo foco seja a minimização do uso dos recursos de rede em ambientes limitados, simular os modelos avaliados pelo simulador de rede NS-2 e analisar os impactos destes esquemas em aplicações colaborativas. Para tanto, desenvolveu-se um módulo para o NS-2 que permitiu ao simulador prover suporte ao gerenciamento de chaves, e, ainda, construíram-se dois aplicativos auxiliares para a geração de cenários e análise de resultados em simulações NS-2. / With the popularization of the Internet, collaborative applications have been gaining marketshare, becoming intrinsic to a wide range of personal and commercial activities. Modern technological improvement brought new demands for these applications, such as the inclusion of new features in cooperative environments, such as the distribution of multimedia data over communication networks. However, when these tools are applied to collective environments with many users, their usability is hindered by the network limits. Multicast protocols allow the use of these collaborative applications, since they reduce the necessary network bandwidth, allowing the interaction with tens, hundreds or thousands of users simultaneously. As collaborative tools become more popular among users, there comes also the problem of security in user groups. The groups must be able to establish secure multicast communications in which only the authorized members can access the content distributed to the group. Examples of applications which demand secure multicast are confidential videoconferences, synchronization of financial tables between the headquarter and filials, distribution of video and audio to a group of users, among many others. The protection of group contents is achieved by cryptography and the keys must be updated whenever a new users joins or leaves the group. The techniques for key management must be eficient, in terms of security and performance, and also be passible of use in groups with massive amounts of users. The goals of this work are: to study the group key management systems, to propose a new technique whose focus is to minimize the use of network resources in limited environments, to simulate the models evaluated by the network simulator NS-2 and to analyze the impacts of these systems in collaborative applications. For that, a module for NS-2 has been developed that allows the simulator to provide support to key management and, moreover, two auxiliar applications were written to generate the scenarions and analyse the simulations returned by NS-2.

The current state of email security is lacking, and the need for end-to-end encryption of email is clear. Recent research has begun to make progress towards usable, secure email for the masses (i.e., novice users without IT support). In this paper, we evaluate the usability implications of three different key management approaches: PGP, IBE, and passwords. Our work is the first formal A/B evaluation of the usability of different key management schemes, and the largest formal evaluation of secure email ever performed. Our results reveal interesting inherent usability trade-offs for each approach to secure email. Furthermore, our research results in the first fully-implemented PGP-based secure email system that has been shown to be usable for novice users. We share qualitative feedback from participants that provides valuable insights into user attitudes regarding each key management approach and secure email generally. Finally, our work provides an important validation of methodology and design principles described in prior work.

In this thesis, we propose and analyze a multicast key backbone for secure group communications. We also utilize the correlated relationships between the mobile users in the wireless communications networks. When a batch member joins or leaves the group communications, the system has to update and distribute encryption keys to assure that only active members could receive the latest information. In previous tree-based multicast key management schemes, the depth of the key tree is unbounded and analytically deriving the exact value of the corresponding average update cost remains an open problem. And in previous schemes, the different mobile user arrives in and leaves from the system at different time. In contrast, the depth of the proposed multicast key backbone is fixed and the arriving or leaving users are more than one. We utilize these two characteristics and simulate the system to get the average update cost per time unit. We can find that this scheme can improve the efficiency of the system in some special cases when updating the new key.

Wireless Sensor Networks (WSNs) are ad-hoc networks consisting of tiny battery- operated wireless sensors. The sensor nodes are lightweight in terms of memory, computation, energy and communication. These networks are usually deployed in unsecured, open, and harsh environments, where it is difficult for humans to perform continuous monitoring. Consequently, it is very crucial to provide security mecha- nisms for authenticating data among sensor nodes. Key management is a pre-requisite for any security mechanism. Efficient distribution and management of keys in WSNs is a challenging task. Many standard key establishment techniques have been pro- posed using symmetric cryptosystems. Unfortunately, these systems often fail to pro- vide a good trade-off between memory and security and since WSNs are lightweight in nature, these cryptosystems are not feasible. On the other hand, public key in- frastructure (PKI) is infeasible in WSNs because of its continuous requirement of a trusted third party and heavy computational demands for certificate verification. Pairing-Based Cryptography (PBC) has paved the way for how parties can agree on keys without any interaction. It has relaxed the requirement of expensive certificate verification on PKI systems. In this thesis, we propose a new hybrid identity-based non-interactive key management protocol for WSNs, which leverages the benefits of both symmetric key based cryptosystems and pairing-based cryptosystems. The pro- posed protocol is scalable, suits many applications and can be deployed in multiple types of networks without modifications. We also provide mechanisms for key refresh when the network topology changes. A security analysis is presented to prove that the scheme is resilient to many types of attacks. To validate our scheme, we have implemented it on Crossbow TelosB motes running TinyOS and analyzed the perfor- mance in terms of memory, communication, computation and energy consumption. The results indicate that our scheme can be deployed efficiently to provide high level of security in a large-scale network without increasing memory, communication and energy overheads.

Recent advances in electronic and computer technologies lead to wide-spread deployment of wireless sensor networks (WSNs). WSNs have wide range applications, including military sensing and tracking, environment monitoring, smart environments, etc. Many WSNs have mission-critical tasks, such as military applications. Thus, the security issues in WSNs are kept in the foreground among research areas. Compared with other wireless networks, such as ad hoc, and cellular networks, security in WSNs is more complicated due to the constrained capabilities of sensor nodes and the properties of the deployment, such as large scale, hostile environment, etc. Security issues mainly come from attacks. In general, the attacks in WSNs can be classified as external attacks and internal attacks. In an external attack, the attacking node is not an authorized participant of the sensor network. Cryptography and other security methods can prevent some of external attacks. However, node compromise, the major and unique problem that leads to internal attacks, will eliminate all the efforts to prevent attacks. Knowing the probability of node compromise will help systems to detect and defend against it. Although there are some approaches that can be used to detect and defend against node compromise, few of them have the ability to estimate the probability of node compromise. Hence, we develop basic uniform, basic gradient, intelligent uniform and intelligent gradient models for node compromise distribution in order to adapt to different application environments by using probability theory. These models allow systems to estimate the probability of node compromise. Applying these models in system security designs can improve system security and decrease the overheads nearly in every security area. Moreover, based on these models, we design a novel secure routing algorithm to defend against the routing security issue that comes from the nodes that have already been compromised but have not been detected by the node compromise detecting mechanism. The routing paths in our algorithm detour those nodes which have already been detected as compromised nodes or have larger probabilities of being compromised. Simulation results show that our algorithm is effective to protect routing paths from node compromise whether detected or not.