A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort

DOI10.1007/978-3-540-85855-3_26MaRDI QIDQ3540059zbMATH OpenOpenAlexFDO

Authors Jun Furukawa, Frederik Armknecht, Kaoru Kurosawa

Publication date 20 November 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85855-3_26

zbMATH Keywords

group key exchangesession ID generationuniversal composability

Mathematics Subject Classification ID

Network protocols (68M12) Cryptography (94A60)

Recommendations

• On the Minimum Communication Effort for Secure Group Key Exchange
• scientific article; zbMATH DE number 2086716
• Initiator-resilient universally composable key exchange
• Generic one round group key exchange in the standard model
• Efficient password-based authenticated key exchange protocol in the UC framework

Cites work

• A Non-malleable Group Key Exchange Protocol Robust Against Active Insiders
• Advances in Cryptology - CRYPTO 2003
• Advances in cryptology -- CRYPTO 2004. 24th annual international cryptology conference, Santa Barbara, California, USA, August 15--19, 2004. Proceedings.
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Asynchronous group key exchange with failures
• Authenticated key exchange secure against dictionary attacks
• scientific article; zbMATH DE number 1722670 (Why is no real title available?)
• scientific article; zbMATH DE number 1722690 (Why is no real title available?)
• scientific article; zbMATH DE number 1263181 (Why is no real title available?)
• scientific article; zbMATH DE number 1024060 (Why is no real title available?)
• scientific article; zbMATH DE number 1088922 (Why is no real title available?)
• scientific article; zbMATH DE number 1942419 (Why is no real title available?)
• scientific article; zbMATH DE number 2081072 (Why is no real title available?)
• scientific article; zbMATH DE number 1759793 (Why is no real title available?)
• scientific article; zbMATH DE number 2086715 (Why is no real title available?)
• scientific article; zbMATH DE number 2086716 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• Information and Communications Security
• Initiator-resilient universally composable key exchange
• On the limitations of universally composable two-party computation without set-up assumptions
• Round-Optimal Composable Blind Signatures in the Common Reference String Model
• Scalable protocols for authenticated group key exchange
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• Theory of Cryptography
• Topics in Cryptology – CT-RSA 2006
• Universally Composable Password-Based Key Exchange
• Universally Composable Security with Global Setup
• Universally composable two-party and multi-party secure computation
• Universally Composable Undeniable Signature

Cited in

(3)

• On the Minimum Communication Effort for Secure Group Key Exchange
• Initiator-resilient universally composable key exchange
• Minimizing center key storage in hybrid one-way function based group key management with communication constraints

This page was built for publication: A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort

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