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

DOI10.1109/TIT.2007.907471zbMATH Open1326.94073OpenAlexW2098443120WikidataQ123007811 ScholiaQ123007811MaRDI QIDQ3549097FDOQ3549097

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 (13)

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

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)