Multi-recipient Public-Key Encryption from Simulators in Security Proofs
From MaRDI portal
Publication:3634501
DOI10.1007/978-3-642-02620-1_21zbMath1284.94079OpenAlexW2116402131MaRDI QIDQ3634501
Harunaga Hiwatari, Koichi Sakumoto, Tomoyuki Asano, Keisuke Tanaka
Publication date: 25 June 2009
Published in: Information Security and Privacy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02620-1_21
Related Items (2)
Scalable ciphertext compression techniques for post-quantum KEMs and their applications ⋮ Key Encapsulation Mechanisms from Extractable Hash Proof Systems, Revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
- Secure Hybrid Encryption from Weakened Key Encapsulation
- Randomness Re-use in Multi-recipient Encryption Schemeas
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Advances in Cryptology – CRYPTO 2004
- Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys
- Randomness Reuse: Extensions and Improvements
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- The Twin Diffie-Hellman Problem and Applications
- Security in Communication Networks
- Chosen-Ciphertext Secure Key-Encapsulation Based on Gap Hashed Diffie-Hellman
This page was built for publication: Multi-recipient Public-Key Encryption from Simulators in Security Proofs