Sciweavers

79 search results - page 10 / 16
» Fair Blind Signatures without Random Oracles
Sort
View
CRYPTO
2005
Springer
144views Cryptology» more  CRYPTO 2005»
14 years 3 months ago
Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
We investigate several previously suggested scenarios of instantiating random oracles (ROs) with “realizable” primitives in cryptographic schemes. As candidates for such “in...
Alexandra Boldyreva, Marc Fischlin
CISC
2008
Springer
152views Cryptology» more  CISC 2008»
13 years 11 months ago
Privacy for Private Key in Signatures
One of the important applications of digital signature is anonymous credential or pseudonym system. In these scenarios, it is essential that the identity of the signer is kept secr...
Qianhong Wu, Bo Qin, Yi Mu, Willy Susilo
PKC
2007
Springer
111views Cryptology» more  PKC 2007»
14 years 3 months ago
Optimistic Fair Exchange in a Multi-user Setting
: This paper addresses the security of optimistic fair exchange in a multi-user setting. While the security of public key encryption and public key signature schemes in a single-us...
Yevgeniy Dodis, Pil Joong Lee, Dae Hyun Yum
DRM
2003
Springer
14 years 3 months ago
Breaking and repairing optimistic fair exchange from PODC 2003
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...
Yevgeniy Dodis, Leonid Reyzin
ASIACRYPT
2006
Springer
14 years 1 months ago
New Approach for Selectively Convertible Undeniable Signature Schemes
In this paper, we propose a new approach for constructing selectively convertible undeniable signature schemes, and present two efficient schemes based on RSA. Our approach allows ...
Kaoru Kurosawa, Tsuyoshi Takagi