The Experts below are selected from a list of 3534 Experts worldwide ranked by ideXlab platform

David Pointcheval - One of the best experts on this subject based on the ideXlab platform.

  • Strong Password-Based Authentication in TLS using the Three-Party Group Diffie-Hellman Protocol
    International Journal of Security and Networks, 2015
    Co-Authors: Michel Abdalla, Emmanuel Bresson, Olivier Chevassut, Bodo Möller, Bodo Moller, David Pointcheval
    Abstract:

    The Internet has evolved into a very hostile ecosystem where "phishing" attacks are com- mon practice. This paper shows that the three-party group Diffie-Hellman Key Exchange can help protect against these attacks. We have developed password-based ciphersuites for the Transport Layer Security (TLS) protocol that are not only provably secure but also believed to be free from patent and licensing restrictions based on an analysis of relevant patents in the area.

  • a security solution for ieee 802 11 s ad hoc mode password authentication and group diffie hellman Key Exchange
    International Journal of Wireless and Mobile Computing, 2007
    Co-Authors: Emmanuel Bresson, Olivier Chevassut, David Pointcheval
    Abstract:

    IEEE 802 standards ease the deployment of networking infrastructures and enable employers to access corporate networks while travelling. These standards provide two modes of communication called infrastructure and ad hoc modes. A security solution for the IEEE 802.11's infrastructure mode took several years to reach maturity and firmware is still been upgraded, yet a solution for the ad hoc mode needs to be specified. This paper is a first attempt in this direction. It leverages the latest developments in the area of password-based authentication and (group) Diffie Hellman Key Exchange to develop a provably secure Key-Exchange protocol for IEEE 802.11's ad hoc mode. The protocol allows users to securely join and leave the wireless group at time, accommodates either a single-shared password or pairwise-shared passwords among the group members or at least with a central server; achieves security against dictionary attacks in the ideal-hash model (i.e. random oracles). This is, to the best of our knowledge, the first such protocol to appear in the cryptographic literature.

  • Password-based group Key Exchange in a constant number of rounds
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2006
    Co-Authors: Michel Abdalla, Emmanuel Bresson, Olivier Chevassut, David Pointcheval
    Abstract:

    With the development of grids, distributed applications are spread across multiple computing resources and require efficient security mechanisms among the processes. Although protocols for authenticated group Diffie-Hellman Key Exchange protocols seem to be the natural mechanisms for supporting these applications, current solutions are either limited by the use of public Key infrastructures or by their scalability, requiring a number of rounds linear in the number of group members. To overcome these shortcomings, we propose in this paper the first provably-secure password-based constant-round group Key Exchange protocol. It is based on the protocol of Burmester and Desmedt and is provably-secure in the random-oracle and ideal-cipher models, under the Decisional Diffie-Hellman assumption. The new protocol is very efficient and fully scalable since it only requires four rounds of communication and four multi-exponentiations per user. Moreover, the new protocol avoids intricate authentication infrastructures by relying on passwords for authentication.

  • group diffie hellman Key Exchange secure against dictionary attacks
    Lecture Notes in Computer Science, 2002
    Co-Authors: Emmanuel Bresson, Olivier Chevassut, David Pointcheval
    Abstract:

    Group Diffie-Hellman schemes for password-based Key Exchange are designed to provide a pool of players communicating over a public network, and sharing just a human-memorable password, with a session Key (e.g, the Key is used for multicast data integrity and confidentiality). The fundamental security goal to achieve in this scenario is security against dictionary attacks. While solutions have been proposed to solve this problem no formal treatment has ever been suggested. In this paper, we define a security model and then present a protocol with its security proof in both the random oracle model and the ideal-cipher model.

  • provably authenticated group diffie hellman Key Exchange the dynamic case
    International Conference on the Theory and Application of Cryptology and Information Security, 2001
    Co-Authors: Emmanuel Bresson, Olivier Chevassut, David Pointcheval
    Abstract:

    Dynamic group Diffie-Hellman protocols for Authenticated Key Exchange (AKE) are designed to workin a 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 Exchange (AKE) with "implicit" authentication as the fundamental goal, and the entity-authentication goal as well. We then define in this model the execution of a protocol modified from a dynamic group Diffie-Hellman scheme offered in the litterature and prove its security.

