Sciweavers

Share
12 search results - page 1 / 3
» Secure Multiparty Quantum Computation with (Only) a Strict H...
Sort
View
FOCS
2006
IEEE
9 years 3 months ago
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
Secret sharing and multiparty computation (also called “secure function evaluation”) are fundamental primitives in modern cryptography, allowing a group of mutually distrustfu...
Michael Ben-Or, Claude Crépeau, Daniel Gott...
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
9 years 9 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
CRYPTO
2006
Springer
149views Cryptology» more  CRYPTO 2006»
9 years 28 days ago
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
In the setting of multiparty computation, a set of parties wish to jointly compute a function of their inputs, while preserving security in the case that some subset of them are co...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
9 years 9 months ago
Bounded-concurrent secure multi-party computation with a dishonest majority
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
Rafael Pass
TCC
2016
Springer
54views Cryptology» more  TCC 2016»
3 years 5 months ago
Characterization of Secure Multiparty Computation Without Broadcast
A major challenge in the study of cryptography is characterizing the necessary and sufficient assumptions required to carry out a given cryptographic task. The focus of this work ...
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
books