Constant rounds almost linear complexity multi-party computation for prefix sum

DOI10.1007/978-3-319-06734-6_18MaRDI QIDQ4981774zbMATH OpenOpenAlexFDO

Authors Kazuma Ohara, Kazuo Ohta, Koutarou Suzuki, Kazuki Yoneyama

Publication date 24 June 2014

Published in Progress in Cryptology – AFRICACRYPT 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-06734-6_18

zbMATH Keywords

bit additionbit decompositionconstant roundmulti-party computationprefix sum

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient constant-round multi-party computation combining BMR and SPDZ
• Low cost constant round MPC combining BMR and oblivious transfer
• Efficient constant round multi-party computation combining BMR and SPDZ
• Round-optimal secure multi-party computation
• Perfectly-Secure MPC with Linear Communication Complexity

Cited in

(1)

• Generic constant-round oblivious sorting algorithm for MPC

This page was built for publication: Constant rounds almost linear complexity multi-party computation for prefix sum

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4981774)