Sciweavers

24 search results - page 2 / 5
» Short Signatures from Weaker Assumptions
Sort
View
ASIACRYPT
2010
Springer
13 years 4 months ago
A Group Signature Scheme from Lattice Assumptions
Group signature schemes allow users to sign messages on behalf of a group while (1) maintaining anonymity (within that group) with respect to an observer, yet (2) ensuring traceab...
S. Dov Gordon, Jonathan Katz, Vinod Vaikuntanathan
ASIACRYPT
2004
Springer
13 years 10 months ago
Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
Group signature schemes are cryptographic systems that provide revocable anonymity for signers. We propose a group signature scheme with constant-size public key and signature leng...
Lan Nguyen, Reihaneh Safavi-Naini
CTRSA
2005
Springer
221views Cryptology» more  CTRSA 2005»
13 years 11 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
ASIACRYPT
2004
Springer
13 years 11 months ago
Improved Setup Assumptions for 3-Round Resettable Zero Knowledge
In the bare public-key model, introduced by Canetti et al. [STOC 2000], it is only assumed that each verifier deposits during a setup phase a public key in a file accessible by a...
Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Vis...
PKC
2012
Springer
235views Cryptology» more  PKC 2012»
11 years 8 months ago
Improved Security for Linearly Homomorphic Signatures: A Generic Framework
ded abstract of this work will appear in Public Key Cryptography — PKC 2012. This is the full version. We propose a general framework that converts (ordinary) signature schemes ...
David Mandell Freeman