Sciweavers

13 search results - page 2 / 3
» An Efficient CDH-Based Signature Scheme with a Tight Securit...
Sort
View
EUROCRYPT
2004
Springer
14 years 1 months ago
Short Signatures Without Random Oracles
We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in g...
Dan Boneh, Xavier Boyen
JOC
2002
114views more  JOC 2002»
13 years 7 months ago
Improving the Exact Security of Digital Signature Schemes
We put forward a new method of constructing Fiat-Shamir-like signature schemes that yields better "exact security" than the original Fiat-Shamir method. (We also point o...
Silvio Micali, Leonid Reyzin
EUROCRYPT
2010
Springer
13 years 7 months ago
On the Impossibility of Three-Move Blind Signature Schemes
We investigate the possibility to prove security of the well-known blind signature schemes by Chaum, and by Pointcheval and Stern in the standard model, i.e., without random oracle...
Marc Fischlin, Dominique Schröder
CRYPTO
2008
Springer
84views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
Improved Bounds on Security Reductions for Discrete Log Based Signatures
Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, ne...
Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Loka...
EUROCRYPT
2004
Springer
14 years 1 months ago
The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures
For the last two decades the notion and implementations of proxy signatures have been used to allow transfer of digital signing power within some context (in order to enable flexi...
Tal Malkin, Satoshi Obana, Moti Yung