Randomness Re-use in Multi-recipient Encryption Schemeas

DOI10.1007/3-540-36288-6_7MaRDI QIDQ4414700zbMATH OpenOpenAlexFDO

Authors M. Bellare, Alexandra Boldyreva, Jessica N. Staddon

Publication date 27 July 2003

Published in Public Key Cryptography — PKC 2003 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-36288-6_7

zbMATH Keywords

broadcast encryptionencryptionprovable securityrandomness

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Rerandomizable RCCA Encryption
• Related randomness security for public key encryption, revisited
• Security of two NIST candidates in the presence of randomness reuse
• Randomness in cryptography
• Randomness-dependent message security
• Randomness Reuse: Extensions and Improvements
• scientific article; zbMATH DE number 177022
• scientific article; zbMATH DE number 708821

Cited in

(28)

• Reproducible circularly secure bit encryption: applications and realizations
• Privacy-preserving ridge regression on distributed data
• Naor-Yung paradigm with shared randomness and applications
• Circular security is complete for KDM security
• Scalable ciphertext compression techniques for post-quantum KEMs and their applications
• scientific article; zbMATH DE number 1676657 (Why is no real title available?)
• Naor-Yung Paradigm with Shared Randomness and Applications
• Ad-hoc threshold broadcast encryption with shorter ciphertexts
• scientific article; zbMATH DE number 6683489 (Why is no real title available?)
• scientific article; zbMATH DE number 2085421 (Why is no real title available?)
• A signcryption scheme based learning with errors over rings without trapdoor
• Reproducible circularly-secure bit encryption: applications and realizations
• A Brief History of Provably-Secure Public-Key Encryption
• Generic Constructions of Stateful Public Key Encryption and Their Applications
• Rerandomizable RCCA Encryption
• Multi-recipient Public-Key Encryption from Simulators in Security Proofs
• Certified Encryption Revisited
• Efficient broadcast encryption with personalized messages
• An efficient and secure identity based multiple signatures scheme based on RSA
• Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys
• Practical dual-receiver encryption. Soundness, complete non-malleability, and applications
• Randomness Reuse: Extensions and Improvements
• CCA security and trapdoor functions via key-dependent-message security
• Compact structure-preserving signatures with almost tight security
• TFHE public-key encryption revisited
• Dynamic-FROST: Schnorr threshold signatures with a flexible committee
• Lattice-based multi-message multi-recipient KEM/PKE with malicious security
• FROST: Flexible round-optimized Schnorr threshold signatures

This page was built for publication: Randomness Re-use in Multi-recipient Encryption Schemeas

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