Information-Theoretic Secure Multi-Party Computation With Collusion Deterrence
نویسندگان
چکیده
منابع مشابه
Collusion Deterrence in Multi-Party Computation – An Evolutionary Game-Theoretic Approach
Many secure multiparty computation (SMC) protocols use Shamir’s Secret Sharing (SSS) scheme as a building block. A weakness of SSS is the possibility of collusion attacks among parties. Despite the shortcoming, SSS requires no data expansion and achieves information-theoretic security compared to other cryptographic SMC techniques such as garbled circuits. Moreover, it is much faster than other...
متن کاملEfficient Multi-party Computation with Information-theoretic Security
Multi-party computation (MPC) enables a set of n mutually distrusting players to perform some computation on their private inputs, such that the correctness of the output as well as the privacy of the honest players’ inputs is guaranteed even in the presence of an adversary corrupting up to t of the players and making them misbehave arbitrarily. In this thesis, we focus on the efficiency of mul...
متن کاملImproved Secure Two-Party Computation via Information-Theoretic Garbled Circuits
We optimize the communication (and, indirectly, computation) complexity of two-party secure function evaluation (SFE). We propose a new approach, which relies on the information-theoretic (IT) Garbled Circuit (GC), which is more efficient than Yao’s GC on shallow circuits. When evaluating a large circuit, we “slice” it into thin layers and evaluate them with IT GC. Motivated by the client-serve...
متن کاملUnconditionally Secure Multi-Party Computation
The most general type of multi-party computation involves n participants. Participant i supplies private data xi and obtains an output function fi(x1, . . . , xn). The computation is said to be unconditionally secure if each participant can verify, with probability arbitrarily close to one, that every other participant obtains arbitrarily little information beyond their agreed output fi. We giv...
متن کاملSecure Multi-Party Computation with Identifiable Abort
Protocols for secure multi-party computation (MPC) that resist a dishonest majority are susceptible to “denial of service” attacks, allowing even a single malicious party to force the protocol to abort. In this work, we initiate a systematic study of the more robust notion of security with identifiable abort, which leverages the effect of an abort by forcing, upon abort, at least one malicious ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Forensics and Security
سال: 2017
ISSN: 1556-6013,1556-6021
DOI: 10.1109/tifs.2016.2598533