[PDF] Top 20 Non-Interactive Secure Multiparty Computation

... Applications. Our main motivating application is for scenarios involving secure computations without interaction, such as the one described above. While in the motivating discussion we assumed the parties to be ... See full document

... In [GS17], this idea was implemented by constructing a special purpose witness encryption [GGSW13, BH15, GOVW12, CDG + 17, DG17] using specific algebraic properties of non-interactive zero- knowledge (NIZK) ... See full document

... have non-unique values in the column used for joining (actually, the other may also contain non-unique values but in this case, for each set of rows with the same key, only one row, chosen uniformly ... See full document

... Asynchronous Secure Multiparty Computation (SQPSEASMC) model has been designed to reduce both storage and communication ...of multiparty quantum channels were represented in terms of ... See full document

... Input authentication. In the stateless hardware token model, an important desideratum is to prevent an adversary from gaining undue advantage by reset- ting the stateless token that it receives from the honest party. In ... See full document

... verifier’s computation and overall communication grows with poly(|x|, λ, log(T )), where λ is the security parameter and T is the verification time for checking that x ∈ L (given ...of ... See full document

... a multiparty interactive protocol between a single prover and multiple verifiers where the soundness and zero knowledge properties only hold when a majority of the parties are ... See full document

... Considering each partition as a small data set by itself, any existing solution for privacy preserving record matching can be applied to match the set of non-blocked partition pairs. In classical SMC protocols, ... See full document

... polynomials can be found in Figs. 4 and 5, summarized in Tables 4 and 5 respectively. We see that the polyno- mial solution was still slower, although all 32 processors on all three servers worked with 100% load during ... See full document

... maliciously secure two-party computation based on garbled circuits are often extremely ...highly non-trivial to modify these protocols and reason about what new security guarantees ... See full document

... a non-interactive delegation scheme (as also described in [BHK17]) is that the former only guarantees non-adaptive soundness, namely, soundness is guaranteed only if the prover first chooses the ... See full document

... efficient non-interactive proof systems based on bilinear groups ...either non-interactive witness indistinguishable (NIWI) or non-interactive zero-knowledge (NIZK) proofs for ... See full document

... We first focus on the very basic case of two parties with honest-but-curious corruptions. Even here there is a large gap between the best-known protocols and what is potentially possible: In the static case (where ... See full document

... In paper [4] authors proposed encrypted individual semi identifiers, such as, 1 st names, surnames, as well as date, place of birth are used. These semi identifiers are not one of a novel individual identifiers ... See full document

... are non interactive; an OTP corresponding to some function f, OTP-msg f given to a user by some environment (or user) U allows the user to evaluate f once on some input of its choice, with no further ... See full document

... possible secure implement, the receiver samples a random string r, and outputs r if the sender’s input is >, outputs x ⊕ r if the sender’s input is ...reusable non-interactive two- party ... See full document

... a secure computation that implements the algorithm and is run between any pair of people who suspect that they might be ...for secure computation requires the participants to coordinate a time ... See full document

... if the number of dishonest parties equals to or exceeds m/2 . To conclude this section, we briefly describe how PSMC protocols can be modified to handle malicious parties. There are two types of disruption: first, a ... See full document

... the computation along with the identities of the parties in the core ...a secure protocol implies agreement in the asynchronous setting, since the core set must be agreed upon as part of the protocol, and ... See full document

... There is a very large body of recent work about minimizing interaction in cryptography (mostly concentrating on the number of rounds, rather than the number of messages): whereas classical MPC results show that every ... See full document