876 search results - page 69 / 176 » Limits on the Usefulness of Random Oracles |
120
click to vote
EUROCRYPT
1999
Springer
15 years 5 months ago
1999
Springer
Since the Diffie-Hellman paper, asymmetric encryption has been a very important topic, and furthermore ever well studied. However, between the efficiency of RSA and the security of...
109
click to vote
ASIACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
Proofs of storage (PoS) are interactive protocols allowing a client to verify that a server faithfully stores a file. Previous work has shown that proofs of storage can be constru...
APPROX
2007
Springer
15 years 4 months ago
2007
Springer
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
121
Voted
ACNS
2004
Springer
15 years 4 months ago
2004
Springer
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...
102
Voted
EUROCRYPT
2004
Springer
15 years 4 months ago
2004
Springer
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...