Sciweavers

14 search results - page 2 / 3
» Secure Multiparty Computation with Partial Fairness
Sort
View
TCC
2010
Springer
169views Cryptology» more  TCC 2010»
14 years 2 months ago
On Complete Primitives for Fairness
Abstract. For secure two-party and multi-party computation with abort, classification of which primitives are complete has been extensively studied in the literature. However, for...
S. Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostr...
FOCS
2006
IEEE
14 years 2 days 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...
CORR
2010
Springer
110views Education» more  CORR 2010»
13 years 6 months ago
(Unconditional) Secure Multiparty Computation with Man-in-the-middle Attacks
In secure multi-party computation n parties jointly evaluate an n-variate function f in the presence of an adversary which can corrupt up till t parties. All honest parties are req...
Shailesh Vaya
ICPADS
2005
IEEE
13 years 11 months ago
An Adaptive Multiparty Protocol for Secure Data Protection
To better protect information systems, computation time data protection needs to be considered such that even when the system is partially compromised, the security of the system ...
Qingkai Ma, Liangliang Xiao, I-Ling Yen, Manghui T...
ESORICS
2010
Springer
13 years 7 months ago
Optimistic Fair Exchange with Multiple Arbiters
Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchang...
Alptekin Küpçü, Anna Lysyanskaya