Emmanuel Bresson - One of the best experts on this subject based on the ideXlab platform.

  • Strong Password-Based Authentication in TLS using the Three-Party Group Diffie-Hellman Protocol
    International Journal of Security and Networks, 2015
    Co-Authors: Michel Abdalla, Emmanuel Bresson, Olivier Chevassut, Bodo Möller, Bodo Moller, David Pointcheval
    Abstract:

    The Internet has evolved into a very hostile ecosystem where "phishing" attacks are com- mon practice. This paper shows that the three-party group Diffie-Hellman Key Exchange can help protect against these attacks. We have developed password-based ciphersuites for the Transport Layer Security (TLS) protocol that are not only provably secure but also believed to be free from patent and licensing restrictions based on an analysis of relevant patents in the area.

  • a security solution for ieee 802 11 s ad hoc mode password authentication and group diffie hellman Key Exchange
    International Journal of Wireless and Mobile Computing, 2007
    Co-Authors: Emmanuel Bresson, Olivier Chevassut, David Pointcheval
    Abstract:

    IEEE 802 standards ease the deployment of networking infrastructures and enable employers to access corporate networks while travelling. These standards provide two modes of communication called infrastructure and ad hoc modes. A security solution for the IEEE 802.11's infrastructure mode took several years to reach maturity and firmware is still been upgraded, yet a solution for the ad hoc mode needs to be specified. This paper is a first attempt in this direction. It leverages the latest developments in the area of password-based authentication and (group) Diffie Hellman Key Exchange to develop a provably secure Key-Exchange protocol for IEEE 802.11's ad hoc mode. The protocol allows users to securely join and leave the wireless group at time, accommodates either a single-shared password or pairwise-shared passwords among the group members or at least with a central server; achieves security against dictionary attacks in the ideal-hash model (i.e. random oracles). This is, to the best of our knowledge, the first such protocol to appear in the cryptographic literature.

  • strong password based authentication intls using the three party group diffie hellman protocol
    2007
    Co-Authors: Michel Abdalla, Emmanuel Bresson, Olivier Chevassut, Bodo Moller, Horst Gortz
    Abstract:

    The internet has evolved into a very hostile ecosystem where 'phishing' attacks are common practice. This paper shows that the three-party group Diffie-Hellman Key Exchange can help protect against these attacks. We have developed password-based ciphersuites for the Transport Layer Security (TLS) protocol that are not only provably secure but also believed to be free from patent and licensing restrictions based on an analysis of relevant patents in the area.

  • Password-based group Key Exchange in a constant number of rounds
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2006
    Co-Authors: Michel Abdalla, Emmanuel Bresson, Olivier Chevassut, David Pointcheval
    Abstract:

    With the development of grids, distributed applications are spread across multiple computing resources and require efficient security mechanisms among the processes. Although protocols for authenticated group Diffie-Hellman Key Exchange protocols seem to be the natural mechanisms for supporting these applications, current solutions are either limited by the use of public Key infrastructures or by their scalability, requiring a number of rounds linear in the number of group members. To overcome these shortcomings, we propose in this paper the first provably-secure password-based constant-round group Key Exchange protocol. It is based on the protocol of Burmester and Desmedt and is provably-secure in the random-oracle and ideal-cipher models, under the Decisional Diffie-Hellman assumption. The new protocol is very efficient and fully scalable since it only requires four rounds of communication and four multi-exponentiations per user. Moreover, the new protocol avoids intricate authentication infrastructures by relying on passwords for authentication.

  • group diffie hellman Key Exchange secure against dictionary attacks
    Lecture Notes in Computer Science, 2002
    Co-Authors: Emmanuel Bresson, Olivier Chevassut, David Pointcheval
    Abstract:

    Group Diffie-Hellman schemes for password-based Key Exchange are designed to provide a pool of players communicating over a public network, and sharing just a human-memorable password, with a session Key (e.g, the Key is used for multicast data integrity and confidentiality). The fundamental security goal to achieve in this scenario is security against dictionary attacks. While solutions have been proposed to solve this problem no formal treatment has ever been suggested. In this paper, we define a security model and then present a protocol with its security proof in both the random oracle model and the ideal-cipher model.

