Password-Based Authenticated Key Exchange in the Three-Party Setting

By Michel Abdalla, Pierre-Alain Fouque, David Pointcheval. International Conference on Theory and Practice of Public Key Cryptography, 2005

951 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A Provably Secure, Efficient, and Flexible Authentication Scheme for Ad hoc Wireless Sensor Networks (2016, methodology): “• T est ( t ): This query models the semantic security of the session key following the Indistinguishability in the Real-Or-Random (ROR) model [17].”
Design of Secure User Authenticated Key Management Protocol for Generic IoT Networks (2018, background): “6) Test( t): This query models the semantic security of the SK following the indistinguishability in ROR [28].”
A computationally sound mechanized prover for security protocols (2006, background): “This corresponds to the “real-orrandom” definition of security [4].”
Sequences of games: a tool for taming complexity in security proofs (2004, neutral): “have also been using very similar proof styles recently [ AFP04 , BK04, BCP02a, BCP02b, BCP03, CPP04, DF03, DFKY03, DFJW04, Den03, FOPS04, GaPMV03, KD04, PP03, SWP04].”
Secure Remote User Authenticated Key Establishment Protocol for Smart Home Environment (2020, methodology): “We follow the Abdalla et al.’s ROR model [14] for formal security analysis as done in [26].”
Barriers and Facilitators That Influence Telemedicine-Based, Real-Time, Online Consultation at Patients’ Homes: Systematic Literature Review (2020, methodology): “Test(Π): It represents the semantic security of a session key SKij betweenUi andSDj following the indistinguishability in the ROR model [14].”