<--- Back to Details
First PageDocument Content
Computational hardness assumptions / Diffie–Hellman key exchange / Diffie–Hellman problem / Weil pairing / ID-based encryption / Password authentication protocol / Public-key cryptography / Boneh/Franklin scheme / Cryptography / Cryptographic protocols / Finite fields
Date: 2005-12-09 05:56:33
Computational hardness assumptions
Diffie–Hellman key exchange
Diffie–Hellman problem
Weil pairing
ID-based encryption
Password authentication protocol
Public-key cryptography
Boneh/Franklin scheme
Cryptography
Cryptographic protocols
Finite fields

Improvement of Ma ni ke ta l .

Add to Reading List

Source URL: eprint.iacr.org

Download Document from Source Website

File Size: 416,50 KB

Share Document on Facebook

Similar Documents

On the Robustness of some Cryptographic Protocols for Mobile Agent Protection Volker Roth Fraunhofer Institut f¨ur Graphische Datenverarbeitung Rundeturmstraße 6, 64283 Darmstadt, Germany

DocID: 1uZJK - View Document

Verifying Cryptographic Protocols in Applied Pi Calculus Mark Ryan Ben Smyth

DocID: 1uXvn - View Document

Secure Cryptographic Protocols for E-commerce Transaction on the Internet

DocID: 1uDkO - View Document

Type-Based Automated Verification of Authenticity in Cryptographic Protocols Daisuke Kikuchi and Naoki Kobayashi Graduate School of Information Sciences, Tohoku University {kikuchi,koba}@kb.ecei.tohoku.ac.jp

DocID: 1u5Us - View Document

Cryptographic schemes Protocols Specifications of primitives

DocID: 1u4P2 - View Document