223 search results - page 37 / 45 » Multivariates Polynomials for Hashing |
CSFW
2007
IEEE
15 years 3 months ago
2007
IEEE
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
SP
2006
IEEE
15 years 3 months ago
2006
IEEE
We present a new mechanized prover for secrecy properties of security protocols. In contrast to most previous provers, our tool does not rely on the Dolev-Yao model, but on the co...
CRYPTO
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. In 1998, Boneh, Durfee and Frankel [4] presented several attacks on RSA when an adversary knows a fraction of the secret key bits. The motivation for these so-called part...
CRYPTO
2007
Springer
15 years 3 months ago
2007
Springer
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}ā...
ECCC
2007
14 years 9 months ago
2007
The OR-SAT problem asks, given Boolean formulae Ļ1, . . . , Ļm each of size at most n, whether at least one of the Ļiās is satisļ¬able. We show that there is no reduction fr...