Miniature CCA2 PK Encryption: Tight Security Without Redundancy

DOI10.1007/978-3-540-76900-2_30MaRDI QIDQ3498395zbMATH OpenOpenAlexFDO

Authors Xavier Boyen

Publication date 15 May 2008

Published in Advances in Cryptology – ASIACRYPT 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-76900-2_30

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Compact CCA-Secure Encryption for Messages of Arbitrary Length
• Compact public key encryption with minimum ideal property of hash functions
• Tightly Secure Signatures and Public-Key Encryption
• Tightly secure signatures and public-key encryption
• Concise multi-challenge CCA-secure encryption and signatures with almost tight security

Cited in

(5)

• The twin Diffie-Hellman problem and applications
• Compact public key encryption with minimum ideal property of hash functions
• Iterated random oracle: a universal approach for finding loss in security reduction
• On shortening ciphertexts: new constructions for compact public key and stateful encryption schemes
• Compact CCA-Secure Encryption for Messages of Arbitrary Length

This page was built for publication: Miniature CCA2 PK Encryption: Tight Security Without Redundancy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3498395)