Sciweavers

321 search results - page 3 / 65
» Secure Multiparty Computation of Approximations
Sort
View
JOC
2007
84views more  JOC 2007»
15 years 2 months ago
Concurrent Composition of Secure Protocols in the Timing Model
In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their inputs. In the stand-alone case, it ha...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...
EUROCRYPT
1998
Springer
15 years 7 months ago
Quorum-Based Secure Multi-party Computation
Abstract. This paper describes e cient protocols for multi-party computations that are information-theoretically secure against passive attacks. The results presented here apply to...
Donald Beaver, Avishai Wool
CTRSA
2006
Springer
118views Cryptology» more  CTRSA 2006»
15 years 6 months ago
Stand-Alone and Setup-Free Verifiably Committed Signatures
Abstract. In this paper, we first demonstrate a gap between the security of verifiably committed signatures in the two-party setting and the security of verifiably committed signat...
Huafei Zhu, Feng Bao
TCC
2007
Springer
112views Cryptology» more  TCC 2007»
15 years 9 months ago
On the Necessity of Rewinding in Secure Multiparty Computation
We investigate whether security of multiparty computation in the information-theoretic setting implies their security under concurrent composition. We show that security in the sta...
Michael Backes, Jörn Müller-Quade, Domin...
CRYPTO
2006
Springer
232views Cryptology» more  CRYPTO 2006»
15 years 6 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