Olivier Chevassut - One of the best experts on this subject based on the ideXlab platform.

  • Strong Password-Based Authentication in TLS using the Three-Party Group Diffie-Hellman Protocol
    International Journal of Security and Networks, 2015
    Co-Authors: Michel Abdalla, Emmanuel Bresson, Olivier Chevassut, Bodo Möller, Bodo Moller, David Pointcheval
    Abstract:

    The Internet has evolved into a very hostile ecosystem where "phishing" attacks are com- mon practice. This paper shows that the three-party group Diffie-Hellman Key Exchange can help protect against these attacks. We have developed password-based ciphersuites for the Transport Layer Security (TLS) protocol that are not only provably secure but also believed to be free from patent and licensing restrictions based on an analysis of relevant patents in the area.

  • a security solution for ieee 802 11 s ad hoc mode password authentication and group diffie hellman Key Exchange
    International Journal of Wireless and Mobile Computing, 2007
    Co-Authors: Emmanuel Bresson, Olivier Chevassut, David Pointcheval
    Abstract:

    IEEE 802 standards ease the deployment of networking infrastructures and enable employers to access corporate networks while travelling. These standards provide two modes of communication called infrastructure and ad hoc modes. A security solution for the IEEE 802.11's infrastructure mode took several years to reach maturity and firmware is still been upgraded, yet a solution for the ad hoc mode needs to be specified. This paper is a first attempt in this direction. It leverages the latest developments in the area of password-based authentication and (group) Diffie Hellman Key Exchange to develop a provably secure Key-Exchange protocol for IEEE 802.11's ad hoc mode. The protocol allows users to securely join and leave the wireless group at time, accommodates either a single-shared password or pairwise-shared passwords among the group members or at least with a central server; achieves security against dictionary attacks in the ideal-hash model (i.e. random oracles). This is, to the best of our knowledge, the first such protocol to appear in the cryptographic literature.

  • strong password based authentication intls using the three party group diffie hellman protocol
    2007
    Co-Authors: Michel Abdalla, Emmanuel Bresson, Olivier Chevassut, Bodo Moller, Horst Gortz
    Abstract:

    The internet has evolved into a very hostile ecosystem where 'phishing' attacks are common practice. This paper shows that the three-party group Diffie-Hellman Key Exchange can help protect against these attacks. We have developed password-based ciphersuites for the Transport Layer Security (TLS) protocol that are not only provably secure but also believed to be free from patent and licensing restrictions based on an analysis of relevant patents in the area.

  • Password-based group Key Exchange in a constant number of rounds
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2006
    Co-Authors: Michel Abdalla, Emmanuel Bresson, Olivier Chevassut, David Pointcheval
    Abstract:

    With the development of grids, distributed applications are spread across multiple computing resources and require efficient security mechanisms among the processes. Although protocols for authenticated group Diffie-Hellman Key Exchange protocols seem to be the natural mechanisms for supporting these applications, current solutions are either limited by the use of public Key infrastructures or by their scalability, requiring a number of rounds linear in the number of group members. To overcome these shortcomings, we propose in this paper the first provably-secure password-based constant-round group Key Exchange protocol. It is based on the protocol of Burmester and Desmedt and is provably-secure in the random-oracle and ideal-cipher models, under the Decisional Diffie-Hellman assumption. The new protocol is very efficient and fully scalable since it only requires four rounds of communication and four multi-exponentiations per user. Moreover, the new protocol avoids intricate authentication infrastructures by relying on passwords for authentication.

  • group diffie hellman Key Exchange secure against dictionary attacks
    Lecture Notes in Computer Science, 2002
    Co-Authors: Emmanuel Bresson, Olivier Chevassut, David Pointcheval
    Abstract:

    Group Diffie-Hellman schemes for password-based Key Exchange are designed to provide a pool of players communicating over a public network, and sharing just a human-memorable password, with a session Key (e.g, the Key is used for multicast data integrity and confidentiality). The fundamental security goal to achieve in this scenario is security against dictionary attacks. While solutions have been proposed to solve this problem no formal treatment has ever been suggested. In this paper, we define a security model and then present a protocol with its security proof in both the random oracle model and the ideal-cipher model.

