<--- 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

The second era of the internet, digital signature infrastructures and trusted entities KSI, PKI and Permissioned Blockchain By Eduardo Lacerda A new era of technology, born on the great platform of digital information, w

DocID: 1vdvG - View Document

FACTSHEET e-identity “With the digital signature and the machinereadable ID card, we created the e-citizen.” Former President of Estonia –

DocID: 1uYfU - View Document

Machine-Generated Algorithms, Proofs and Software for the Batch Verification of Digital Signature Schemes Joseph A. Akinyele∗§ Matthew Green∗†

DocID: 1uV7t - View Document

GUIDELINES FOR SCANNING THE PHOTOGRAPH & SIGNATURE Before applying online a candidate is required to have a scanned (digital) image of his/her photograph and signature as per the specifications given below. (i) PHOTOGRAP

DocID: 1uG1X - View Document