[PDF] Top 20 Efficiently Making Secure Two-Party Computation Fair

... both secure and ...trusted party in the ideal world contacts with the real world TTP in their ideal world ...considered fair as well [6, 43]) and proves fairness and security according to this ... See full document

... Input Soldering For each input wire of the circuit, A solders onto these a number of wire authenticators. These authenticators ensure that the input keys B receives are in fact valid, since otherwise these authentica- ... See full document

... actively secure OT-extension protocol such as [ALSZ15, KOS15] would result in a protocol with privacy but not correctness ...be efficiently simulated), which is a meaningful notion of security in some ... See full document

... The next set of challenges deals with making the above plan to work with an obfuscation mechanism that only guarantees indistinguishability obfuscation. Here we follow the lead of Sahai and Waters [SW14] and use ... See full document

... multi- party garbling, making it compatible with some of the half-gate ...2- party case, the preprocessing defines some authenticated bits, and as a result all parties can locally compute additive ... See full document

... Yao’s two-party protocol [Yao86] and its multiparty variant [BMR90, ...any efficiently computable 2-party functionality, and the BMR protocol yields a computational MPRE of effective degree 3 ... See full document

... third party functionality in a secure ...any efficiently-computable functionality there exists an efficient protocol that emulates it, assuming that the majority of the participants is honest and ... See full document

... needs two of the parties to enact the role of the garbler and the remaining party to carry out the responsibility of circuit ...just two or three rounds, our protocols are built from the parallel ... See full document

... a secure two-party computation, two parties or players want to compute a particular function of their inputs while preserving specific security notions under certain adversar- ial ... See full document

... ad-hoc secure computation can be performed efficiently on mobile de- vices when aided by a trusted hardware ...is two orders of mag- nitude faster than that of other generic secure ... See full document

... a secure protocol that assumes an honest ...of two-party coin tossing in the standard model of secure computation, for which the impossibility of fair coin tossing is well known ... See full document

... in secure two-party and multiparty ...imply fair coin-tossing, and are thus ruled out by Cleve’s ...one party exerts more influence on the output compared to the other party, ... See full document

... propose two new optimistic multi-party fair exchange protocols that efficiently guarantee fairness in any exchange topology (including complete ...a party sends his item but in return ... See full document

... for making garbled circuits into a reactive SMC protocol requires additional, MAC operations inside the circuit ...for computation that is more efficiently evaluated using garbled circuits than ... See full document

... with fair termination mechanisms borrowing from ...Reactive secure computation. Reactive secure computation is an SFE which consists of several steps, where each step operates based on ... See full document

... is secure in the adaptive ...honest party protocol on behalf of the uncorrupted parties and forces the output to be a pre-chosen pseudorandom string allowing it to output the cycle in the graph ...no ... See full document

... present two two-party protocols for the problem of secure in- teger division: given Paillier encryptions of `-bit values n and d, compute an encryption of bn/dc without leaking any ... See full document

... the Secure Lock, Asynchronous Control Polynomial and our proposed scheme was developed on the Visual Studio 2010 platform using ...Key Computation and Derivation and the Group Membership Verification phases ... See full document

... We suppose that user join and leave events are independently and identically distributed in each attribute group in G following Poisson distribution. The membership duration time for an attribute is assumed to follow an ... See full document

... only secure against passive adversaries, who are trusted to strictly follow the ...actively secure protocols, which remain secure against arbitrary deviations from the protocol, typically most ... See full document