Sciweavers

24 search results - page 1 / 5
» Quorum-Based Secure Multi-party Computation
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, ...
IACR
2011
111views more  IACR 2011»
12 years 4 months ago
Secure Multi-Party Sorting and Applications
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
Kristján Valur Jónsson, Gunnar Kreit...
FSTTCS
2010
Springer
13 years 2 months ago
Computationally Sound Abstraction and Verification of Secure Multi-Party Computations
ionally Sound Abstraction and Verification of Secure Multi-Party Computations Michael Backes Saarland University MPI-SWS Matteo Maffei Saarland University Esfandiar Mohammadi Saarl...
Michael Backes, Matteo Maffei, Esfandiar Mohammadi
CRYPTO
2006
Springer
232views Cryptology» more  CRYPTO 2006»
13 years 8 months ago
Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
Abstract. We introduce algebraic geometric techniques in secret sharing and in secure multi-party computation (MPC) in particular. The main result is a linear secret sharing scheme...
Hao Chen, Ronald Cramer
FOCS
2003
IEEE
13 years 10 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