Sciweavers

77 search results - page 8 / 16
» Security of Blind Signatures Revisited
Sort
View
133
Voted
ASIACRYPT
2010
Springer
14 years 12 months ago
Lattice-Based Blind Signatures
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
Markus Rückert
112
Voted
ASIACRYPT
2010
Springer
14 years 12 months ago
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
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...
Sarah Meiklejohn, Hovav Shacham, David Mandell Fre...
ICICS
2004
Springer
15 years 7 months ago
Factorization-Based Fail-Stop Signatures Revisited
Fail-stop signature (FSS) schemes are important primitives because in a fail-stop signature scheme the signer is protected against unlimited powerful adversaries as follows: Even i...
Katja Schmidt-Samoa
120
Voted
CTRSA
2007
Springer
111views Cryptology» more  CTRSA 2007»
15 years 8 months ago
A Practical and Tightly Secure Signature Scheme Without Hash Function
In 1999, two signature schemes based on the flexible RSA problem (a.k.a. strong RSA problem) were independently introduced: the Gennaro-Halevi-Rabin (GHR) signature scheme and the...
Benoît Chevallier-Mames, Marc Joye
IEEEIAS
2009
IEEE
14 years 11 months ago
On Security Notions for Verifiably Encrypted Signature
First we revisit three - BGLS, MBGLS and GZZ verifiably encrypted signature schemes [2, 3, 6]. We find that they are all not strong unforgeable.We remark that the notion of existen...
Xu An Wang, Xiaoyuan Yang, Qingquan Peng