876 search results - page 82 / 176 » Limits on the Usefulness of Random Oracles |
115
click to vote
ASIACRYPT
2008
Springer
15 years 2 months ago
2008
Springer
We study the security of the widely deployed Secure Session Layer/Transport Layer Security (TLS) key agreement protocol. Our analysis identifies, justifies, and exploits the modul...
120
Voted
ASIACRYPT
2010
Springer
14 years 10 months ago
2010
Springer
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
106
click to vote
SPIN
2009
Springer
15 years 7 months ago
2009
Springer
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
77
Voted
CP
2000
Springer
15 years 5 months ago
2000
Springer
We perform a comprehensive theoretical and empirical study of the benefits of singleton consistencies. Our theoretical results help place singleton consistencies within the hierar...
171
Voted
FOCS
1993
IEEE
15 years 4 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...