<--- Back to Details
First PageDocument Content
Finite fields / Computational hardness assumptions / Diffie–Hellman key exchange / Key-agreement protocol / Diffie–Hellman problem / ID-based encryption / XTR / Key exchange / Digital signature / Cryptography / Cryptographic protocols / Public-key cryptography
Date: 2003-12-20 20:23:11
Finite fields
Computational hardness assumptions
Diffie–Hellman key exchange
Key-agreement protocol
Diffie–Hellman problem
ID-based encryption
XTR
Key exchange
Digital signature
Cryptography
Cryptographic protocols
Public-key cryptography

ID-based Authenticated Two Round Multi-Party Key Agreement

Add to Reading List

Source URL: eprint.iacr.org

Download Document from Source Website

File Size: 114,70 KB

Share Document on Facebook

Similar Documents

A Framework for Universally Composable Diffie-Hellman Key Exchange Ralf K¨usters and Daniel Rausch University of Stuttgart Stuttgart, Germany Email: {ralf.kuesters, daniel.rausch}@informatik.uni-stuttgart.de

A Framework for Universally Composable Diffie-Hellman Key Exchange Ralf K¨usters and Daniel Rausch University of Stuttgart Stuttgart, Germany Email: {ralf.kuesters, daniel.rausch}@informatik.uni-stuttgart.de

DocID: 1xUdu - View Document

Efficient algorithms for supersingular isogeny Diffie-Hellman Craig Costello Joint work with Patrick Longa and Michael Naehrig  Diffie-Hellman key exchange (circa 1976)

Efficient algorithms for supersingular isogeny Diffie-Hellman Craig Costello Joint work with Patrick Longa and Michael Naehrig Diffie-Hellman key exchange (circa 1976)

DocID: 1uXO8 - View Document

Applicazioni del logaritmo discreto alla crittografia. Diffie-Hellman-Merkle key exchange su ZZ∗p . Il signor Rossi e il signor Bianchi vogliono condividere un numero segreto senza inviarselo. Si accordano su un primo

Applicazioni del logaritmo discreto alla crittografia. Diffie-Hellman-Merkle key exchange su ZZ∗p . Il signor Rossi e il signor Bianchi vogliono condividere un numero segreto senza inviarselo. Si accordano su un primo

DocID: 1qhge - View Document

Number Theory, Discrete Logs, Diffie–Hellman key exchange CARPA Radu February 14, 2013 1

Number Theory, Discrete Logs, Diffie–Hellman key exchange CARPA Radu February 14, 2013 1

DocID: 1n8iv - View Document

Contact:  Jim OrmondCRYPTOGRAPHY PIONEERS RECEIVE ACM A.M. TURING AWARD

Contact: Jim OrmondCRYPTOGRAPHY PIONEERS RECEIVE ACM A.M. TURING AWARD

DocID: 1miTr - View Document