Sciweavers

250 search results - page 1 / 50
» Improving the Exact Security of Digital Signature Schemes
Sort
View
JOC
2002
114views more  JOC 2002»
13 years 4 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
CRYPTO
2000
Springer
139views Cryptology» more  CRYPTO 2000»
13 years 8 months ago
On the Exact Security of Full Domain Hash
Abstract. The Full Domain Hash (FDH) scheme is a RSA-based signature scheme in which the message is hashed onto the full domain of the RSA function. The FDH scheme is provably secu...
Jean-Sébastien Coron
ACISP
2005
Springer
13 years 10 months ago
Two Improved Partially Blind Signature Schemes from Bilinear Pairings
A blind signature scheme is a protocol for obtaining a digital signature from a signer, but the signer can neither learn the messages he/she sign nor the signatures the recipients ...
Sherman S. M. Chow, Lucas Chi Kwong Hui, Siu-Ming ...
SP
2009
IEEE
114views Security Privacy» more  SP 2009»
13 years 11 months ago
Formally Certifying the Security of Digital Signature Schemes
We present two machine-checked proofs of the existential unforgeability under adaptive chosen-message attacks of the Full Domain Hash signature scheme. These proofs formalize the ...
Santiago Zanella Béguelin, Gilles Barthe, B...
ISW
2004
Springer
13 years 10 months ago
How to Break and Repair a Universally Composable Signature Functionality
Abstract. Canetti and Rabin recently proposed a universally composable ideal functionality FSIG for digital signatures. We show that this functionality cannot be securely realized ...
Michael Backes, Dennis Hofheinz