Fast asynchronous Byzantine agreement with optimal resilience
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Authenticated group key agreement and friends
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
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)
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Provably Authenticated Group Diffie-Hellman Key Exchange - The Dynamic Case
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Protocols for Key Establishment and Authentication
Protocols for Key Establishment and Authentication
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
Tree-based group key agreement
ACM Transactions on Information and System Security (TISSEC)
Group Key Agreement Efficient in Communication
IEEE Transactions on Computers
Asynchronous group key exchange with failures
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Modeling insider attacks on group key-exchange protocols
Proceedings of the 12th ACM conference on Computer and communications security
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
Modeling Key Compromise Impersonation Attacks on Group Key Exchange Protocols
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Survival in the Wild: Robust Group Key Agreement in Wide-Area Networks
Information Security and Cryptology --- ICISC 2008
Publicly verifiable secret sharing
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Quasi-efficient revocation of group signatures
FC'02 Proceedings of the 6th international conference on Financial cryptography
On security models and compilers for group key exchange protocols
IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
Stronger security of authenticated key exchange
ProvSec'07 Proceedings of the 1st international conference on Provable security
A non-malleable group key exchange protocol robust against active insiders
ISC'06 Proceedings of the 9th international conference on Information Security
Examining indistinguishability-based proof models for key establishment protocols
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
HMQV: a high-performance secure diffie-hellman protocol
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
ATC'07 Proceedings of the 4th international conference on Autonomic and Trusted Computing
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
A communication efficient group key distribution scheme for MANETs
NSS'12 Proceedings of the 6th international conference on Network and System Security
| Hi-index | 0.00 |
We extend the well-known Tree-Diffie-Hellman technique used for the design of group key exchange (GKE) protocols with robustness, i.e. with resistance to faults resulting from possible system crashes, network failures, and misbehavior of the protocol participants. We propose a fully robust GKE protocol using the novel tree replication technique: our basic protocol version ensures security against outsider adversaries whereas its extension addresses optional insider security. Both protocols are proven secure assuming stronger adversaries gaining access to the internal states of participants. Our security model for robust GKE protocols can be seen as a step towards unification of some earlier security models in this area.