Multi-recipient Public-Key Encryption from Simulators in Security Proofs
From MaRDI portal
Publication:3634501
Recommendations
Cites work
- scientific article; zbMATH DE number 2085421 (Why is no real title available?)
- scientific article; zbMATH DE number 1302835 (Why is no real title available?)
- Advances in Cryptology – CRYPTO 2004
- Chosen-Ciphertext Secure Key-Encapsulation Based on Gap Hashed Diffie-Hellman
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
- Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys
- Randomness Re-use in Multi-recipient Encryption Schemeas
- Randomness Reuse: Extensions and Improvements
- Secure Hybrid Encryption from Weakened Key Encapsulation
- Security in Communication Networks
- The Twin Diffie-Hellman Problem and Applications
Cited in
(5)- Key encapsulation mechanisms from extractable hash proof systems, revisited
- Randomness Reuse: Extensions and Improvements
- scientific article; zbMATH DE number 5009203 (Why is no real title available?)
- Scalable ciphertext compression techniques for post-quantum KEMs and their applications
- Encryption Simulatability Reconsidered
This page was built for publication: Multi-recipient Public-Key Encryption from Simulators in Security Proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3634501)