Randomness Reuse: Extensions and Improvements

DOI10.1007/978-3-540-77272-9_16MaRDI QIDQ5447521zbMATH OpenOpenAlexFDO

Authors Manuel Barbosa, Pooya Farshim

Publication date 7 March 2008

Published in Cryptography and Coding (Search for Journal in Brave)

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

zbMATH Keywords

Hybrid EncryptionMulti-RecipientRandomness Reuse

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Randomness Re-use in Multi-recipient Encryption Schemeas
• Multi-recipient Public-Key Encryption from Simulators in Security Proofs
• Security in Communication Networks
• CCA secure multi-recipient KEM from LPN
• Related randomness attacks for public key encryption

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?)
• Certificateless public key cryptography
• Cryptography and Coding
• Efficient hybrid encryption from ID-based encryption
• Escrow-free encryption supporting cryptographic workflow
• Identity-Based Encryption from the Weil Pairing
• Randomness Re-use in Multi-recipient Encryption Schemeas
• Secure integration of asymmetric and symmetric encryption schemes
• Security in Communication Networks
• Solving Simultaneous Modular Equations of Low Degree

Cited in

(6)

• Multi-recipient Public-Key Encryption from Simulators in Security Proofs
• Using Rademacher permutations to reduce randomness
• Scalable ciphertext compression techniques for post-quantum KEMs and their applications
• Extracting Randomness via Repeated Condensing
• How to get more mileage from randomness extractors
• Randomness Re-use in Multi-recipient Encryption Schemeas

This page was built for publication: Randomness Reuse: Extensions and Improvements

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