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
••
21 Mar 2019
TL;DR: This work improves the Identity Based Encryption scheme by solving the key escrow problem and allows to guarantee the data confidentiality between the sender and the recipient.
Abstract: In 1984, Shamir presented the first Identity Based cryptography scheme resolving the public key sharing using signatures. Identity Based Encryption (IBE) remained an open problem for many years. Boneh and Franklin or Cocks presented some IBE schemes. IBE scheme was improved by Malek with a sender authentication in addition to the encryption. We improve this solution by solving the key escrow problem. The trusted center has access on a partial private key in our solution. This method allows to guarantee the data confidentiality between the sender and the recipient. Even if an attacker retrieves the master key of the trusted center, the data confidentiality is guaranteed for the previous and next exchanges.
1 citations
•
01 Jul 2016
TL;DR: This work proposes a secure data retrieval scheme using 3DES with MD5 for decentralized DTNs where multiple key authorities manage their attributes independently and demonstrates how the proposed mechanism to securely and efficiently manage the confidential data distributed in the Disruption-tolerant military network.
Abstract: Disruption tolerant network technologies are becoming successful solutions that allow wireless devices carried by soldiers to communicate with each other and access the confidential information or command reliably by exploiting external storage nodes. Some of the most challenging issues in this scenario are the enforcement of authorization policies and the policies update for secure data retrieval. Ciphertext policy attribute-based encryption is a promising cryptographic solution to the access control issues. However, the problem of applying CP-ABE in decentralized DTNs introduces several security and privacy challenges with regard to the attribute revocation, key escrow, and coordination of attributes issued from different authorities. We propose a secure data retrieval scheme using 3DES with MD5 for decentralized DTNs where multiple key authorities manage their attributes independently. We demonstrate how to apply the proposed mechanism to securely and efficiently manage the confidential data distributed in the Disruption-tolerant military network.
1 citations
01 Jan 2014
TL;DR: A practical solution that uses Identity Based Encryption (IBE) to simplify key management and enforce confidentiality of data in OSNs and devise an outsider anonymous broadcast IBE scheme to disseminate information among multiple users, even if they are not using the system.
Abstract: Currently Online Social Networks (OSNs) constitute an important and useful communication channel. However, coarse-grained privacy preferences protect the shared information insufficiently. Although cryptography provides interesting mechanisms to protect privacy, existing solutions face several issues such as, OSN provider acceptance, user adoption, key management and usability. In this thesis, we propose a practical solution that uses Identity Based Encryption (IBE) to simplify key management and enforce confidentiality of data in OSNs. By translating key generation of traditional IBE schemes to a distributed setting, our scheme prevents key escrow as long as the number of colluding key generators does not exceed a predefined threshold. Moreover, we devise an outsider anonymous broadcast IBE scheme to disseminate information among multiple users, even if they are not using the system. Apart from increased usability, the proposed solution no longer requires complex key management infrastructures keeping track of all keys in the system thereby relaxing users’ prior knowledge on cryptographic primitives. The viability and tolerable overhead of our solution is demonstrated by extending an existing plugin for encryption in OSNs called Scramble. Based on the existing Scramble architecture and the MIRACL multi-precision library, we program an open-source prototype that implements our proposed solution on Facebook but can be generalised for use in any existing OSN infrastructure.
1 citations
•
TL;DR: Jin et al. as mentioned in this paper showed that their certificateless multi-proxy signature scheme can be broken by two attacks: the first attack indicates the security model is flawed and the second attack indicates their scheme is insecure.
Abstract: Certificateless cryptography is a new type of public key cryptography, which removes the certificate management problem in traditional public key cryptography and the key escrow problem in identity-based public key cryptography. Multi-proxy signature is an extension of proxy signature, which allows an original signer authorizing a group of proxy signers and only the cooperation of all proxy signers in the group can create valid proxy signatures on behalf of the original signer. Recently, Jin and Wen combined certificateless cryptography with multi-proxy signature, and proposed a model as well as a concrete scheme of certificateless multi-proxy signature. They claimed that their scheme is provably secure in their security model. Unfortunately, in this paper by giving two attacks, we will show that their certificateless multi-proxy signature scheme can be broken. The first attack indicates their security model is flawed and the second attack indicates their certificateless multi-proxy signature scheme is insecure. Possible improvements are also suggested to prevent these attacks.
1 citations
•
TL;DR: The security weakness of the schemes is demonstrated, and the first provably secure certificateless signcryption scheme without bilinear pairing is presented and proved in the random oracle model.
Abstract: Certificateless cryptography introduced by Al-Riyami and Paterson eliminates the key escrow problem inherent in identity based cryptosystems. Even though building practical identity based signcryption schemes without bilinear pairing are considered to be almost impossible, it will be interesting to explore possibilities of constructing such systems in other settings like certificateless cryptography. Often for practical systems, bilinear pairings are considered to induce computational overhead. Signcryption is a powerful primitive that offers both confidentiality and authenticity to noteworthy messages. Though some prior attempts were made for designing certificateless signcryption schemes, almost all the known ones have security weaknesses. Specifically, in this paper we demonstrate the security weakness of the schemes in [4], [2] and [14]. We also present the first provably secure certificateless signcryption scheme without bilinear pairing and prove it in the random oracle model.
1 citations