An Identity Based Encryption Scheme Based on Quadratic Residues

@inproceedings{Cocks2001AnIB,
  title={An Identity Based Encryption Scheme Based on Quadratic Residues},
  author={Clifford C. Cocks},
  booktitle={IMACC},
  year={2001}
}
We present a novel public key cryptosystem in which the public key of a subscriber can be chosen to be a publicly known value, such as his identity. We discuss the security of the proposed scheme, and show that this is related to the difficulty of solving the quadratic residuosity problem. 
Security of Identity-Based Encryption Schemes from Quadratic Residues
TLDR
It is shown that the only secure schemes are the Cocks and Boneh-Gentry-Hamburg schemes (except of anonymous variations of them). Expand
Identity-Based Encryption from the Weil Pairing
TLDR
This work proposes a fully functional identity-based encryption scheme (IBE) based on the Weil pairing that has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational Diffie-Hellman problem. Expand
Identity-Based Encryption from the Weil Pairing
TLDR
This work proposes a fully functional identity-based encryption (IBE) scheme based on bilinear maps between groups and gives precise definitions for secure IBE schemes and gives several applications for such systems. Expand
Threshold identity based encryption scheme on quadratic residues
A new threshold identity-based encryption scheme secure against a chosen identity attack is proposed in this paper. The construction extends the identity-based encryption scheme by Cocks.
A new identity based signcryption scheme from pairings
We present a new identity based scheme using pairings over elliptic curves. It combines the functionalities of signature and encryption and is provably secure in the random oracle model. We compareExpand
Secure Identity Based Encryption Without Random Oracles
We present a fully secure Identity Based Encryption scheme whose proof of security does not rely on the random oracle heuristic. Security is based on the Decision Bilinear Diffie-Hellman assumption.Expand
A New Identity Based Encryption Scheme From Pairing
TLDR
An efficient identity based encryption scheme from pairing which is provably secure against chosen plaintext attack and no stronger than decision bilinear Diffie-Hellman assumption is constructed. Expand
Hierarchical ID-Based Cryptography
We present hierarchical identity-based encryption schemes and signature schemes that have total collusion resistance on an arbitrary number of levels and that have chosen ciphertext security in theExpand
Identity-Based Threshold Decryption Revisited
We present an identity-based threshold decryption scheme, which is secure against adaptive chosen ciphertext attack (IND-CCA) in the random oracle and generic model (ROM+GM). In our scheme, a onetimeExpand
Direct Chosen-Ciphertext Secure Identity-Based Key Encapsulation without Random Oracles
TLDR
A new and practical identity-based key encapsulation mechanism that is secure in the standard model against choseniphertext (CCA2) attacks and more efficient than all previously proposed schemes. Expand
...
1
2
3
4
5
...

References

SHOWING 1-8 OF 8 REFERENCES
Identity-Based Encryption from the Weil Pairing
TLDR
This work proposes a fully functional identity-based encryption (IBE) scheme based on bilinear maps between groups and gives precise definitions for secure IBE schemes and gives several applications for such systems. Expand
Split Knowledge Generation of RSA Parameters
We show how it is possible for two parties to co-operate in generating the parameters for an RSA encryption system in such a way that neither individually has the ability to decrypt enciphered data.Expand
Identity-Based Cryptosystems and Signature Schemes
TLDR
A novel type of cryptographic scheme, which enables any pair of users to communicate securely and to verify each other’s signatures without exchanging private or public keys, without keeping key directories, and without using the services of a third party. Expand
A course in computational algebraic number theory
  • H. Cohen
  • Computer Science, Mathematics
  • Graduate texts in mathematics
  • 1993
TLDR
The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods. Expand
Course in Computational Algebraic Number Theory Springer-Verlag graduate texts in mathematics 138
  • Course in Computational Algebraic Number Theory Springer-Verlag graduate texts in mathematics 138
  • 1993
Identity-based cryptosystems and signature schemes
C Cocks Split Generation of RSA Parameters with Multiple Participants Proceedings of 6th IMA conference on Cryptography and Coding
  • C Cocks Split Generation of RSA Parameters with Multiple Participants Proceedings of 6th IMA conference on Cryptography and Coding
  • 1355
A Shamir Identity Based Cryptosystems and Signature Schemes Advances in Cryptology -Proceedings of Crypto '84. UK Crown Copyright c 2001. All rights reserved
  • A Shamir Identity Based Cryptosystems and Signature Schemes Advances in Cryptology -Proceedings of Crypto '84. UK Crown Copyright c 2001. All rights reserved