Efficient identity-based key encapsulation to multiple parties

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3796 LNCS, Issue , 2005, Pages 428-441

  Barbosa, M ^a   Farshim, P ^b  

^a UNIVERSITY OF MINHO   (Portugal)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Hybrid Encryption; Identity Based Cryptography; Key Encapsulation Mechanism (KEM); Provable Security

Indexed keywords

COMPUTER OPERATING SYSTEMS; ENCAPSULATION; MATHEMATICAL MODELS; RANDOM PROCESSES; RELATIONAL DATABASE SYSTEMS; SECURITY OF DATA;

HYBRID ENCRYPTION; IDENTITY BASED CRYPTOGRAPHY; KEY ENCAPSULATION MECHANISM (KEM); PROVABLE SECURITY;

PUBLIC KEY CRYPTOGRAPHY;

EID: 33646823652     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11586821_28     Document Type: Conference Paper

References (17)

1. M. Abdalla, M. Bellare and P. Rogaway. DHAES: An encryption scheme based on the Diffie-Hellman problem. Cryptology ePrint Archive, Report 1999/007. 1999.
2. M. Bellare. Practice-priented provable-security. Proceedings of First International Workshop on Information Security, LNCS 1396. Springer-Verlag, 1998.
3. M. Bellare, A. Boldyreva and S. Micali. Public-key encryption in the multi-user setting: security proofs and improvements. Advances in Cryptology - EUROCRYPT 2000, LNCS 1807:259-274. Springer-Verlag, 2000.
4. K. Bentahar, P. Farshim, J. Malone-Lee and N. P. Smart. Generic constructions of identity-based and certificateless KEMs. Cryptology ePrint Archive, Report 2005/058. 2005.
5. D. Boneh and M. Franklin. Identity based encryption from the Weil pairing. SIAM Journal on Computing, 32:586-615. 2003.
6. D. Boneh, B. Lynn and H. Shacham. Short signatures from the Weil pairing. Advances in Cryptology - ASIACRYPT 2001, LNCS 2248:514-532. Springer-Verlag, 2001.
7. R. Cramer and V. Shoup. Design and analysis of practical public-key encryption schemes secure against adaptive chosen-ciphertext attack. SIAM Journal on Computing, 33:167-226. 2003.
8. A. W. Dent. A designer's guide to KEMs. Coding and Cryptography, LNCS 2898:133-151. Springer-Verlag, 2003.
9. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and Systems Sciences, 28:270-299. 1984.
10. N. Koblitz and A. Menezes. Another look at provable security. Cryptology ePrint Archive, Report 2004/152. 2004.
11. B. Lynn. Authenticated identity-based encryption. Cryptology ePrint Archive, Report 2002/072. 2002.
12. A. Miyaji, M. Nakabayashi and S. Takano. New explicit conditions of elliptic curve traces for FR-reduction. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E84-A:1234-1243. 2001.
13. T. Okamoto and D. Pointcheval. The gap-problems: A new class of problems for the security of cryptographic schemes. Public Key Cryptography - PKC 2001, LNCS 1992:104-118. Springer-Verlag, 2001.
14. C. Rackoff and D. R. Simon Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. Advances in Cryptology - CRYPTO 1991, LNCS 576:433-444. Springer-Verlag, 1991
15. N. P. Smart. Access control using pairing based cryptography. Topics in Cryptology - CT-RSA 2003, LNCS 2612:111-121. Springer-Verlag, 2003.
16. N. P. Smart. Efficient key encapsulation to multiple parties. Security in Communication Networks, LNCS 3352:208-219. Springer-Verlag, 2005.
17. V. Shoup. A proposal for an ISO standard for public key encryption (version 2.1). Preprint. 2001.