On the worst-case inefficiency of CGKA

DOI10.1007/978-3-031-22365-5_8MaRDI QIDQ6114271zbMATH OpenOpenAlexFDO

Authors Alexander Bienstock, Yevgeniy Dodis, Sanjam Garg, Garrison Grogan, Mohammad Hajiabadi, Paul Rösler

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

zbMATH Keywords

CGKA protocolscontinuous group key agreement

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• The worst-case analysis of the Garey-Johnson algorithm
• Optimality of CKP-inequality in the critical case
• scientific article; zbMATH DE number 3950207
• On the structure and complexity of worst-case equilibria
• Worst case complexity of direct search under convexity
• scientific article; zbMATH DE number 18061
• Worst-case ratio of \(A_{kk}\) algorithm for problem \(P_m,a_i\|C_{\max}\)
• Efficiency of weak greedy algorithms for m-term approximations
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization

Cites work

• A formal security analysis of the Signal messaging protocol
• A more complete analysis of the signal double ratchet algorithm
• CoCoA: concurrent continuous group key agreement
• Continuous group key agreement with active security
• Determining the core primitive for optimally secure ratcheting
• Forward secret encrypted RAM: lower bounds and applications
• Multicast key agreement, revisited
• Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
• On the insider security of MLS
• On the power of nonuniformity in proofs of security
• On the price of concurrency in group ratcheting protocols
• On the worst-case inefficiency of CGKA
• Random oracles and non-uniformity
• Security analysis and improvements for the IETF MLS standard for group messaging
• Security in Communication Networks
• Strongly anonymous ratcheted key exchange
• The double ratchet: security notions, proofs, and modularization for the signal protocol

Cited in

(19)

• Security analysis and improvements for the IETF MLS standard for group messaging
• Continuous group key agreement with active security
• Multicast key agreement, revisited
• CoCoA: concurrent continuous group key agreement
• On the worst case performance of TESSA
• On the insider security of MLS
• 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
• On the cost of post-compromise security in concurrent continuous group-key agreement
• WhatsUpp with sender keys? Analysis, improvements and security proofs
• DeCAF: Decentralizable CGKA with fast healing
• Continuous group-key agreement: concurrent updates without pruning
• GURKE: group unidirectional ratcheted key exchange
• Succinct PPRFs via memory-tight reductions
• The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging
• Tightly-secure group key exchange with perfect forward secrecy
• Group key progression: strong security for shared persistent data

This page was built for publication: On the worst-case inefficiency of CGKA

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