Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security

DOI10.1109/TIT.2007.907471zbMath1326.94073OpenAlexW2098443120WikidataQ123007811 ScholiaQ123007811MaRDI QIDQ3549097

Jessica N. Staddon, Mihir Bellare, Alexandra Boldyreva, Kaoru Kurosawa

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2007.907471

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (11)

More efficient DDH pseudorandom generators ⋮ A pseudorandom number generator based on worst-case lattice problems ⋮ A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation ⋮ Secure-channel free searchable encryption with multiple keywords: a generic construction, an instantiation, and its implementation ⋮ Lossy trapdoor functions from homomorphic reproducible encryption ⋮ Key Encapsulation Mechanisms from Extractable Hash Proof Systems, Revisited ⋮ Re-Encryption Verifiability: How to Detect Malicious Activities of a Proxy in Proxy Re-Encryption ⋮ Security under message-derived keys: signcryption in iMessage ⋮ Homomorphic Proxy Re-Authenticators and Applications to Verifiable Multi-User Data Aggregation ⋮ New multivariate-based certificateless hybrid signcryption scheme for multi-recipient ⋮ A public key cryptosystem and a signature scheme based on discrete logarithms

This page was built for publication: Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security