Search Results

Advanced search parameters have been applied.
open access

Provably Secure Password-based Authentication in TLS

Description: In this paper, we show how to design an efficient, provably secure password-based authenticated key exchange mechanism specifically for the TLS (Transport Layer Security) protocol. The goal is to provide a technique that allows users to employ (short) passwords to securely identify themselves to servers. As our main contribution, we describe a new password-based technique for user authentication in TLS, called Simple Open Key Exchange (SOKE). Loosely speaking, the SOKE ciphersuites are unauthen… more
Date: December 20, 2005
Creator: Abdalla, Michel; Emmanuel, Bresson; Chevassut, Olivier; Moeller,Bodo & Pointcheval, David
Partner: UNT Libraries Government Documents Department
open access

An integrated solution for secure group communication in wide-area networks

Description: Many distributed applications require a secure reliable group communication system to provide coordination among the application components. This paper describes a secure group layer (SGL) which bundles a reliable group communication system, a group authorization and access control mechanism, and a group key agreement protocol to provide a comprehensive and practical secure group communication platform. SGL also encapsulates the standard message security services (i.e, confidentiality, authenti… more
Date: April 1, 2001
Creator: Agarwal, Deborah A.; Chevassut, Olivier; Thompson, Mary & Tsudik, Gene
Partner: UNT Libraries Government Documents Department
open access

A practical approach to the interGroup protocols

Description: Existing reliable ordered group communication protocols have been developed for local-area networks and do not, in general, scale well to large numbers of nodes and wide-area networks. The InterGroup suite of protocols is a scalable group communication system that introduces an unusual approach to handling group membership, and supports a receiver-oriented selection of service. The protocols are intended for a wide-area network, with a large number of nodes, that has highly variable delays and … more
Date: November 12, 2001
Creator: Berket, Karlo; Agarwal, Deborah A. & Chevassut, Olivier
Partner: UNT Libraries Government Documents Department
open access

Dynamic Group Diffie-Hellman Key Exchange under standard assumptions

Description: Authenticated Diffie-Hellman key exchange allows two principals communicating over a public network, and each holding public-private keys, to agree on a shared secret value. In this paper we study the natural extension of this cryptographic problem to a group of principals. We begin from existing formal security models and refine them to incorporate major missing details (e.g., strong-corruption and concurrent sessions). Within this model we define the execution of a protocol for authenticated … more
Date: February 14, 2002
Creator: Bresson, Emmanuel; Chevassut, Olivier & Pointcheval, David
Partner: UNT Libraries Government Documents Department
open access

The group Diffie-Hellman problems

Description: In this paper they study generalizations of the Diffie-Hellman problems recently used to construct cryptographic schemes for practical purposes. The Group Computational and the Group Decisional Diffie-Hellman assumptions not only enable one to construct efficient pseudo-random functions but also to naturally extend the Diffie-Hellman protocol to allow more than two parties to agree on a secret key. In this paper they provide results that add to their confidence in the GCDH problem. They reach t… more
Date: July 20, 2002
Creator: Bresson, Emmanuel; Chevassut, Olivier & Pointcheval, David
Partner: UNT Libraries Government Documents Department
open access

New Security Results on Encrypted Key Exchange

Description: Schemes for encrypted key exchange are designed to provide two entities communicating over a public network, and sharing a (short) password only, with a session key to be used to achieve data integrity and/or message confidentiality. An example of a very efficient and ''elegant'' scheme for encrypted key exchange considered for standardization by the IEEE P1363 Standard working group is AuthA. This scheme was conjectured secure when the symmetric-encryption primitive is instantiated via either … more
Date: December 15, 2003
Creator: Bresson, Emmanuel; Chevassut, Olivier & Pointcheval, David
Partner: UNT Libraries Government Documents Department
open access

Provably authenticated group Diffie-Hellman key exchange - The dynamic case (Extended abstract)

Description: Dynamic group Diffie-Hellman protocols for Authenticated Key Exchange(AKE) are designed to work in scenario in which the group membership is not known in advance but where parties may join and may also leave the multicast group at any given time. While several schemes have been proposed to deal with this scenario no formal treatment for this cryptographic problem has ever been suggested. In this paper, we define a security model for this problem and use it to precisely define Authenticated Key … more
Date: September 20, 2001
Creator: Bresson, Emmanuel; Chevassut, Olivier & Pointcheval, David
Partner: UNT Libraries Government Documents Department
open access

Provably-Secure Authenticated Group Diffie-Hellman KeyExchange

Description: Authenticated key exchange protocols allow two participantsA and B, communicating over a public network and each holding anauthentication means, to exchange a shared secret value. Methods designedto deal with this cryptographic problem ensure A (resp. B) that no otherparticipants aside from B (resp. A) can learn any information about theagreed value, and often also ensure A and B that their respective partnerhas actually computed this value. A natural extension to thiscryptographic method is to… more
Date: January 1, 2007
Creator: Bresson, Emmanuel; Chevassut, Olivier & Pointcheval, David
Partner: UNT Libraries Government Documents Department
open access

Authenticated group Diffie-Hellman key exchange: theory and practice

Description: Authenticated two-party Diffie-Hellman key exchange allows two principals A and B, communicating over a public network, and each holding a pair of matching public/private keys to agree on a session key. Protocols designed to deal with this problem ensure A (B resp.)that no other principals aside from B (A resp.) can learn any information about this value. These protocols additionally often ensure A and B that their respective partner has actually computed the shared secret value. A natural exte… more
Date: October 3, 2002
Creator: Chevassut, Olivier
Partner: UNT Libraries Government Documents Department
open access

Security Proof for Password Authentication in TLS-Verifier-based Three-Party Group Diffie-Hellman

Description: The internet has grown greatly in the past decade, by some numbers exceeding 47 million active web sites and a total aggregate exceeding100 million web sites. What is common practice today on the Internet is that servers have public keys, but clients are largely authenticated via short passwords. Protecting these passwords by not storing them in the clear on institutions's servers has become a priority. This paper develops password-based ciphersuites for the Transport Layer Security (TLS) proto… more
Date: April 21, 2008
Creator: Chevassut, Olivier; Milner, Joseph & Pointcheval, David
Partner: UNT Libraries Government Documents Department
open access

Secure password-based authenticated key exchange for web services

Description: This paper discusses an implementation of an authenticated key-exchange method rendered on message primitives defined in the WS-Trust and WS-SecureConversation specifications. This IEEE-specified cryptographic method (AuthA) is proven-secure for password-based authentication and key exchange, while the WS-Trust and WS-Secure Conversation are emerging Web Services Security specifications that extend the WS-Security specification. A prototype of the presented protocol is integrated in the WSRF-co… more
Date: November 22, 2004
Creator: Liang, Fang; Meder, Samuel; Chevassut, Olivier & Siebenlist, Frank
Partner: UNT Libraries Government Documents Department
Back to Top of Screen