<--- Back to Details
First PageDocument Content
Cryptography / Finite fields / Computational hardness assumptions / Password-authenticated key agreement / Password Authenticated Key Exchange by Juggling / SPEKE / DiffieHellman problem / Zero-knowledge proof / XTR / Digital signature / Proof of knowledge
Date: 2015-03-20 08:39:27
Cryptography
Finite fields
Computational hardness assumptions
Password-authenticated key agreement
Password Authenticated Key Exchange by Juggling
SPEKE
DiffieHellman problem
Zero-knowledge proof
XTR
Digital signature
Proof of knowledge

Security of the J-PAKE Password-Authenticated Key Exchange Protocol Michel Abdalla Fabrice Benhamouda

Add to Reading List

Source URL: www.normalesup.org

Download Document from Source Website

File Size: 457,80 KB

Share Document on Facebook

Similar Documents

Security of the J-PAKE Password-Authenticated Key Exchange Protocol Michel Abdalla Fabrice Benhamouda

Security of the J-PAKE Password-Authenticated Key Exchange Protocol Michel Abdalla Fabrice Benhamouda

DocID: 1mJoe - View Document

Useful Stuff Benjamin Smith Context Algebraic Curves  Useful Stuff

Useful Stuff Benjamin Smith Context Algebraic Curves Useful Stuff

DocID: 1mq5q - View Document

Motivation - Exotic Security Assumptions in Cryptography Main Algorithm and Results Oracle-assisted Static DHP for binary curves On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields

Motivation - Exotic Security Assumptions in Cryptography Main Algorithm and Results Oracle-assisted Static DHP for binary curves On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields

DocID: 1miS9 - View Document

1  On the Symbolic Analysis of Low-Level Cryptographic Primitives: Modular Exponentiation and the Diffie-Hellman Protocol M ARZIA B USCEMI, University of Pisa

1 On the Symbolic Analysis of Low-Level Cryptographic Primitives: Modular Exponentiation and the Diffie-Hellman Protocol M ARZIA B USCEMI, University of Pisa

DocID: 1lnSV - View Document