Grafting key trees: efficient key management for overlapping groups

DOI10.1007/978-3-030-90456-2_8OpenAlexW3211914011MaRDI QIDQ2697894

Yanyan Li

Publication date: 13 April 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-90456-2_8

zbMATH Keywords

Huffman codemulticast encryption protocols

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

CoCoA: concurrent continuous group key agreement ⋮ On the insider security of MLS ⋮ Fork-resilient continuous group key agreement

Cites Work

• Boolean function complexity. Advances and frontiers.
• 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
• On the security of public key protocols
• Advances in Cryptology - EUROCRYPT 2004
• A Method for the Construction of Minimum-Redundancy Codes

This page was built for publication: Grafting key trees: efficient key management for overlapping groups