Tackling Adaptive Corruptions in Multicast Encryption Protocols

DOI10.1007/978-3-540-70936-7_2zbMath1129.94033OpenAlexW2099631081MaRDI QIDQ3596371

Saurabh Panjwani

Publication date: 30 August 2007

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70936-7_2

zbMATH Keywords

EncryptionMulticastAdaptive CorruptionsSelective Decryption

Mathematics Subject Classification ID

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

Related Items

A Quasipolynomial Reduction for Generalized Selective Decryption on Trees ⋮ CoCoA: concurrent continuous group key agreement ⋮ Let attackers program ideal models: modularity and composability for adaptive compromise ⋮ On the insider security of MLS ⋮ The power of undirected rewindings for adaptive security ⋮ Confidential gossip ⋮ The cost of adaptivity in security games on graphs ⋮ Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening ⋮ Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts) ⋮ A Provably Secure PKCS#11 Configuration Without Authenticated Attributes ⋮ Security analysis and improvements for the IETF MLS standard for group messaging

This page was built for publication: Tackling Adaptive Corruptions in Multicast Encryption Protocols