Sciweavers

Share
100 search results - page 1 / 20
» Improved Primitives for Secure Multiparty Integer Computatio...
Sort
View
SCN
2010
Springer
129views Communications» more  SCN 2010»
8 years 6 months ago
Improved Primitives for Secure Multiparty Integer Computation
We consider a collection of related multiparty computation protocols that provide core operations for secure integer and fixed-point computation. The higher-level protocols offer...
Octavian Catrina, Sebastiaan de Hoogh
CRYPTO
2001
Springer
97views Cryptology» more  CRYPTO 2001»
9 years 1 months ago
Minimal Complete Primitives for Secure Multi-party Computation
Abstract. The study of minimal cryptographic primitives needed to implement secure computation among two or more players is a fundamental question in cryptography. The issue of com...
Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Raf...
ASIACRYPT
2009
Springer
9 years 3 months ago
Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC ’96) and of Damg˚ard and Nielsen (Crypto ’00), ou...
Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, H...
WPES
2003
ACM
9 years 1 months ago
Leveraging the "Multi" in secure multi-party computation
Secure Multi-Party Computation enables parties with private data to collaboratively compute a global function of their private data, without revealing that data. The increase in s...
Jaideep Vaidya, Chris Clifton
IACR
2016
43views Biometrics» more  IACR 2016»
3 years 4 months ago
Constant-Round Asynchronous Multi-Party Computation
Secure multi-party computation (MPC) allows several mutually distrustful parties to securely compute a joint function of their inputs and exists in two main variants: In synchrono...
Sandro Coretti, Juan A. Garay, Martin Hirt, Vassil...
books