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
Li Yan1
01 Jan 2015
TL;DR: An efficient certificateless aggregate signature scheme based on bilinear pairings is presented and it is proven existentially unforgeable against adaptive chosen message attacks(EUF-CLAS-CMA) without Fork Lemma under the computational Diffie-Hellman assumption.
Abstract: Aggregate signature scheme can aggregate n signatures on n distinct messages from n different signers into a single signature, the resulting aggregate signature can convince the verifier that the n signers did indeed sign the n messages, i.e., n verification equations can be reduced to one. Certificateless public key cryptography overcomes the complicated certificate management in traditional public key cryptography and key escrow problem in identity based cryptography. It is because of the advantages of aggregate signature scheme and certificateless public key cryptography that certificateless aggregate signature schemes become a research hotspot. In this paper, an efficient certificateless aggregate signature scheme based on bilinear pairings is presented. In the random oracle model, it is proven existentially unforgeable against adaptive chosen message attacks(EUF-CLAS-CMA) without Fork Lemma under the computational Diffie-Hellman assumption. The aggregate signature is only composed of two group elements, and the signature verification only needs four pairings(constant order of magnitude) and n scalar multiplications computations. Compared with the existing certificateless aggregate signature(CLAS) schemes, the proposed new scheme improves the efficiency of communication and computation, and it is more suitable for the applications in resource-constrained environment.

5 citations

Journal ArticleDOI
TL;DR: Wang et al. as mentioned in this paper proposed a certificateless elliptic curve aggregate signcryption (CL-ECASC) scheme for IoTs that can improve the authentication efficiency and realize data confidentiality.
Abstract: Driven by new situation of “Internet +,” Internet has achieved the integrated development with all walks of life. Among them, the fifth generation is a key technology to promote the deep integration of Internet-of-Things equipment, cloud computing, blockchain and other trades. Hence, it is necessary for IoTs to consider the cost and efficiency of authentication and confidentiality of the communication. For effectively solving the above problems, we devise certificateless elliptic curve aggregate signcryption (CL-ECASC) scheme for IoTs that can improve the authentication efficiency, realize data confidentiality, and avoid the problems of complex certificate management and key escrow. Under the hardness of discrete logarithm and computational DiffieHellman problems on elliptic curve, CL-ECASC is proved to has the IND-CCA2 security (indistinguishability under the adaptive chosen-ciphertext attacks) and UF-CMA security (existentially unforgeable under the adaptive chosen-message attacks). CL-ECASC has relatively faster computation efficiency and lower communication cost, and so it is suitable for secure transmission of the information in the previously mentioned environments.

5 citations

Journal ArticleDOI
TL;DR: In this article, the authors studied several properties necessary for public key based escrow schemes, and observed that previous schemes lack some important properties such as "warrant bounds", "admissibility", "surveillance switching", "non-directive monitoring", "off-line agency", "target hiding", etc.
Abstract: This paper studies several of the properties necessary for public key based escrow schemes, and observes that previous schemes lack some important properties. Focusing on the type of communication typified by e-mail, we construct a novel and simple scheme that provides “warrant bounds”, “admissibility”, “surveillance switching”, “non-directive monitoring”, “off-line agency”, “target hiding” and many other useful properties all at the same time.

5 citations

Book ChapterDOI
03 Jul 1995
TL;DR: CKE, involving the incorporation of software based cryptography in computer and network systems with associated key recovery data transmitted during data network activity and provision of “Data Recovery Centres (DRC)”, is seen as presenting a new solution to the problems encountered in the USA with the “Clipper” initiative in that country announced in 1993.
Abstract: “Commercial Key Escrow (CKE)”, and an earlier “Software Key Escrow (SKE) scheme, have been proposed by Trusted Information Systems Inc. (TIS) in the USA as a possible compromise scheme to meet the demands of commerce and industry for new levels of information security, particularly transaction and message confidentiality in an international and national networked environment, while meeting law enforcement demands for continued effectiveness of telecommunications line-tapping ability. These latter requirements relate to the perceived need by law enforcement agencies to make use of legitimate authorised linetapping capabilities for the gathering of appropriate intelligence and/or evidence for the purpose of fulfilling perceived roles in the protection of society from criminal activity against the potential case where such line-taps produce intercepts that are encrypted. CKE, involving the incorporation of software based cryptography in computer and network systems with associated key recovery data transmitted during data network activity and provision of “Data Recovery Centres (DRC)”, is seen as presenting a new solution to the problems encountered in the USA with the “Clipper” initiative in that country announced in 1993.

5 citations

Journal Article
Ming Yan1
TL;DR: The analysis shows that the proposed scheme is proven existentially unforgeable against adaptive chosen message attacks under the computational Diffie-Hellman assumption in the random oracle model.
Abstract: Aggregate signatures allow an efficient algorithm to aggregate n signatures of n distinct messages from n different signers into one single signature.Aggregate signature is useful to save bandwidth and improve the efficiency in verification phase.Certificateless public key cryptography overcomes the complicated certificate management in traditional public key cryptography and key escrow problem in identity based cryptography.In this paper,we present a new efficient certificateless aggregate signature scheme based on the bilinear pairing.The analysis shows that the proposed scheme is proven existentially unforgeable against adaptive chosen message attacks under the computational Diffie-Hellman assumption in the random oracle model.The signature length is only two group elements,which is independent of the number of signers,and the signature needs only four pairings and n scalar multiplications computations in verification phase.Thus,the proposed scheme is more suitable for the applications,in resource-constrained environment.

5 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