Yevgeniy Dodis, Leonid Reyzin  Home/Search
Context Related
| iacr.org/2002/103.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/curr/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Probabilistic Signature Scheme (PSS), Full Domain Hash (FDH) and several of their variants are widely used signature schemes, which can be formally analyzed in the random oracle model. These schemes output a signature of the form , where y somehow depends on the message signed (and pub) and f is some public trapdoor permutation (typically RSA). Interestingly, all these signature schemes can be proven asymptotically secure for an arbitrary trapdoor permutation f, but their exact security seems... (Update)
Cited by: More
Optimal Asymmetric Encryption and Signature Paddings - Chevallier-Mames, al. (2005) (Correct)
Minimal Assumptions for Efficient Mercurial Commitments - Dodis (2005) (Correct)
Strong Key-Insulated Signature Schemes - Dodis, Katz, Xu, Yung (2002) (Correct)
Active bibliography (related documents): More All
0.8: Forward-Secure Signatures with Optimal Signing and Verifying - Itkis, Reyzin (2001) (Correct)
0.5: On the Impossibilities of Basing One-Way Permutations on.. - Chang, Hsiao (Correct)
0.4: Hash Functions: From Merkle-Damgård to Shoup - Mironov (Correct)
Similar documents based on text: More All
1.0: The Exact Security of Digital Signatures - How to Sign with.. - Bellare, Rogaway (1996) (Correct)
0.9: Certifying Permutations: Non-Interactive Zero-Knowledge Based on.. - Bellare (1996) (Correct)
0.8: How to Sign Given Any Trapdoor Permutation - Bellare, Micali (1992) (Correct)
Related documents from co-citation: More All
8: A Digital Signature Scheme Secure Against Adaptive Chosen Message Attack - Goldwasser, Micali et al. - 1988
6: The exact security of digital signatures---how to sign with RSA and Rabin - Bellare, Rogaway - 1996
4: Efficient Signature Generation by Smart Cards (context) - Schnorr - 1991
BibTeX entry: (Update)
Y. Dodis and L. Reyzin. On the Power of Claw-Free Permutations. SCN 2002. http://citeseer.ist.psu.edu/dodis02power.html More
@misc{ dodis02power,
author = "Y. Dodis and L. Reyzin",
title = "On the Power of Claw-Free Permutations",
note = "SCN 2002",
year = "2002",
url = "citeseer.ist.psu.edu/dodis02power.html" }
Citations (may not include all citations):659 Random oracles are practical: A paradigm for designing ecien.. - Bellare, Rogaway - 1993
501 A digital signature scheme secure against adaptive chosen-me.. - Goldwasser, Micali et al. - 1988
411 How to prove yourself: Practical solutions to identi cation .. - Fiat, Shamir - 1986
246 The exact security of digital signatures: How to sign with R.. - Bellare, Rogaway - 1996
208 Universal one-way hash functions and their cryptographic app.. - Naor, Yung
162 Public-key cryptosystems based on composite degree residuosi.. - Paillier - 1999
95 Limits on the provable consequences of one-way permutations - Impagliazzo, Rudich
53 One-way functions are necessary and sucient for secure signa.. (context) - Rompel - 1990
31 How to sign given any trapdoor function (context) - Bellare, Micali
30 Fast signature generation with a Fiat Shamir-like scheme - Ong, Schnorr - 1990
29 Finding collisions on a one-way street: Can secure hash func.. (context) - Simon - 1998
18 Chameleon signatures (context) - Krawczyk, Rabin - 2000
17 Optimal security proofs for PSS and other signature schemes - ebastian - 2002
12 Collision-free hash functions and public-key signature schem.. (context) - Damg - 1987
8 the impossibility of basing trapdoor functions on trapdoor p.. (context) - Gertner, Malkin et al. - 2001
8 Lower bounds on the eciency of generic cryptographic constru.. (context) - Gennaro, Trevisan - 2000
8 A secure and ecient digital signature algorithm (context) - Micali - 1994
7 Improving the exact security of digital signature schemes - Micali, Reyzin - 2002
6 indentity-based signature scheme resulting from zero-knowled.. (context) - Guillou, Quisquater et al.
4 Limits on the eciency of one-way permutation-based hash func.. (context) - Kim, Simon et al. - 1999
3 the exact security of full domain hash (context) - ebastian, On - 2000
2 volume 403 of Lecture Notes in Computer Science (context) - Goldwasser, in et al. - 1988
1 Bounds on the eciency of encryption and digital signatures (context) - Gennaro, Gertner et al. - 2002
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://eprint.iacr.org/curr/): More
Cryptanalysis of Stream Cipher COS (2, 128) Mode I - Wu, Bao (2002) (Correct)
Tree-based Group Key Agreement - Kim, Perrig, Tsudik (2002) (Correct)
Generic Lower Bounds for Root Extraction and Signature.. - Damgård, Koprowski (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC