172 search results - page 2 / 35 » Black-Box Constructions of Protocols for Secure Computation |
FSE
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In this paper, we propose a 2/3-rate double length compression function and study its security in the black-box model. We prove that to get a collision attack for the com...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veri�...
CCS
2008
ACM
13 years 6 months ago
2008
ACM
We describe the design and implementation of Privacy Oracle, a system that reports on application leaks of user information via the network traffic that they send. Privacy Oracle ...
STOC
2010
ACM
13 years 9 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
ESOP
2005
Springer
13 years 10 months ago
2005
Springer
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...