[PDF] Top 20 Efficient Bit-Decomposition and Modulus-Conversion Protocols with an Honest Majority

... Secure computation enables parties with inputs to compute a function on the inputs while keeping them secret. There are security notions that secure computation should satisfy, e.g., privacy, meaning the protocol reveals ... See full document

... our protocols for different numbers of parties on a series of circuits of different depths, each with 1,000,000 multiplication gates, 1,000 inputs wires, 50 output ... See full document

... also efficient and provides a gain of Θ(n) in the communication complexity per multiplication gate, over the AMPC protocol of Beerliov´a-Trub´ıniov´a et ... See full document

... the honest majority setting by proposing ways to switch between the three worlds efficiently, as well as efficient ways to do ...more efficient than SecureML, in large part due to the 3PC ... See full document

... Abstract. In this paper, we present two new and very communication- efficient protocols for maliciously secure multi-party computation over fields in the honest-majority setting with abort. ... See full document

... Comparison with SPDZ using homomorphic encryption. In very re- cent work [15], Keller, Pastro and Rotaru presented a new variant of the SPDZ protocol that improves upon the performance of MASCOT. In the two-party ... See full document

... where T is the total number of rounds of this conforming protocol. The pre- processing phase in [17] depends only on T , and is otherwise independent of Φ. We shall leverage this fact to construct protocols for ... See full document

... naive protocols whose bias is 1/2, the protocol still has a constant ...are honest, then, using general secure multiparty protocols, there are constant-round protocols with negligible bias ... See full document

... settings. Protocols for privacy-preserving data mining have considered semi-honest, malicious, and covert adversarial models in cryptographic settings, whereby an adversary is assumed to follow, arbitrarily ... See full document

... Honest Majority Setting. For honest majority protocols it is relatively easy to show that multiplications do require communication: we argue in the paper that any MGP secure against t ... See full document

... secure protocols that are both highly ...an honest majority that works for an arbitrary number of ...two protocols, run extensive experiments to measure their performance and report their ... See full document

... very efficient [39], and its deployments [11, 37, 60] include the largest SMC applications ever [6, ...the protocols that generate offline preshared ... See full document

... each bit is waited for the previous bit addition ...In efficient Ladner - Fischer adder, addition operation does not wait for previous bit addition operation and modification is done at gate ... See full document

... 10- bit mantissa fields as an embedding unit in order to conceal k bits of a secret message using an optimal base which produces the least pixel ...aggressive bit encoding and decomposition scheme is ... See full document

... Authentication Bit-Map Routing Protocol against Insider Security Threats in Wireless Ad Hoc Networks”, this paper discusses the insider threats in ...an efficient cryptographic routing protocol such as ... See full document

... bandwidth capacity in comparison with fixed networks. The used air interface has higher bit error rates, which aggravates the expected link quality. Current technologies suitable for the realization of WSNs are ... See full document

... We extend the above result in two directions. First, we completely characterize the Boolean functions that can be computed with fairness in the multiparty case, when the number of parties is constant and at most half of ... See full document

... The main thrust of this paper is to demonstrate how this protocol transfor- mation works and benefits two families of pairwise authentication protocols. They are password based authentication schemes of Section 3 ... See full document

... through bit replacement technology, which stores multi- ple copies of the same data that is to be hidden in a scrambled form in the cover ...a majority algorithm to find the closest twin of the embedded ... See full document

... Remark (on timely completion). Some contract signing protocols, such as the one in Asokan et al. [1998b], provide the feature that either party is able to definitively finish a transaction on its own (i.e., by ... See full document