Sciweavers

13 search results - page 1 / 3
» Accumulators from Bilinear Pairings and Applications
Sort
View
CTRSA
2005
Springer
221views Cryptology» more  CTRSA 2005»
14 years 3 months ago
Accumulators from Bilinear Pairings and Applications
We propose a dynamic accumulator scheme from bilinear pairings, whose security is based on the Strong Diffie-Hellman assumption. We show applications of this accumulator in constru...
Lan Nguyen
CTRSA
2007
Springer
171views Cryptology» more  CTRSA 2007»
13 years 11 months ago
Compact E-Cash from Bounded Accumulator
Abstract. Known compact e-cash schemes are constructed from signature schemes with efficient protocols and verifiable random functions. In this paper, we introduce a different ap...
Man Ho Au, Qianhong Wu, Willy Susilo, Yi Mu
IJNSEC
2006
94views more  IJNSEC 2006»
13 years 9 months ago
Construction of Dynamic Threshold Decryption Scheme from Pairing
The first dynamic threshold decryption scheme from pairing is presented. It is secure in groups equipped with a bilinear map, and caters to some important requirements in real app...
Yu Long, Kefei Chen
ICONS
2008
IEEE
14 years 4 months ago
An Efficient Hardware Implementation of the Tate Pairing in Characteristic Three
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 ...
Giray Kömürcü, Erkay Savas
ACISP
2004
Springer
14 years 1 months ago
Secure Bilinear Diffie-Hellman Bits
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...
Steven D. Galbraith, Herbie J. Hopkins, Igor Shpar...