Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ
- Submitting institution
-
University of Bristol
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 94282941
- Type
- E - Conference contribution
- DOI
-
10.1007/978-3-662-48000-7_16
- Title of conference / published proceedings
- Advances in Cryptology - CRYPTO 2015
- First page
- 319
- Volume
- -
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- August
- Year of publication
- 2015
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
B - Cybersecurity and Cryptography
- Citation count
- 28
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This protocol awakened a long dormant field in low round complexity MPC protocols, as it uses a novel combination of SPDZ and BMR protocols; utilising different benefits of each. Further work by other teams [Lindell et al TCC 2016, Hazay et al ASIACRYPT 2017] led to large performance improvements. For example this work with the n-party TinyOT work (see other paper submitted to REF), led to the Hazay-Scholl-Soria-Vazquez protocol, which is now incorporated in the SCALE-MAMBA software and integrated into Jana database by Galois Inc, used in a number of trials by the US government (see MPC Impact Case study).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -