How to construct random functions
Journal of the ACM (JACM)
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Fast asynchronous Byzantine agreement with optimal resilience
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Adaptively secure multi-party computation
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Key Agreement in Dynamic Peer Groups
IEEE Transactions on Parallel and Distributed Systems
Communications of the ACM
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Provably authenticated group Diffie-Hellman key exchange
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Group communication specifications: a comprehensive study
ACM Computing Surveys (CSUR)
On Key Agreement and Conference Key Agreement
ACISP '97 Proceedings of the Second Australasian Conference on Information Security and Privacy
A Threshold Pseudorandom Function Construction and Its Applications
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Authenticated Multi-Party Key Agreement
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
A Practical and Secure-Fault-Tolerant Conferenc-Key Agreement Protocol
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
A Study of Group Rekeying
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Exploring Robustness in Group Key Agreement
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
Secure Group Communication Using Robust Contributory Key Agreement
IEEE Transactions on Parallel and Distributed Systems
New multiparty authentication services and key agreement protocols
IEEE Journal on Selected Areas in Communications
Modeling insider attacks on group key-exchange protocols
Proceedings of the 12th ACM conference on Computer and communications security
Provably secure authenticated group Diffie-Hellman key exchange
ACM Transactions on Information and System Security (TISSEC)
Robust group key agreement using short broadcasts
Proceedings of the 14th ACM conference on Computer and communications security
Securing group key exchange against strong corruptions
Proceedings of the 2008 ACM symposium on Information, computer and communications security
A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Securing group key exchange against strong corruptions and key registration attacks
International Journal of Applied Cryptography
Survival in the Wild: Robust Group Key Agreement in Wide-Area Networks
Information Security and Cryptology --- ICISC 2008
Fully Robust Tree-Diffie-Hellman Group Key Exchange
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Privacy-preserving activity scheduling on mobile devices
Proceedings of the first ACM conference on Data and application security and privacy
T-robust scalable group key exchange protocol with O(log n) complexity
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Meetings through the cloud: Privacy-preserving scheduling on mobile devices
Journal of Systems and Software
Privacy in mobile computing for location-sharing-based services
PETS'11 Proceedings of the 11th international conference on Privacy enhancing technologies
| Hi-index | 0.00 |
Group key exchange protocols allow a group of servers communicating over an asynchronous network of point-to-point links to establish a common key, such that an adversary which fully controls the network links (but not the group members) cannot learn the key. Currently known group key exchange protocols rely on the assumption that all group members participate in the protocol and if a single server crashes, then no server may terminate the protocol. In this paper, we propose the first purely asynchronous group key exchange protocol that tolerates a minority of servers to crash. Our solution uses a constant number of rounds, which makes it suitable for use in practice. Furthermore, we also investigate how to provide forward secrecy with respect to an adversary that may break into some servers and observe their internal state. We show that any group key exchange protocol among n servers that tolerates tc 0 servers to crash can only provide forward secrecy if the adversary breaks into less than n - 2tc servers, and propose a group key exchange protocol that achieves this bound.