[PDF] Top 20 SPDZ2k: Efficient MPC mod 2^k for Dishonest Majority
Has 10000 "SPDZ2k: Efficient MPC mod 2^k for Dishonest Majority" found on our website. Below are the top 20 most common "SPDZ2k: Efficient MPC mod 2^k for Dishonest Majority".
SPDZ2k: Efficient MPC mod 2^k for Dishonest Majority
... 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
38
Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT)
... a dishonest majority is far more difficult due to scalability challenges regarding the number of ...most efficient practical protocol with active security has a multiplicative factor of O(λ/ log |C|) ... See full document
30
Communication-Efficient Proactive Secret Sharing for Dynamic Groups with Dishonest Majorities
... proactive MPC (PMPC) pro- ...a majority of the parties are compromised, even if the compromise is only ...n 2 , thus only an adversary compromising d + 1 parties can re- cover the secret (by ...a ... See full document
53
Insured MPC: Efficient Secure Computation with Financial Penalties
... a dishonest majority. Pre- vious works have proposed combining MPC protocols with Cryptocur- rencies in order to financially punish aborting adversaries, providing an incentive for parties to ... See full document
63
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries
... Our protocol works by running multiple circuit computations in parallel: one that computes the circuit over the real inputs and others which compute the circuit over randomized inputs. The outputs of the randomized ... See full document
31
A novel majority gate approach for implementing efficient qca comparator
... As it is well known that the number of cascaded MGs within the worst computational path of a QCA design directly affects the delay achieved. In fact, each MG introduces one clock phase in the overall delay. From Fig.1 , ... See full document
8
Multiparty Proximity Testing with Dishonest Majority from Equality Testing
... highly efficient: in their synchronous scheme Alice performs only three modular exponen- tiations, and Bob only two, and in their trusted-server (asynchronous) scheme the parties per- form several additions and ... See full document
23
Efficient Bit-Decomposition and Modulus-Conversion Protocols with an Honest Majority
... controlling k − 1 < n 2 parties, if for every non-uniform probabilistic polynomial-time adversary A in the real world, there exists a non-uniform probabilistic polynomial-time simulator/adversary S in ... See full document
19
Information-Theoretic Broadcast with Dishonest Majority for Long Messages
... with Dishonest Majority Unlike when the number of corrupted parties t < n/3, it has been shown that broadcast for t < n cannot be achieved in the plain model ...Ω(n 2 ) on the number of ... See full document
17
Adaptively Secure Multi-Party Computation with Dishonest Majority
... a 2-party adaptively secure protocol fails to guarantee security when executed in the setting of n-parties, even if only two of the parties are ever talking to each ...the 2-party adaptively secure ... See full document
26
Asynchronous MPC with a Strict Honest Majority Using Non-equivocation
... An efficient ACS protocol with expected communication com- plexity of O(n 3 κ) bits can be obtained by using the Neq mechanism in the multi-valued ABA of ... See full document
35
An Efficient Passive-to-Active Compiler for Honest-Majority MPC over Rings
... honest majority setting is based on [5], but since they aim for guaranteed output delivery, their techniques are quite complex and the concrete efficiency is not so ...Z 2 k but in a Galois ring ... See full document
44
Practical Covertly Secure MPC for Dishonest Majority or: Breaking the SPDZ Limits
... on MPC focused on the case of protocols secure against passive adversaries, both in the case of two-party protocols based on Yao circuits [19] and that of many-party protocols, based on secret sharing techniques ... See full document
45
Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol
... a dishonest majority of active adver- ...prior MPC work in this area due to the use of MACs within the SPDZ ...size 2 8 and one based on embedding the AES field into a larger finite field of ... See full document
18
Round and Communication Efficient Unconditionally-secure MPC with $t
... security, [18] works with t < ( 1 3 −)n and provides perfect security, where > 0. These protocols also evaluate the underlying circuit in a secret-shared fashion. However, instead of Shamir secret-sharing, they use ... See full document
30
Statistical Properties of Multiplication mod $2^n$
... According to Definition 2, a parametric function is called invertible if and only if it is invertible for any values of parameter variables. In verifying the invertibility of T-functions, it is better to have a ... See full document
12
Computing Mod Without Mod
... Abstract. Encryption algorithms are designed to be difficult to break without knowledge of the secrets or keys. To achieve this, the algorithms require the keys to be large, with some algorithms having a recommend size ... See full document
18
k-Round MPC from k-Round OT via Garbled Interactive Circuits
... our 2-round MPC protocols with such an equivocal functional commitment scheme , and other primitives that are semi-maliciously secure ...multi-round MPC protocol, and 2-round OT protocol), ... See full document
88
Efficient Decoding Using Majority Gate Naveenraj.M 1, Aishwarya.E.J2
... Codes exist which are capable of correcting large number of random errors. Such codes are rarely used in practical data transmission systems ,however, because the equipments necessary to realize their capabilities, that ... See full document
5
Online rating malicious user identification and calculating original score using detective TATA
... We define users who provide ratings during the detected change intervals as suspicious users. Not all suspicious users are malicious users because normal users may occasionally provide “biased ratings” due to personal ... See full document
5
Related subjects