Proceedings ArticleDOI
Provably authenticated group Diffie-Hellman key exchange
Emmanuel Bresson,Olivier Chevassut,David Pointcheval,Jean-Jacques Quisquater +3 more
- pp 255-264
Reads0
Chats0
TLDR
This paper presents a security model for this problem and uses it to precisely define AKE (with "implicit" authentication) as the fundamental goal, and the entity-authentication goal as well, and defines the execution of an authenticated group Diffie-Hellman scheme and proves its security.Abstract:
Group Diffie-Hellman protocols for Authenticated Key Exchange (AKE) are designed to provide a pool of players with a shared secret key which may later be used, for example, to achieve multicast message integrity. Over the years, several schemes have been offered. However, no formal treatment for this cryptographic problem has ever been suggested. In this paper, we present a security model for this problem and use it to precisely define AKE (with "implicit" authentication) as the fundamental goal, and the entity-authentication goal as well. We then define in this model the execution of an authenticated group Diffie-Hellman scheme and prove its security.read more
Citations
More filters
Book
Protocols for Authentication and Key Establishment
Colin Boyd,Anish Mathuria +1 more
TL;DR: This is the first comprehensive and integrated treatment of protocols for authentication and key establishment, which allows researchers and practitioners to quickly access a protocol for their needs and become aware of existing protocols which have been broken in the literature.
Journal ArticleDOI
Tree-based group key agreement
TL;DR: This work investigates a novel group key agreement approach which blends key trees with Diffie--Hellman key exchange and yields a secure protocol suite called Tree-based Group Diffie-Hellman (TGDH) that is both simple and fault-tolerant.
Book ChapterDOI
Scalable Protocols for Authenticated Group Key Exchange
Jonathan Katz,Moti Yung +1 more
TL;DR: The main contribution is the first scalable protocol for authenticated group key exchange along with a rigorous proof of security in the standard model under the DDH assumption, which uses a constant number of rounds and requires only O(1) modular exponentiations per user (for key derivation).
Scyther : semantics and verification of security protocols
TL;DR: This thesis develops a formal model for the description and analysis of security protocols at the process level, and develops an automated veri??cation procedure, which improves over existing methods and is applied in two novel case studies.
Journal Article
Dynamic Group Diffie-Hellman Key Exchange under standard assumptions
TL;DR: This paper defines the execution of a protocol for authenticated dynamic group Diffie-Hellman and shows that it is provably secure under the decisional Diffie -Hellman assumption, and provides better security guarantees than previously published results in the random oracle model.
References
More filters
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Journal ArticleDOI
New Directions in Cryptography
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Journal ArticleDOI
Introduction to algorithms: 4. Turtle graphics
TL;DR: In this article, a language similar to logo is used to draw geometric pictures using this language and programs are developed to draw geometrical pictures using it, which is similar to the one we use in this paper.
Proceedings ArticleDOI
Random oracles are practical: a paradigm for designing efficient protocols
Mihir Bellare,Phillip Rogaway +1 more
TL;DR: It is argued that the random oracles model—where all parties have access to a public random oracle—provides a bridge between cryptographic theory and cryptographic practice, and yields protocols much more efficient than standard ones while retaining many of the advantages of provable security.
Journal ArticleDOI
Security Arguments for Digital Signatures and Blind Signatures
David Pointcheval,Jacques Stern +1 more
TL;DR: It is proved that a very slight variation of the well-known El Gamal signature scheme resists existential forgeries even against an adaptively chosen-message attack and an appropriate notion of security related to the setting of electronic cash is defined.