Sciweavers

1399 search results - page 2 / 280
» Multi-party Finite Computations
Sort
View
IACR
2011
104views more  IACR 2011»
12 years 4 months ago
Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces
Protocols for generic secure multi-party computation (MPC) come in two forms: they either represent the function being computed as a boolean circuit, or as an arithmetic circuit o...
Seung Geol Choi, Kyung-Wook Hwang, Jonathan Katz, ...
FOCS
2003
IEEE
13 years 9 months ago
General Composition and Universal Composability in Secure Multi-Party Computation
Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting i...
Yehuda Lindell
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
13 years 8 months ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
DGO
2004
114views Education» more  DGO 2004»
13 years 6 months ago
Regression on Distributed Databases via Secure Multi-Party Computation
Alan F. Karr, Xiaodong Lin, Ashish P. Sanil, Jerom...