Michel Abdalla - One of the best experts on this subject based on the ideXlab platform.

  • Strong Password-Based Authentication in TLS using the Three-Party Group Diffie-Hellman Protocol
    International Journal of Security and Networks, 2015
    Co-Authors: Michel Abdalla, Emmanuel Bresson, Olivier Chevassut, Bodo Möller, Bodo Moller, David Pointcheval
    Abstract:

    The Internet has evolved into a very hostile ecosystem where "phishing" attacks are com- mon practice. This paper shows that the three-party group Diffie-Hellman Key Exchange can help protect against these attacks. We have developed password-based ciphersuites for the Transport Layer Security (TLS) protocol that are not only provably secure but also believed to be free from patent and licensing restrictions based on an analysis of relevant patents in the area.

  • strong password based authentication intls using the three party group diffie hellman protocol
    2007
    Co-Authors: Michel Abdalla, Emmanuel Bresson, Olivier Chevassut, Bodo Moller, Horst Gortz
    Abstract:

    The internet has evolved into a very hostile ecosystem where 'phishing' attacks are common practice. This paper shows that the three-party group Diffie-Hellman Key Exchange can help protect against these attacks. We have developed password-based ciphersuites for the Transport Layer Security (TLS) protocol that are not only provably secure but also believed to be free from patent and licensing restrictions based on an analysis of relevant patents in the area.

  • Password-based group Key Exchange in a constant number of rounds
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2006
    Co-Authors: Michel Abdalla, Emmanuel Bresson, Olivier Chevassut, David Pointcheval
    Abstract:

    With the development of grids, distributed applications are spread across multiple computing resources and require efficient security mechanisms among the processes. Although protocols for authenticated group Diffie-Hellman Key Exchange protocols seem to be the natural mechanisms for supporting these applications, current solutions are either limited by the use of public Key infrastructures or by their scalability, requiring a number of rounds linear in the number of group members. To overcome these shortcomings, we propose in this paper the first provably-secure password-based constant-round group Key Exchange protocol. It is based on the protocol of Burmester and Desmedt and is provably-secure in the random-oracle and ideal-cipher models, under the Decisional Diffie-Hellman assumption. The new protocol is very efficient and fully scalable since it only requires four rounds of communication and four multi-exponentiations per user. Moreover, the new protocol avoids intricate authentication infrastructures by relying on passwords for authentication.

R V Penty - One of the best experts on this subject based on the ideXlab platform.

  • 5g network slicing with qkd and quantum safe security
    IEEE\ OSA Journal of Optical Communications and Networking, 2021
    Co-Authors: Paul Wright, Catherine White, Ryan C Parker, Jeansebastien Pegon, Marco Menchetti, Joseph Pearse, Arash Bahrami, Anastasia Moroz, A Wonfor, R V Penty
    Abstract:

    We demonstrate how the 5G network slicing model can be enhanced to address data security requirements. In this work, we demonstrate two different slice configurations, with different encryption requirements, representing two diverse use-cases for 5G networking, namely, an enterprise application hosted at a metro network site and a content delivery network. We create a modified software-defined networking (SDN) orchestrator that calculates and provisions network slices according to the requirements, including encryption backed by quantum Key distribution (QKD) and other methods. Slices are automatically provisioned by SDN orchestration of network resources, allowing selection of encrypted links as appropriate, including those that use encryption with standard Diffie–Hellman Key Exchange, QKD, or quantum-resistant algorithms, as well as no encryption at all. We show that the setup and teardown times of the network slices take approximately 1–2 min, which is at least an order of magnitude improvement over manually provisioning a link today.

  • 5g network slicing with qkd and quantum safe security
    arXiv: Networking and Internet Architecture, 2020
    Co-Authors: Paul Wright, Catherine White, Ryan C Parker, Jeansebastien Pegon, Marco Menchetti, Joseph Pearse, Arash Bahrami, Anastasia Moroz, A Wonfor, R V Penty
    Abstract:

    We demonstrate how the 5G network slicing model can be extended to address data security requirements. In this work we demonstrate two different slice configurations, with different encryption requirements, representing two diverse use-cases for 5G networking: namely, an enterprise application hosted at a metro network site, and a content delivery network. We create a modified software-defined networking (SDN) orchestrator which calculates and provisions network slices according to the requirements, including encryption backed by quantum Key distribution (QKD), or other methods. Slices are automatically provisioned by SDN orchestration of network resources, allowing selection of encrypted links as appropriate, including those which use standard Diffie-Hellman Key Exchange, QKD and quantum-resistant algorithms (QRAs), as well as no encryption at all. We show that the set-up and tear-down times of the network slices takes of the order of 1-2 minutes, which is an order of magnitude improvement over manually provisioning a link today.