On the Minimum Communication Effort for Secure Group Key Exchange

DOI10.1007/978-3-642-19574-7_22zbMATH Open1293.94099OpenAlexW1552396910MaRDI QIDQ3084264FDOQ3084264

Authors: Frederik Armknecht, Jun Furukawa 

Publication date: 15 March 2011

Published in: Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19574-7_22

Recommendations

• A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort
• Lower bounds and new constructions on secure group communication schemes
• Communication-efficient 2-round group key establishment from pairings
• Cryptanalysis and improved construction of a group key agreement for secure group communication
• A communication--computation efficient group key algorithm for large and dynamic groups
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation

zbMATH Keywords

group key exchangeUC securitycommunication effort

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Graph theory with applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Authenticated key exchange secure against dictionary attacks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Securing group key exchange against strong corruptions and key registration attacks
• Modeling Key Compromise Impersonation Attacks on Group Key Exchange Protocols
• Title not available (Why is that?)
• A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort
• Password-Authenticated Group Key Agreement with Adaptive Security and Contributiveness

Cited In (8)

• Lower bounds and new constructions on secure group communication schemes
• Generic one round group key exchange in the standard model
• Minimizing center key storage in hybrid one-way function based group key management with communication constraints
• Title not available (Why is that?)
• Flexible group key exchange with on-demand computation of subgroup keys
• A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort
• Securing group key exchange against strong corruptions and key registration attacks
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation

This page was built for publication: On the Minimum Communication Effort for Secure Group Key Exchange

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