On the worst-case inefficiency of CGKA
From MaRDI portal
Publication:6114271
DOI10.1007/978-3-031-22365-5_8zbMath1519.94212OpenAlexW4312875584MaRDI QIDQ6114271
Garrison Grogan, Sanjam Garg, Alexander Bienstock, Yevgeniy Dodis, Paul Rösler, Mohammad Hajiabadi
Publication date: 14 August 2023
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22365-5_8
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)
Related Items (4)
On the worst-case inefficiency of CGKA ⋮ Strongly anonymous ratcheted key exchange ⋮ On active attack detection in messaging with immediate decryption ⋮ Fork-resilient continuous group key agreement
Cites Work
- Random oracles and non-uniformity
- Security analysis and improvements for the IETF MLS standard for group messaging
- On the price of concurrency in group ratcheting protocols
- Continuous group key agreement with active security
- Multicast key agreement, revisited
- CoCoA: concurrent continuous group key agreement
- A formal security analysis of the Signal messaging protocol
- The double ratchet: security notions, proofs, and modularization for the Signal protocol
- Determining the core primitive for optimally secure ratcheting
- Forward secret encrypted RAM: lower bounds and applications
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- On the power of nonuniformity in proofs of security
- Security in Communication Networks
- A more complete analysis of the signal double ratchet algorithm
- On the insider security of MLS
- On the worst-case inefficiency of CGKA
- Strongly anonymous ratcheted key exchange
This page was built for publication: On the worst-case inefficiency of CGKA
