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

DOI10.1109/TIT.2007.907471MaRDI QIDQ3549097zbMATH OpenOpenAlexWikidataFDO

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

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)

Cited in

(14)

• A pseudorandom number generator based on worst-case lattice problems
• Security under message-derived keys: signcryption in iMessage
• Secure-channel free searchable encryption with multiple keywords: a generic construction, an instantiation, and its implementation
• More efficient DDH pseudorandom generators
• Re-encryption verifiability: how to detect malicious activities of a proxy in proxy re-encryption
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Lossy trapdoor functions from homomorphic reproducible encryption
• Key encapsulation mechanisms from extractable hash proof systems, revisited
• A new multivariate-based certificateless hybrid signcryption scheme for multi-recipient
• Homomorphic proxy re-authenticators and applications to verifiable multi-user data aggregation
• A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation
• Multi-recipient and threshold encryption based on hidden multipliers
• TFHE public-key encryption revisited
• Lattice-based multi-message multi-recipient KEM/PKE with malicious security

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

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