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
Book ChapterDOI
12 Feb 2007
TL;DR: Designing the security protocols to mitigate man-in-the-middle attacks in bank-card payment systems will include most of the hot topics of IT policy over the last ten years as subproblems.
Abstract: Existing bank-card payment systems, such as EMV, have two serious vulnerabilities: the user does not have a trustworthy interface, and the protocols are vulnerable in a number of ways to man-in-the-middle attacks. Moving to RFID payments may, on the one hand, let bank customers use their mobile phones to make payments, which will go a fair way towards fixing the interface problem; on the other hand, protocol vulnerabilities may become worse. By 2011 the NFC vendors hope there will be 500,000,000 NFC-enabled mobile phones in the world. If these devices can act as cards or terminals, can be programmed by their users, and can communicate with each other, then they will provide a platform for deploying all manner of protocol attacks. Designing the security protocols to mitigate such attacks may be difficult. First, it will include most of the hot topics of IT policy over the last ten years (from key escrow through DRM to platform trust and accessory control) as subproblems. Second, the incentives may lead the many players to try to dump the liability on each other, leading to overall system security that is equivalent to the weakest link rather than to sum-of-efforts and is thus suboptimal.

11 citations

Patent
13 Apr 2011
TL;DR: In this paper, the authors proposed a random encryption method for decrypting by adopting an exhaustion method, which is mainly used for encrypting backup keys, certificates and important documents and is not only applied to a stand-alone system, but also can be applied to key escrow services in clouds.
Abstract: The invention provides a random encryption method for decrypting by adopting an exhaustion method, which is mainly used for encrypting backup keys, certificates and important documents. The random encryption method comprises the following encryption flow: inputting use identity information and encryption strength; calculating the random length of a random key and generating the random key of the random length according to the relationship among encryption strength and other factors; and encrypting the key and the certificate by using the user identity information and the random key according to the encryption algorithm to obtain backups of the encrypted key and certificate and locking the user identity information and the random key in password identification information by using the encryption algorithm determined by the program. The backups generated by the encryption method are decrypted by using the exhaustion method no matter how to write the decryption program even if the correct user identity is input; in addition, the user and the random key are required to be respectively compared. The method is not only applied to a stand-alone system, but also can be applied to key escrow services in clouds.

11 citations

Book ChapterDOI
16 Dec 2016
TL;DR: A new and direct approach to construct a certificateless signature scheme, secure in the standard model, with constant-size of all parameters and having efficient computing time is introduced, which is very efficient when comparing to existing \(\mathsf {CLS}\) schemes in thestandard model.
Abstract: Identity-based cryptography has been introduced by Shamir at Crypto’84 to avoid the use of expensive certificates in certified public key cryptography. In such system, the identity becomes the public key and each user needs to interact with a designated authority to obtain the related private key. It however suffers the key escrow problem since the authority knows the private keys of all users. To deal with this problem, Riyami and Paterson have introduced, at Asiacrypt’03, the notion of certificateless public key cryptography. In this case, there is no need to use the certificate to certify the public key, and neither the user nor the authority can derive the full private key by himself. There have been several efforts to propose a certificateless signature (\(\mathsf {CLS}\)) scheme in the standard model, but all of them either make use of the Waters’ technique or of the generic conversion technique (proposed by Yum and Lee at ACISP’04 and later modified by Hu et al. at ACISP’06) which both lead to inefficient schemes. In this paper, we introduce a new and direct approach to construct a \(\mathsf {CLS}\) scheme, secure in the standard model, with constant-size of all parameters and having efficient computing time. Our scheme is therefore very efficient when comparing to existing \(\mathsf {CLS}\) schemes in the standard model.

11 citations

DOI
Sultan Basudan1
23 Dec 2020
TL;DR: In this paper, the authors proposed a lightweight and efficient group authentication protocol for mMTC in 5G wireless networks, which integrates bilinear maps and an aggregate certificateless signature mechanism, can achieve several security goals, including avoidance of signaling congestion in the authentication process, mutual authentication, session key agreement, perfect forward/backward secrecy, and masked attack and key escrow resistance.
Abstract: Massive machine type communication (mMTC) is anticipated to be an essential part of fifth generation (5G) networks. The main challenge for mMTC devices (mMTCDs) is the design of an access authentication scheme that can fulfill the security and privacy requirements of 5G applications, which have specific conditions, including rigorous latency and simultaneous access. Thus, a novel 5G authentication and key agreement (5G-AKA) protocol was introduced by the 3rd generation partnership project (3GPP) to achieve mMTCD access authentication. However, 5G-AKA protocol comes with some security vulnerabilities and significant delay for real-time mMTC applications, particularly when mMTCDs concurrently roam into new networks. In order to address the real-time secure and efficient access issues of multiple mMTCDs, this paper proposes a lightweight and efficient group authentication protocol for mMTC in 5G wireless networks. The proposed protocol, which integrates bilinear maps and an aggregate certificateless signature mechanism, can achieve several security goals, including avoidance of signaling congestion in the authentication process, mutual authentication, session key agreement, perfect forward/backward secrecy, and masked attack and key escrow resistance. Compared to existing conventional protocols, the proposed protocol demonstrates robust security and improved performance in terms of signaling cost authentication, bandwidth consumption and computational cost.

11 citations

Journal ArticleDOI
TL;DR: A location-aware authorization scheme that enables FRs to access information provided that they are within a predefined distance from data owners at the time of an emergency is proposed and is proven chosen plain-text attack selectively secure based on m-bilinear Diffie-Hellman exponent assumption.
Abstract: Effective emergency (such as a hurricane, a building on fire, and so on) response requires accurate, relevant, timely, and location-aware information (e.g., environmental information, health records, and so on). Acquiring information in such critical situations encounters substantial challenges, such as large volume of data processing, unstructured data, privacy, authorized data access, and so forth. Among the issues, access authorization has received little attention. Existing solutions for data authorization either do not scale well or merely consider a Break-the-Glass concept in which a master key is provided to the first responders (FRs) to decrypt the corresponding ciphertext. This may not only enable unauthorized users to access information, but it may also overwhelm FRs by the large volume of accessible data. To jointly address the aforementioned issues, this paper proposes a location-aware authorization scheme that enables FRs to access information provided that they are within a predefined distance from data owners at the time of an emergency. We innovatively integrate attribute-based encryption with broadcast encryption to incorporate dynamic attributes (i.e., location and time) into an access policy. Such attributes act as filters to eliminate data irrelevant to an ongoing emergency. As a result, our scheme provides authorized access to accurate, relevant, timely, and location-aware information. We provide extensive security analysis and performance evaluations to demonstrate the effectiveness of our scheme. The analysis shows that the scheme imposes constant communication and decryption computation overheads. Furthermore, the proposed scheme is proven chosen plain-text attack selectively secure based on $m-$ bilinear Diffie–Hellman exponent assumption. It also addresses the key escrow problem.

11 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