Sciweavers

21 search results - page 3 / 5
» A Practical and Provably Secure Scheme for Publicly Verifiab...
Sort
View
ICISC
2004
147views Cryptology» more  ICISC 2004»
13 years 8 months ago
Batch Verifications with ID-Based Signatures
An identity (ID)-based signature scheme allows any pair of users to verify each other's signatures without exchanging public key certificates. With the advent of Bilinear maps...
HyoJin Yoon, Jung Hee Cheon, Yongdae Kim
ACNS
2003
Springer
193views Cryptology» more  ACNS 2003»
14 years 18 days ago
Round Optimal Distributed Key Generation of Threshold Cryptosystem Based on Discrete Logarithm Problem
Distributed key generation is one of the most challenging tasks for threshold cryptosystems. Designing such a protocol and proving its security against a malicious, adaptive adver...
Rui Zhang 0002, Hideki Imai
CTRSA
2005
Springer
221views Cryptology» more  CTRSA 2005»
14 years 27 days 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
INFOCOM
2009
IEEE
14 years 2 months ago
Dependable and Secure Sensor Data Storage with Dynamic Integrity Assurance
Abstract—Recently, distributed data storage has gained increasing popularity for efficient and robust data management in wireless sensor networks (WSNs). But the distributed arc...
Qian Wang, Kui Ren, Wenjing Lou, Yanchao Zhang
EUROCRYPT
2000
Springer
13 years 11 months ago
Efficient Receipt-Free Voting Based on Homomorphic Encryption
Voting schemes that provide receipt-freeness prevent voters from proving their cast vote, and hence thwart vote-buying and coercion. We analyze the security of the multi-authority ...
Martin Hirt, Kazue Sako