Secure multi-party computation minimizing online rounds

DOI10.1007/978-3-642-10366-7_16MaRDI QIDQ3650697zbMATH OpenOpenAlexFDO

Authors Seung Geol Choi, Ariel Elbaz, Tal Malkin, Moti Yung

Publication date 15 December 2009

Published in Advances in Cryptology – ASIACRYPT 2009 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10366-7_16

zbMATH Keywords

computing with encrypted datacryptographic protocolsmulti-party computationpublic key cryptographyuniversal composition

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Round-optimal secure multi-party computation
• Round-optimal secure multi-party computation
• Better preprocessing for secure multiparty computation
• Multiparty Computation from Somewhat Homomorphic Encryption
• Secure multiparty computation with minimal interaction

Cited in

(9)

• Two-round MPC: information-theoretic and black-box
• When it's all just too much: outsourcing MPC-preprocessing
• Commodity-based 2PC for arithmetic circuits
• Minimal-latency secure function evaluation
• Secure computation with minimal interaction, revisited
• Two-Party Computing with Encrypted Data
• scientific article; zbMATH DE number 7650400 (Why is no real title available?)
• Reusable secure computation in the plain model
• A unified framework for succinct garbling from homomorphic secret sharing

This page was built for publication: Secure multi-party computation minimizing online rounds

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