62 search results - page 3 / 13 » Non-Local Box Complexity and Secure Function Evaluation |
ASIACRYPT
2005
Springer
13 years 11 months ago
2005
Springer
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
ICSE
2005
IEEE-ACM
14 years 5 months ago
2005
IEEE-ACM
Some software defects trigger failures only when certain complex information flows occur within the software. Profiling and analyzing such flows therefore provides a potentially i...
STOC
2010
ACM
13 years 10 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...
CRYPTO
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. In this work, we introduce one-time programs, a new computational paradigm geared towards security applications. A one-time program can be executed on a single input, who...
ASIACRYPT
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...