[PDF] Top 20 TinyKeys: A New Approach to Efficient Multi-Party Computation

... The second half of the table shows the size of the garbled circuit in terms of the total number of AND, XOR and splitter gates. Garbled circuit size only has a slight impact on communication complexity, when opening the ... See full document

... Functional cryptography: Functional dependencies in general were, until now, only available for primitives required to be either hiding, i.e. functional encryp- tion, or binding, i.e. functional signatures. Our notion of ... See full document

... more efficient to tailor the protocol to this structure, rather than try to shoe-horn the application into a more standard ...a computation can be performed in a full-threshold setting and then the outputs ... See full document

... We study unconditionally secure MPC protocols in the presence of a passive adversary in the trusted setup (‘semi-ideal’) model, in which the participants are supplied with some auxiliary information (which is random and ... See full document

... the approach proposed in this paper does not consider distribution of any keys rather considers some pre decided prime integers required for key generation in commutative RSA as the only common attribute amongst ... See full document

... a new technique for the setting with general adver- saries, we introduce group commitments, a non-trivial extension of IC-Signatures, which might be of independent ... See full document

... The mobile commerce users often consider fixed line Internet experience as benchmark with m-payment applications in terms of mobile telecommunications standards, standard pricing structures and competitive intelligence. ... See full document

... Secure multi-party computation (MPC) allows multiple par- ties to compute a known function over inputs held by each party, without any party having to reveal its private ...propose ... See full document

... a new protocol for fair and robust secure MPC with ...honest party does ...no party receives output however the honest parties have wasted resources by introducing transactions in the ...the ... See full document

... every party receives its output, or the protocol aborts, in which case all honest parties learn that the protocol ...every party learns the identity of some corrupted ...this approach leads to ... See full document

... very efficient, as they require O(poly(n)) bits of communication per multiplication gate where n is number of parties, and the polynomial is relatively small, and these protocols also avoid cryptographic ... See full document

... Using this three-round multiplication subprotocol, Ananth et al. constructed a four-round protocol for the semi-honest model, then enforced correctness in the third and fourth rounds using zero-knowledge proofs to get ... See full document

... More concretely, LSS enables parties to divide secrets to multiple shares where any unqualified set of shares does not reveal information about the secret. Each share is given to a different party. Homomorphic ... See full document

... more efficient than executing m instances of an OT ...secure multi-party computation [GMW87,Gol04], and a bit-OT protocol with O(1) communication complexity implies secure computation ... See full document

... 4. Lastly, unlike the TinyOLE scheme [7], our scheme is scalable, in that it extends to the multi-party case with n participants. In fact, computing n shares (one for each participant) to a single ... See full document

... Quantum everlasting universal composability. The preceding paragraph shows that, in the setting of everlasting security, it is vital to find definitions that guarantee composability. One salient approach is the ... See full document

... less efficient than thresh- old protocols; more specifically, threshold protocols usually communicate Poly(n) bits per multiplication, whereas general-adversary protocols require Poly(|Z|) ... See full document

... Adversarial Model: When there is a dispute between the parties, the TTP resolves the conflict atomically, dealing with one party at a time until that resolution protocol is finished. The communication channel is ... See full document

... propose new strategies and a suite of algorithms for hiding sensitive knowledge from data by minimally perturbing their ...inserting new items depending on the hiding ...computationally efficient, ... See full document

... one party and a different value v 0 6= v to another ...secure computation with abort [15] (and even UC ...every party P i sends (echoes) the value that ... See full document