10 search results - page 2 / 2 » How to Generalize RSA Cryptanalyses |
IACR
2011
12 years 5 months ago
2011
Zero knowledge sets (ZKS) [18] allow a party to commit to a secret set S and then to, non interactively, produce proofs for statements such as x ∈ S or x /∈ S. As recognized in...
ASIACRYPT
2009
Springer
14 years 17 hour ago
2009
Springer
At Eurocrypt 2009 Aggarwal and Maurer proved that breaking RSA is equivalent to factoring in the generic ring model. This model captures algorithms that may exploit the full algeb...
EUROCRYPT
2010
Springer
13 years 10 months ago
2010
Springer
We introduce the notion of adaptive trapdoor functions (ATDFs); roughly, ATDFs remain one-way even when the adversary is given access to an inversion oracle. Our main application ...
ASIACRYPT
2007
Springer
13 years 11 months ago
2007
Springer
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
CTRSA
2009
Springer
13 years 9 months ago
2009
Springer
In many applications, it is desirable to work with signatures that are both short, and yet where many messages from different signers be verified very quickly. RSA signatures sati...