scispace - formally typeset
Search or ask a question
Topic

Key escrow

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


Papers
More filters
Journal ArticleDOI
TL;DR: Simulation results have shown that HIKES provides an energy‐efficient and scalable solution to the key management problem and defends the routing mechanism against most known attacks and is robust against node compromise.
Abstract: SUMMARY This paper presents a hierarchical key establishment scheme called HIKES. The base station in this scheme, 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 private keys. HIKES uses a partial 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. HIKES provides an efficient broadcast authentication in which source authentication is achieved in a single transmission and a good defense for the routing mechanism. HIKES defends the routing mechanism against most known attacks and is robust against node compromise. HIKES also provides high addressing flexibility and network connectivity to all sensors in the network, allowing sensor addition and deletion. Simulation results have shown that HIKES provides an energy-efficient and scalable solution to the key management problem. Copyright © 2012 John Wiley & Sons, Ltd.

19 citations

Book ChapterDOI
Matt Blaze1
30 May 1996
TL;DR: In this article, secret sharing over large-scale networks is proposed for assuring recoverability of sensitive archived data (e.g., cryptographic keys) in a distributed key escrow system.
Abstract: We propose a simple scheme, based on secret-sharing over large-scale networks, for assuring recoverability of sensitive archived data (e.g., cryptographic keys). In our model anyone can request a copy of the archived data but it is very difficult to keep the existence of a request secret or to subvert the access policy of the data “owner.” We sketch an architecture for a distributed key escrow system that might be suitable for deployment over very large-scale networks such as the Internet. We also introduce a new cryptographic primitive, oblivious multicast, that can serve as the basis for such a system.

19 citations

Journal ArticleDOI
TL;DR: The notion of proxy ring signature is introduced into certificateless public key cryptography and the security of the proposed scheme can be proved to be equivalent to the computational Diffe-Hellman problem in the random oracle with a tight reduction.
Abstract: Proxy ring signature allows proxy signer to sign messages on behalf of the original signer while providing anonymity Certificateless public key cryptography was first introduced by Al-Riyami and Paterson in Asiacrypt 2003 In certificateless cryptography, it does not require the use of certificates to guarantee the authenticity of users' public keys Meanwhile, certificateless cryptography does not have the key escrow problem, which seems to be inherent in the Identity-based cryptography In this paper, we introduce the notion of proxy ring signature into certificateless public key cryptography and propose a concrete certificateless proxy ring signature scheme The security models of certificateless proxy ring signature are also formalized The security of the proposed scheme can be proved to be equivalent to the computational Diffe-Hellman problem in the random oracle with a tight reduction

19 citations

Journal ArticleDOI
TL;DR: This work proposes a concrete certificateless online/offline signcryption scheme that achieves known session-specific temporary information security, public verifiability with confidentiality and no key escrow problem, and has the great advantage of the offline computation cost.
Abstract: The communication model of Internet of Things IOT application has some shortcomings in user privacy protection and information security. To solve these shortcomings, we define the formal models of certificateless online/offline signcryption and propose a concrete certificateless online/offline signcryption scheme for IOT environment. Compared with the existing identity-based online/offline signcryption schemes that do not require the plaintext and the receiver's identity in the offline phase, our scheme has the great advantage of the offline computation cost, offline storage, ciphertext length, and receiver computation cost. Moreover, our scheme achieves known session-specific temporary information security, public verifiability with confidentiality and no key escrow problem. Copyright © 2013 John Wiley & Sons, Ltd.

19 citations


Network Information
Related Topics (5)
Encryption
98.3K papers, 1.4M citations
85% related
Routing protocol
46.5K papers, 901.8K citations
80% related
Wireless ad hoc network
49K papers, 1.1M citations
79% related
Key distribution in wireless sensor networks
59.2K papers, 1.2M citations
78% related
Server
79.5K papers, 1.4M citations
78% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20241
202351
202289
202150
202072
201958