Key escrow

About: Key escrow is a research topic. Over the lifetime, 1162 publications have been published within this topic receiving 19616 citations.

Secure routing in wireless sensor networks

Abstract: This research addresses communication security in the highly constrained wireless sensor environment. The goal of the research is twofold: (1) to develop a key management scheme that provides these constrained systems with the basic security requirements and evaluate its effectiveness in terms of scalability, efficiency, resiliency, connectivity, and flexibility, and (2) to implement this scheme on an appropriate routing platform and measure its efficiency. The proposed key management scheme is called Hierarchical Key Establishment Scheme (HIKES). In HIKES, the base station, acting as the central trust authority, empowers randomly selected sensors to act as local trust authorities, authenticating on its behalf the cluster members and issuing to them all secret keys necessary to secure their communications. HIKES uses a novel key escrow scheme that enables any sensor node selected as a cluster head to generate all the cryptographic keys needed to authenticate other sensors within its cluster. This scheme localizes secret key issuance and reduces the communication cost with the base station. The key escrow scheme also provides the HIKES with as large an addressing mechanism as needed. HIKES also provides a one-step broadcast authentication mechanism. HIKES provides entity authentication to every sensor in the network and is robust against most known attacks. We propose a hierarchical routing mechanism called Secure Hierarchical Energy-Efficient Routing protocol (SHEER). SHEER implements HIKES, which provides the communication security from the inception of the network. SHEER uses a probabilistic broadcast mechanism and a three-level hierarchical clustering architecture to improve the network energy performance and increase its lifetime. Simulation results have shown that HIKES provides an energy-efficient and scalable solution to the key management problem. Cost analysis shows that HIKES is computationally efficient and has low storage requirement. Furthermore, high degree of address flexibility can be achieved in HIKES. Therefore, this scheme meets the desired criteria set forth in this work. Simulation studies also show that SHEER is more energy-efficient and has better scalability than the secure version of LEACH using HIKES.

A New ID-based Group Signature Scheme

Abstract: In those existing ID-based signature schemes,people need to trust Private Key Generator (PKG).PKGs can forge the signature because PKGs make the private key.In order to solve the problem,some papers proposed that many PKGs can be imported,if it is insured that at least one PKG is honest,the scheme is safe.But enough PKGs can also forge the signature,so the problem isn't solved fundamentally.This paper proposes a new ID-based signature scheme without honest PKGs.It solves the problem of key escrow.

A Noval and Efficient ECC-Based Authenticated Key Agreement Scheme for Smart Metering in the Smart Grid

Abstract: With the gradual maturity of the smart grid (SG), security challenges have become one of the important issues that needs to be addressed urgently. In SG, the identity authentication and key agreement protocol between a smart meter (SM) and an aggregator (AG) is a prerequisite for both parties to establish a secure communication. Some of the existing solutions require high communication cost, some have key escrow problems and security defects. Elliptic curve cryptosystem (ECC) holds the feature of low-key requirement and high security to make it more suitable for the security solutions to the communications in SG. In this paper, we propose a mutual anonymous authentication with an ECC-based key agreement scheme to secure the communications in SG. In addition, we compare our scheme with other existing schemes by the number of encryption operations, the computation delay, and the communication cost. The results indicate that our scheme is more efficient without the loss of safety properties.

Privacy-Preserving Medical Information Systems Using Multi-authority Content-Based Encryption in Cloud

Abstract: In the Medical Information Systems (MIS), the patient outsources his e-health records, a dramatically huge amount of health data, to a third party like cloud service provider. The Internet providing host-to-host communication using TCP/IP network topology has not satisfied the growing demands of data processing in MIS. Based on the content-to-consumer paradigm, content-centric networking architecture was proposed for simple easy-to-manage caching features to users. In this paper, we proposed a privacy-preserving e-health records scheme that protects name and content simultaneously. Our proposal has multi-authority without a trusted single or central authority to distribute secret keys, which avoids the key escrow problem and meets the distributed features of MIS. As we know, this scheme is the first multi-authority content-based encryption (MA-CBE). Furthermore, this MA-CBE resists up to (N-1) corrupted authorities collusion attack, and the security is proven to be semantically secure based on the standard decisional bilinear Diffie-Hellman assumption. Our comparison analysis reports that the proposal gives a better performance than other related schemes.

The Multilinear Maps Based Certificateless Aggregate Signcryption Scheme

Abstract: Aggregate signcryption could verify the multiple messages via a single operation. Most of the identity-based aggregate signcryption are based on random oracle. To exploit the advantage of multilinear maps and erase the key escrow problem, a new Identity-based certificate less aggregate signcryption scheme is proposed. The new scheme is proved to be confidential and unforgeable under the assumption of multilinear Diffie-Hellman problem in the standard model. Compared with others, the scheme sacrifices a little in exponent arithmetic, but gives an effective remedy to the key escrow problem.