Sciweavers

77 search results - page 10 / 16
» Security of Blind Signatures Revisited
Sort
View
CORR
2000
Springer
93views Education» more  CORR 2000»
13 years 7 months ago
The Random Oracle Methodology, Revisited
We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing...
Ran Canetti, Oded Goldreich, Shai Halevi
IJNSEC
2008
107views more  IJNSEC 2008»
13 years 7 months ago
Short Designated Verifier Signature Scheme and Its Identity-based Variant
The notion of strong designated verifier signature was put forth by Jakobsson, Sako and Impagliazzo in 1996, but the formal definition was defined recently by Saeednia, Kremer and...
Xinyi Huang, Willy Susilo, Yi Mu, Futai Zhang
ESORICS
2005
Springer
14 years 29 days ago
Machine-Checked Security Proofs of Cryptographic Signature Schemes
Abstract. Formal methods have been extensively applied to the certification of cryptographic protocols. However, most of these works make the perfect cryptography assumption, i.e....
Sabrina Tarento
EUROCRYPT
2003
Springer
14 years 19 days ago
Fair Secure Two-Party Computation
Abstract Benny Pinkas HP Labs Abstract. We demonstrate a transformation of Yao’s protocol for secure two-party computation to a fair protocol in which neither party gains any sub...
Benny Pinkas
PKC
2005
Springer
110views Cryptology» more  PKC 2005»
14 years 27 days ago
From Fixed-Length to Arbitrary-Length RSA Encoding Schemes Revisited
To sign with RSA, one usually encodes the message m as µ(m) and then raises the result to the private exponent modulo N. In Asiacrypt 2000, Coron et al. showed how to build a secu...
Julien Cathalo, Jean-Sébastien Coron, David...