162 search results - page 3 / 33 » A Group Signature Scheme from Lattice Assumptions |
EUROCRYPT
2003
Springer
13 years 11 months ago
2003
Springer
A variant of Schnorr’s signature scheme called RDSA has been proposed by I. Biehl, J. Buchmann, S. Hamdy and A. Meyer in order to be used in finite abelian groups of unknown ord...
CRYPTO
2009
Springer
14 years 18 days ago
2009
Springer
We present the first signature scheme which is “short”, stateless and secure under the RSA assumption in the standard model. Prior short, standard model signatures in the RSA...
ASIACRYPT
2011
Springer
12 years 6 months ago
2011
Springer
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...
ASIACRYPT
2010
Springer
13 years 4 months ago
2010
Springer
sion of an extended abstract published in Proceedings of Asiacrypt 2010, Springer-Verlag, 2010. Available from the IACR Cryptology ePrint Archive as Report 2010/474. Beginning wit...
ASIACRYPT
2009
Springer
14 years 19 days ago
2009
Springer
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...