Key escrow

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

Certificateless Signcryption in the Standard Model

Abstract: Signcryption can realize encryption and signature simultaneously with lower computational costs and communicational overheads than those of the traditional sign-then-encrypt approach. Certificateless cryptosystem solves the key escrow problem in the identity-based cryptosystem and simplifies the public key management in the traditional public key cryptosystem. There have been some certificateless signcryption schemes proposed in the standard model up to now, but all of them are just proposed in a weaker Type I security model, which is weaker than the original security model of Barbosa and Farshim, who proposed the first certificateless signcryption scheme. In this paper, we propose a certificateless signcryption scheme in the standard model by using bilinear pairings, which is Type I secure in the original security model of Barbosa and Farshim and can resist the malicious-but-passive key generation center Type II attack. The proposed scheme is proved confidential assuming the modified decisional bilinear Diffie---Hellman (M-DBDH) problem is hard, and unforgeable assuming the square computational Diffie---Hellman (Squ-CDH) problem is hard. At last, we evaluate its efficiency which shows it is of high efficiency.

An Enhanced Certificateless Signcryption in the Standard Model

Abstract: Signcryption is a cryptography prototype which performs message encryption and signature in a logical step. Certificateless public key cryptography successfully resolves the problem of certificate management in traditional public key cryptography and key escrow problem in identity-based public key cryptography. There are lots of efficient certificateless signcryption schemes that have been proposed, most of which are proved secure under the random oracle model. But when applied in practical situations, the random oracle model will cause many security problems due to its own defects. Nowadays, more and more people pay attention to the standard model which provides a stronger security. In this paper, we present an efficient certificateless signcryption scheme that is provably secure in the standard model. Under the Decisional Bilinear Diffie–Hellman and Computational Diffie–Hellman hard problems, our scheme satisfies the ability of indistinguishability against adaptive chosen ciphertext attack and existential unforgeability against adaptive chosen message attack. Moreover, our scheme satisfies known session-specific temporary information security that most of signcryption schemes in the standard model cannot achieve this security attribute. Compared with other signcryption schemes, our scheme achieves shorter ciphertext length, better performance efficiency and stronger security.

Secure Data Retrieval for Decentralized Disruption-Tolerant Military Networks

Abstract: Disruption-tolerant network (DTN) advancements are getting to be a productive provision that allow remote device passed on by officers to talk with each other and access the classified data or secret data by abusing outside storage nodes. This framework gives the effective situation to approval strategies and the solutions overhaul for secure data recovery in most difficult cases. The most encouraging cryptographic solutions are acquainted with control the access issues called Cipher text-Policy Attribute-Based Encryption (CP-ABE). Indisputably the most difficult issues in this state are the prerequisite of endorsement arrangements and the methodologies redesign for secure data recovery. Then again, the issue of applying CP-ABE in decentralized DTNs presents a couple of securities and insurance challenges as to the property disavowal, key escrow, and coordination of characteristics issued from particular forces. In this paper, we propose a protected data recovery arrangement using CP-ABE for decentralized DTNs where various key forces manage their properties freely. We display how to apply the proposed part to securely and proficiently deal with the portrayed data scattered in the data scattered in the Interference or disruption tolerant network.

How to solve key escrow and identity revocation in identity-based encryption schemes

Abstract: In identity-based cryptography, a user's public key is easily derived from the user's identity and a corresponding private key is generated for the user by a trusted third party, known as a Key Generation Center (KGC). The direct derivation of public keys in identity-based cryptography can eliminate the need for certificates and can solve certain public key management problems. Identity-based cryptography has many advantages for public key management, but it has two drawbacks that prevent its practical application in the real world: key escrow problems and lack of support for a fine-grained revocation of identity. At present, there is no solution that can simultaneously solve both problems; schemes that can solve the key escrow problem still have the identity revocation problem, and vice versa. In this paper, we consider a secure identity-based encryption scheme to support a fine-grained revocation without key escrow and also present a mediated key agreement protocol based on the same setting. Using the proposed scheme, we can apply identity-based cryptography more securely and practically in the real world.