Secure multiparty computation with general interaction patterns

DOI10.1145/2840728.2840760MaRDI QIDQ2800562zbMATH OpenOpenAlexFDO

Authors Shai Halevi, Yuval Ishai, Abhishek Jain, Eyal Kushilevitz, Tal Rabin

Publication date 15 April 2016

Published in Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2840728.2840760

zbMATH Keywords

secure multiparty computationobfuscationinteraction pattern

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Secure multiparty computation with minimal interaction
• Best possible information-theoretic MPC
• On the communication complexity of secure computation
• Perfectly-Secure MPC with Linear Communication Complexity
• On the message complexity of secure multiparty computation

Cited in

(21)

• Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors
• Multi-key and multi-input predicate encryption from learning with errors
• Oblivious transfer in incomplete networks
• Best possible information-theoretic MPC
• Topology-hiding computation beyond logarithmic diameter
• On the bottleneck complexity of MPC with correlated randomness
• Perfect MPC over layered graphs
• Succinct computational secret sharing for monotone circuits
• Succinct witness encryption for batch languages and applications
• Secured distributed algorithms without hardness assumptions
• Threshold garbled circuits and ad hoc secure computation
• Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions
• Topology-hiding computation on all graphs
• Secure multiparty computation of symmetric functions with polylogarithmic bottleneck complexity and correlated randomness
• Is information-theoretic topology-hiding computation possible?
• Efficient multiparty private simultaneous messages for symmetric functions
• Succinct computational secret sharing
• Must the communication graph of MPC protocols be an expander?
• General composition and universal composability in secure multiparty computation
• Blockchains enable non-interactive MPC
• Towards practical topology-hiding computation

This page was built for publication: Secure multiparty computation with general interaction patterns

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