Sciweavers

24 search results - page 1 / 5
» Information-Theoretic Conditions for Two-Party Secure Functi...
Sort
View
EUROCRYPT
2006
Springer
15 years 1 months ago
Information-Theoretic Conditions for Two-Party Secure Function Evaluation
The standard security definition of unconditional secure function evaluation, which is based on the ideal/real model paradigm, has the disadvantage of being overly complicated to w...
Claude Crépeau, George Savvides, Christian ...
91
Voted
ASIACRYPT
2004
Springer
15 years 3 months ago
Practical Two-Party Computation Based on the Conditional Gate
Abstract. We present new results in the framework of secure multiparty computation based on homomorphic threshold cryptosystems. We introduce the conditional gate as a special type...
Berry Schoenmakers, Pim Tuyls
98
Voted
ASIACRYPT
2005
Springer
15 years 3 months ago
Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
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...
Vladimir Kolesnikov
79
Voted
EUROCRYPT
2003
Springer
15 years 3 months ago
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
The recently proposed universally composable (UC) security framework for analyzing security of cryptographic protocols provides very strong security guarantees. In particular, a p...
Ran Canetti, Eyal Kushilevitz, Yehuda Lindell
100
Voted
TCC
2009
Springer
255views Cryptology» more  TCC 2009»
15 years 10 months ago
LEGO for Two-Party Secure Computation
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...
Jesper Buus Nielsen, Claudio Orlandi