A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort
From MaRDI portal
Publication:3540059
DOI10.1007/978-3-540-85855-3_26zbMath1180.94052OpenAlexW1564136120MaRDI QIDQ3540059
Kaoru Kurosawa, Frederik Armknecht, Jun Furukawa
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
Related Items (1)
Cites Work
- Scalable protocols for authenticated group key exchange
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- Advances in cryptology -- CRYPTO 2004. 24th annual international cryptology conference, Santa Barbara, California, USA, August 15--19, 2004. Proceedings.
- On the limitations of universally composable two-party computation without set-up assumptions
- A Non-malleable Group Key Exchange Protocol Robust Against Active Insiders
- Universally Composable Undeniable Signature
- Universally composable two-party and multi-party secure computation
- Universally Composable Security with Global Setup
- Initiator-Resilient Universally Composable Key Exchange
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Universally Composable Password-Based Key Exchange
- Advances in Cryptology - CRYPTO 2003
- Information and Communications Security
- Asynchronous group key exchange with failures
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
- Topics in Cryptology – CT-RSA 2006
- Theory of Cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort
