172 search results - page 8 / 35 » Black-Box Constructions of Protocols for Secure Computation |
STOC
2007
ACM
14 years 8 months ago
2007
ACM
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
The first and still most popular solution for secure two-party computation relies on Yao's garbled circuits. Unfortunately, Yao's construction provide security only again...
EUROCRYPT
2007
Springer
13 years 11 months ago
2007
Springer
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
SAC
2002
ACM
13 years 7 months ago
2002
ACM
We describe a resource discovery and communication system designed for security and privacy. All objects in the system, e.g., appliances, wearable gadgets, software agents, and us...