A Brief History of Provably-Secure Public-Key Encryption

DOI10.1007/978-3-540-68164-9_24zbMath1142.94342OpenAlexW1483133413MaRDI QIDQ3506393

Alexander W. Dent

Publication date: 13 June 2008

Published in: Progress in Cryptology – AFRICACRYPT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68164-9_24

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic encryption
• Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
• The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Randomness Re-use in Multi-recipient Encryption Schemeas
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• Fundamental problems in provable security and cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology - CRYPTO 2003
• Relations Among Notions of Plaintext Awareness
• Relationship Between Standard Model Plaintext Awareness and Message Hiding
• Towards Plaintext-Aware Public-Key Encryption Without Random Oracles
• Topics in Cryptology – CT-RSA 2005

This page was built for publication: A Brief History of Provably-Secure Public-Key Encryption