2237 search results - page 339 / 448 » On the Security of Random Sources |
160
click to vote
TCC
2009
Springer
16 years 6 months ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
139
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
We introduce the novel concept of covert two-party computation. Whereas ordinary secure two-party computation only guarantees that no more knowledge is leaked about the inputs of t...
160
click to vote
ASIACRYPT
2009
Springer
16 years 1 days ago
2009
Springer
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
154
click to vote
AFRICACRYPT
2010
Springer
15 years 12 months ago
2010
Springer
Modern multi-user communication systems, including popular instant messaging tools, social network platforms, and cooperative-work applications, offer flexible forms of communica...
182
click to vote
IMC
2006
ACM
15 years 11 months ago
2006
ACM
In this paper we present the first implementation of a P2P content distribution system that uses Network Coding. Using results from live trials with several hundred nodes, we pro...