38 search results - page 1 / 8 » Computationally sound analysis of protocols using bilinear p... |
JCS
2010
13 years 9 months ago
2010
ACISP
2004
Springer
14 years 2 months ago
2004
Springer
The Weil and Tate pairings are a popular new gadget in cryptography and have found many applications, including identity-based cryptography. In particular, the pairings have been u...
ICONS
2008
IEEE
14 years 5 months ago
2008
IEEE
DL systems with bilinear structure recently became an important base for cryptographic protocols such as identity-based encryption (IBE). Since the main computational task is the ...
IJNSEC
2006
13 years 11 months ago
2006
Batch verification can provide large computational savings when multiple signatures are verified together. Recently, some batch verifying signature schemes have been proposed from...
CRYPTO
2007
Springer
14 years 5 months ago
2007
Springer
In this paper we identify the (P, Q)-DDH assumption, as an extreme, powerful generalization of the Decisional Diffie-Hellman (DDH) assumption: virtually all previously proposed gen...