Identity-based encryption based on DHIES

Proceedings of the 5th International Symposium on Information, Computer and Communications Security, ASIACCS 2010

Volumn , Issue , 2010, Pages 82-88

  Chen, Yu ^a,c   Charlemagne, Manuel ^b   Guan, Zhi ^a   Hu, Jianbin ^a   Chen, Zhong ^a  

^a PEKING UNIVERSITY   (China)

^b DUBLIN CITY UNIVERSITY   (Ireland)

^c Peking University   (China)

Author keywords

bilinear map; combination; DHIES; identity based encryption

Indexed keywords

BILINEAR MAP; CHOSEN CIPHERTEXT ATTACK; CIPHERTEXTS; COMBINATION STRUCTURE; DIFFIE HELLMAN; ENCRYPTION SCHEMES; IDENTITY BASED ENCRYPTION; IDENTITY-BASED; PRIVATE KEY; PUBLIC KEY CRYPTOSYSTEMS; PUBLIC KEY GENERATION; PUBLIC KEYS; RANDOM ORACLE MODEL; RICH STRUCTURE; SHORT SIGNATURES;

HASH FUNCTIONS; PUBLIC KEY CRYPTOGRAPHY;

NETWORK SECURITY;

EID: 77954516750     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1755688.1755699     Document Type: Conference Paper

References (30)

1. M. Abdalla, M. Bellare, and P. Rogaway. The oracle diffie-hellman assumptions and an analysis of dhies. Topics in Cryptology - CT-RSA 2001, The Cryptographer's Track at RSA Conference 2001, 2020:143-158, 2001.
2. M. Abdalla, M. Bellare, and P. Rogaway. The oracle diffie-hellman assumptions and an analysis of dhies. Topics in Cryptology - CT-RSA 2001, The Cryptographer's Track at RSA Conference 2001, 2020:143-158, 2001.
3. AES: Advanced Encryption Standard. http://csrc.nist.gov/archive/aes/ index.html.
4. American National Standards Institute (ANSI) X9.F1 subcommittee. Ansi x9.63 public key cryptography for the financial services industry: Elliptic curve key agreement and key transport schemes. Working draft version 2.0, July 5 1998.
5. P. S. L. M. Barreto, H. Y. Kim, B. Lynn, and M. Scott. Efficient algorithms for pairing-based cryptosystems. Advances in Cryptology - CRYPTO 2002, 22nd Annual International Cryptology Conference, 2442:354-368, 2002.
6. M. Bellare, D. Pointcheval, and P. Rogaway. Relations among notions of security for public-key encryption schemes. Advances in Cryptography - Crypto' 98, pages 26-45, 1998.
7. J.-M. C. Bo-Yin Yang. Theoretical analysis of xl over small fields. ACISP, 3108:277-288, 2004.
8. D. Boneh and M. K. Franklin. Identity-based encryption from the weil pairing. Advances in Cryptology - CRYPTO 2001, 2139:213-229, 2001.
9. D. Boneh and M. K. Franklin. Identity-based encryption from the weil pairing. SIAM J. of Computing, 32:586-615, 2003.
10. D. Boneh, B. Lynn, and H. Shacham. Short signatures from the weil pairing. Advances in Cryptology - ASIACRYPT 2001, 7th International Conference on the Theory and Application of Cryptology and Information Security, 2248:514-532, 2001.
11. J. Callas. Identity-based encryption with conventional public-key infrastructure. In 4th Annual PKI Research and Develop Workshop, number 7224 in Interagency Reports, pages 102-115, 2005.
12. R. Canetti, S. Halevi, and J. Katz. A forward-secure public-key encryption scheme. Advances in Cryptology - Eurocrypt 2003, 2656:255-271, 2003.
13. R. Canetti, S. Halevi, and J. Katz. Chosen-ciphertext security from identitybased encryption. Advances in Cryptology - Eurocrypt 2004, 3027:207-222, 2004.
14. Certicom research. Standards for efficient cryptography group (secg)-sec 1: Elliptic curve cryptography. http://www.secg.org/secg-docs.htm, Version 1.0, Sept. 20 2000.
15. C. Cocks. An indentity based encryption scheme based on quadratic residues. Institute of Mathematics and Its Applications International Conference on Cryptigraphy and Coding - Proceedinds of IMA 2001, 2260:360-363, 2001.
16. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31:469-472, 1985.
17. FIPS. Federal information processing standards 180-2: Secure hash standard. pages 1-83, 2002.
18. M. R. Garey and D. S. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.
19. R. Granger and N. P. Smart. On computing products of pairings. http://eprint.iacr.org/2006/172, 2006.
20. IEEE P1363a Committee. IEEE P1363a/D9 - standard specifications for public key cryptography: Additional techniques. http://grouper.ieee.org/groups/ 1363/index.html/, Draft Version 9, June 2001.
21. J. P. Jeffrey Hoffstein and J. H. Silverman. Ntru a ring-based public key cryptosystem. Algorithmic Number Theory, 1423:267-288, 1998.
22. Lan F. Blake, Gadiel Seroussi, and Nigel P. Smart. Advances in Elliptic Curve Cryptography, volume 317. London Mathemartics Society, 2004.
23. A. K. Lenstra and E. R. Verheul. The xtr public key system. CRYPTO 2000, 1880:1-19, 2000.
24. T. Lickteig. Gaussian elimination is optimal for solving linear equations in dimension two. Inf. Process. Lett., 22(6):277-279, 1986.
25. U. M. Maurer and Y. Yacobi. Non-interactive public-key cryptography. EUROCRYPT 1991, 547:498-507, 1991.
26. MIRACL. http://www.shamus.ie/.
27. A. S. R. Rivest and L. Adleman. A method for obtaining digital signatures and public key cryptosystems. Communications of the ACM, 21(2):120-126, February 1978.
28. A. Shamir. Identity-based cryptosystems and signatures schemes. Advances in Cryptology - Crypto 1984, 196:47-53, 1984.
29. Z. C. Wen Tang, Xianghao Nan. Combined public key cryptosystem. Proceedings of International Conference on Software, Telecommunications and Computer Networks (SoftCOM'04), 2004.
30. F. Zhang, R. Safavi-Naini, and W. Susilo. An efficient signature scheme from bilinear pairings and its applications. Public Key Cryptography - PKC 2004, 7th International Workshop on Theory and Practice in Public Key Cryptography, 2947:277-290, 2004.