Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 360

The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.

More Efficient Constant-Round Multi-party Computation from BMR and SHE

Open access
Lindell, Yehuda, Smart, Nigel P., Soria-Vazquez, Eduardo · 2016 · Lecture Notes in Computer Science

Abstract

We present a multi-party computation protocol in the case of dishonest majority which has very low round complexity. Our protocol sits philosophically between Gentry's Fully Homomorphic Encryption based protocol and the SPDZ-BMR protocol of Lindell et al. CRYPTO 2015. Our protocol avoids various inefficiencies of the previous two protocols. Compared to Gentry's protocol we only require Somewhat Homomorphic Encryption SHE. Whilst in comparison to the SPDZ-BMR protocol we require only a quadratic complexity in the number of players as opposed to cubic, we have fewer rounds, and we require less proofs of correctness of ciphertexts. Additionally, we present a variant of our protocol which trades the depth of the garbling circuit computed using SHE for some more multiplications in the offline and online phases.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/978-3-662-53641-4_21

Cites

32 of 32 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 32 references

Cited by

See all 360

Metadata

Authors
Lindell, Y., Smart, N. P., & Soria-Vazquez, E.
Venue
Lecture Notes in Computer Science
Published
2016
Pages
554-581
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W2572799557
Cited by
360
References
32
FWCI
3.27
Type
conference paper
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: More Efficient Constant-Round Multi-party Computation from BMR and SHE. https://app.cochat.ai/papers/10.1007/978-3-662-53641-4_21
The paper
Lindell, Y., Smart, N. P., & Soria-Vazquez, E. (2016). More Efficient Constant-Round Multi-party Computation from BMR and SHE. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-662-53641-4_21

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.