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
Provably authenticated group Diffie-Hellman key exchange
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on 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
Group Diffie-Hellman Key Exchange Secure against Dictionary Attacks
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The Decision Diffie-Hellman Problem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Protocols for Key Establishment and Authentication
Protocols for Key Establishment and Authentication
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
Secure group key establishment revisited
International Journal of Information Security
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
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
Password-Based group key exchange in a constant number of rounds
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
ATC'07 Proceedings of the 4th international conference on Autonomic and Trusted Computing
Securing group key exchange against strong corruptions and key registration attacks
International Journal of Applied Cryptography
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
Universally composable contributory group key exchange
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
Group Key Exchange Enabling On-Demand Derivation of Peer-to-Peer Keys
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Fully Robust Tree-Diffie-Hellman Group Key Exchange
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Multi-path key establishment against REM attacks in wireless ad hoc networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Generic one round group key exchange in the standard model
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
Modeling leakage of ephemeral secrets in tripartite/group key exchange
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
Degrees of security: protocol guarantees in the face of compromising adversaries
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Modeling and analyzing security in the presence of compromising adversaries
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
On the minimum communication effort for secure group key exchange
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Stronger security model of group key agreement
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Modeling key compromise impersonation attacks on group key exchange protocols
ACM Transactions on Information and System Security (TISSEC)
Flexible group key exchange with on-demand computation of subgroup keys
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Computationally-Fair group and identity-based key-exchange
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Group key agreement for secure group communication in dynamic peer systems
Journal of Parallel and Distributed Computing
Sufficient condition for ephemeral key-leakage resilient tripartite key exchange
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
| Hi-index | 0.00 |
When users run a group key exchange (GKE) protocol, they usually extract the key from some auxiliary (ephemeral) secret information generated during the execution. Strong corruptions are attacks by which an adversary can reveal these ephemeral secrets, in addition to the possibly used long-lived keys. Undoubtedly, security impact of strong corruptions is serious, and thus specifying appropriate security requirements and designing secure GKE protocols appears an interesting yet challenging task --- the aim of our paper. We start by investigating the current setting of strong corruptions and derive some further refinements such as opening attacks that allow to reveal ephemeral secrets of users without their long-lived keys. This allows to consider even stronger attacks against honest, but "opened" users. Further, we define strong security goals for GKE protocols in the presence of such powerful adversaries and propose a Tree Diffie-Hellman protocol immune to their attacks. Our security definitions in particular include the case of malicious insiders, for appropriate security goals such as mutual authentication, key confirmation, contributiveness and key-replication resilience. The proposed protocol proceeds in three rounds and is provably secure in the standard model.