High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority

Furukawa, Yoshihiro; Lindell, Yehuda; Nof, Ariel; Weinstein, Or

doi:10.1007/978-3-319-56614-6_8

Cited by 113 publications

(106 citation statements)

References 20 publications

Supporting

Mentioning

101

Contrasting

Order By: Relevance

“…In [21], the time to produce a multiplication triple for p ≈ 2 64 is estimated as 2ms for covert security and 6ms for fully malicious security (with two parties, with η = 40). We presume that the cost is smaller for smaller p, but for p ≈ 2 32 , it should not be more than twice as fast. On the other hand, the increase of η to 80 would double the costs [21].…”

Section: Complexity Of Actively Secure Integer Multiplication and Aesmentioning

confidence: 93%

“…For honest majority and three parties, a recent method [32] proposes the use of a highly efficient passively secure protocol for precomputing multiplication triples. Again, this method only allows the detection of misbehaviour, but no identification of the guilty party.…”

Section: Related Workmentioning

confidence: 99%

“…The check is based on cut-and-choose and pairwise check, similarly to e.g. [24,32]. The check is probabilistic, and it depends on parameters µ and κ.…”

Section: Protocol Implementing F Prementioning

confidence: 99%

See 2 more Smart Citations

Preprocessing Based Verification of Multiparty Protocols with Honest Majority

Laud

Pankova

Jagomägis

2017

Proceedings on Privacy Enhancing Technologies

View full text Add to dashboard Cite

This paper presents a generic "GMW-style" method for turning passively secure protocols into protocols secure against covert attacks, adding relatively cheap offline preprocessing and post-execution verification phases. Our construction performs best with a small number of parties, and its main benefit is the total cost of the online and the offline phases. In the preprocessing phase, each party generates and shares a sufficient amount of verified multiplication triples that will be later used to assist that party's proof. The execution phase, after which the computed result is already available to the parties, has only negligible overhead that comes from signatures on sent messages. In the postprocessing phase, the verifiers repeat the computation of the prover in secret-shared manner, checking that they obtain the same messages that the prover sent out during execution. The verification preserves the privacy guarantees of the original protocol. It is applicable to protocols doing computations over finite rings, even if the same protocol performs its computation over several distinct rings. We apply our verification method to the Sharemind platform for secure multiparty computations (SMC), evaluate its performance and compare it to other existing SMC platforms offering security against stronger than passive attackers.

show abstract

Section: Complexity Of Actively Secure Integer Multiplication and Aesmentioning

confidence: 93%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Preprocessing Based Verification of Multiparty Protocols with Honest Majority

Laud

Pankova

Jagomägis

2017

Proceedings on Privacy Enhancing Technologies

View full text Add to dashboard Cite

show abstract

“…Our protocol is MPC-agnostic, meaning that it does not depend on the solution that implements the MPC functionality; example protocols that could be executed within our protocol are SPDZ [16] or MASCOT [32]. However, the three-party protocol for Boolean circuits that was introduced by Araki et al [3,23] is fairly suited for our current needs, given its performance and threshold properties. Hence, we use this protocol in our simulation.…”

Section: Cryptographic Building Blocksmentioning

confidence: 99%

“…The scheme provides threshold security against semi-honest and malicious parties. Note that Furukawa et al [23] further adapt the protocol to provide security against a malicious adversary.…”

Section: Cryptographic Building Blocksmentioning

confidence: 99%

SePCAR: A Secure and Privacy-Enhancing Protocol for Car Access Provision

Symeonidis

Aly

Mustafa

et al. 2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present an efficient secure and privacy-enhancing protocol for car access provision, named SePCAR. The protocol is fully decentralised and allows users to share their cars conveniently without sacrifising their security and privacy. It provides generation, update, revocation, and distribution mechanisms for access tokens to shared cars, as well as procedures to solve disputes and to deal with law enforcement requests, for instance in the case of car incidents. We prove that SeP-CAR meets its appropriate security and privacy requirements and that it is efficient: our practical efficiency analysis through a proof-of-concept implementation shows that SePCAR takes only 1.55 seconds for a car access provision.

show abstract