Randomness Re-use in Multi-recipient Encryption Schemeas

DOI10.1007/3-540-36288-6_7zbMath1033.94511OpenAlexW1574314127MaRDI QIDQ4414700

Jessica N. Staddon, Alexandra Boldyreva, Mihir Bellare

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

provable securityencryptionrandomnessbroadcast encryption

Mathematics Subject Classification ID

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

Related Items (20)

An efficient and secure identity based multiple signatures scheme based on RSA ⋮ FROST: Flexible round-optimized Schnorr threshold signatures ⋮ Reproducible Circularly-Secure Bit Encryption: Applications and Realizations ⋮ Naor-Yung paradigm with shared randomness and applications ⋮ A Brief History of Provably-Secure Public-Key Encryption ⋮ Generic Constructions of Stateful Public Key Encryption and Their Applications ⋮ Privacy-preserving ridge regression on distributed data ⋮ Reproducible circularly secure bit encryption: applications and realizations ⋮ Circular security is complete for KDM security ⋮ Scalable ciphertext compression techniques for post-quantum KEMs and their applications ⋮ Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys ⋮ A Signcryption Scheme Based Learning with Errors over Rings Without Trapdoor ⋮ Compact structure-preserving signatures with almost tight security ⋮ Efficient Broadcast Encryption with Personalized Messages ⋮ Randomness Reuse: Extensions and Improvements ⋮ CCA security and trapdoor functions via key-dependent-message security ⋮ Multi-recipient Public-Key Encryption from Simulators in Security Proofs ⋮ Certified Encryption Revisited ⋮ Naor-Yung Paradigm with Shared Randomness and Applications ⋮ Ad-Hoc Threshold Broadcast Encryption with Shorter Ciphertexts

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