On the Power of Claw-Free Permutations (2002)
| Venue: | Proceedings of SCN 2002, volume 2576 of LNCS |
| Citations: | 17 - 5 self |
BibTeX
@INPROCEEDINGS{Dodis02onthe,
author = {Yevgeniy Dodis and Leonid Reyzin},
title = {On the Power of Claw-Free Permutations},
booktitle = {Proceedings of SCN 2002, volume 2576 of LNCS},
year = {2002},
pages = {55--73},
publisher = {SpringerVerlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 to be significantly better for special trapdoor permutations like RSA.
