Sciweavers

3628 search results - page 3 / 726
» The Decision Diffie-Hellman Problem
Sort
View
CSFW
2009
IEEE
13 years 10 months ago
Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation
ProVerif is one of the most successful tools for cryptographic protocol analysis. However, dealing with algebraic properties of operators such as the exclusive OR (XOR) and Diffie-...
Ralf Küsters, Tomasz Truderung
ASIACRYPT
2008
Springer
13 years 8 months ago
Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
Recently Cash, Kiltz, and Shoup [20] showed a variant of the Cramer-Shoup (CS) public key encryption (PKE) scheme [21] whose chosen-ciphertext (CCA) security relies on the computa...
Goichiro Hanaoka, Kaoru Kurosawa
CTRSA
2010
Springer
191views Cryptology» more  CTRSA 2010»
13 years 9 months ago
Making the Diffie-Hellman Protocol Identity-Based
This paper presents a new identity based key agreement protocol. In id-based cryptography (introduced by Adi Shamir in [33]) each party uses its own identity as public key and rece...
Dario Fiore, Rosario Gennaro
INFORMATICALT
2006
105views more  INFORMATICALT 2006»
13 years 6 months ago
Adaptive Chosen Ciphertext Secure Threshold Key Escrow Scheme from Pairing
This paper proposes a threshold key escrow scheme from pairing. It tolerates the passive adversary to access any internal data of corrupted key escrow agents and the active adversa...
Yu Long, Kefei Chen, Shengli Liu
CISC
2007
Springer
117views Cryptology» more  CISC 2007»
13 years 10 months ago
An Efficient ID-Based Proxy Signature Scheme from Pairings
This paper proposes a new ID-based proxy signature scheme based on the bilinear pairings. The number of paring operation involved in the verification procedure of our scheme is onl...
Chunxiang Gu, Yuefei Zhu