Secure Multiparty Computation with General Interaction Patterns
From MaRDI portal
Publication:2800562
DOI10.1145/2840728.2840760zbMath1334.94081OpenAlexW2295674567MaRDI QIDQ2800562
Eyal Kushilevitz, Abhishek Jain, Shai Halevi, Yuval Ishai, 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
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (13)
Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions ⋮ Oblivious transfer in incomplete networks ⋮ Best possible information-theoretic MPC ⋮ On the Bottleneck Complexity of MPC with Correlated Randomness ⋮ Is information-theoretic topology-hiding computation possible? ⋮ Multi-key and multi-input predicate encryption from learning with errors ⋮ Towards practical topology-hiding computation ⋮ Perfect MPC over layered graphs ⋮ Blockchains enable non-interactive MPC ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Topology-hiding computation on all graphs ⋮ Threshold garbled circuits and ad hoc secure computation ⋮ Topology-Hiding Computation Beyond Logarithmic Diameter
This page was built for publication: Secure Multiparty Computation with General Interaction Patterns
