Brief announcement: On secure m-party computation, commuting permutation systems and unassisted non-interactive MPC

DOI10.4230/LIPIcs.ICALP.2018.103zbMath1499.68111OpenAlexW2966865328MaRDI QIDQ5002786

Navneet Agarwal, Manoj Prabhakaran, Sanat Anand

Publication date: 28 July 2021

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/9107/pdf/LIPIcs-ICALP-2018-103.pdf

zbMATH Keywords

secure multi-party computationLatin hypercubecombinatorial characterizationpermutation hypercube complex

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Other designs, configurations (05B30)

Related Items (1)

Best possible information-theoretic MPC

Cites Work

• On privacy and partition arguments
• An efficient construction of non-interactive secure multiparty computation
• A minimal model for secure computation (extended abstract)
• Non-Interactive Secure Multiparty Computation
• Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations

This page was built for publication: Brief announcement: On secure m-party computation, commuting permutation systems and unassisted non-interactive MPC