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 published on a yearly basis
Papers
More filters
TL;DR: This paper proposes the first certificateless threshold decryption scheme which avoids both the single point of failure in the distributed networks and the inherent key escrow problem in identity-based cryptosystem.
24 citations
25 Jun 2018
TL;DR: An improved key distribution solution called BIBE is proposed by integrating the technique of blockchain into the identity-based encryption by splitting the nodes in the chain to complete user authentication and private key protection, respectively.
Abstract: Identity-based encryption is a key distribution system in which the public key of a user is derived directly from his identity information. Compared with PKI, Identity-based encryption simplifies key management issue, but it still suffers from drawbacks inkey escrow and private key delivering. Motivated by this, we propose an improved key distribution solution called BIBE by integrating the technique of blockchain into the identity-based encryption. Specifically, we split the nodes in the chain to complete user authentication and private key protection, respectively. Furthermore, the two sides complete the mutual identity authentication with the identity information key pairs obtained from BIBE. Additionally, to prevent network attack, we employ timestamps, random numbers and hash algorithm in the process of identification. Through the rigorous and mathematical analysis, the proposed scheme demonstratesa far better performance on correctness, safety and efficiency.
24 citations
TL;DR: This work proposes an efficient signcryption of a heterogeneous system for IoV (HSC-IoV) that can achieve confidentiality, key revocation, integrity, authentication, and no-repudiation as the high-level security features and has the advantage of being efficient compared to the existing protocols due to the computation without pairing.
24 citations
Patent•
16 Feb 2012TL;DR: In this article, the authors present a system for managing access to stored data resources that assigns one or more wrapped (encrypted) encryption keys to each data resource, and the keys may be stored in an access control list (ACL) in association with the encrypted data resources.
Abstract: Methods and systems for managing access to stored data resources assign one or more wrapped (encrypted) encryption keys to each data resource. The resources are encrypted, and the keys may be stored in an access control list (ACL) in association with the encrypted data resources. The keys may be wrapped with metadata that indicates who or what is authorized to use the resource and what role the user or users may have with respect to the resource. The keys may be unwrapped upon receipt of access requests from authorized users, and may be used to decrypt the data resources.
24 citations
01 Mar 2015
TL;DR: This work proposes a secure CLPS scheme with message recovery based on elliptic curve discrete log problem that is secure against existential forgery under adaptive chosen message and ID attacks and more efficient than Singh and Verma's scheme for practical applications.
Abstract: Certificateless public key cryptography PKC eliminates the use of certificates in traditional PKC and the key escrow problem in identity-based PKC. Up to now, a number of certificateless proxy signature CLPS schemes have been proposed. However, only a little attention has been paid to the construction of CLPS schemes with message recovery. Recently, Singh and Verma proposed a CLPS scheme with message recovery from bilinear pairings. Total computation cost of a pairing is higher than that of elliptic curve-based scalar multiplication over elliptic curve group. So, schemes without pairings would be more appealing in terms of efficiency. To the best of our knowledge, there is no provable secure CLPS scheme with message recovery based on elliptic curve discrete log problem. We first propose such CLPS scheme. Our scheme is secure against existential forgery under adaptive chosen message and ID attacks. Furthermore, it is more efficient than Singh and Verma's scheme for practical applications. Copyright © 2012 John Wiley & Sons, Ltd.
24 citations