Best possible information-theoretic MPC

DOI10.1007/978-3-030-03810-6_10zbMath1430.94073OpenAlexW2899396211MaRDI QIDQ1631330

Shai Halevi, Tal Rabin, Yuval Ishai, Eyal Kushilevitz

Publication date: 6 December 2018

Full work available at URL: https://doi.org/10.1007/978-3-030-03810-6_10

zbMATH Keywords

information-theoretic securitysecure multiparty computation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Related Items (5)

Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions ⋮ On the Bottleneck Complexity of MPC with Correlated Randomness ⋮ Additive randomized encodings and their applications ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ MPC with friends and foes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• On hiding information from an oracle
• Efficient circuit-based PSI via cuckoo hashing
• Robust non-interactive multiparty computation against constant-size collusion
• Non-interactive multiparty computation without correlated randomness
• Player simulation and general adversary structures in perfect multiparty computation
• Secure Multiparty Computation with General Interaction Patterns
• A minimal model for secure computation (extended abstract)
• Non-Interactive Secure Multiparty Computation
• Black-box constructions for secure computation
• Graceful Degradation in Multi-Party Computation (Extended Abstract)
• On Best-Possible Obfuscation
• Foundations of Cryptography
• Brief announcement: On secure m-party computation, commuting permutation systems and unassisted non-interactive MPC
• Secure Computation on the Web: Computing without Simultaneous Interaction
• Advances in Cryptology - CRYPTO 2003
• Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
• Theory of Cryptography
• A Zero-One Law for Boolean Privacy
• Scalable Secure Multiparty Computation

This page was built for publication: Best possible information-theoretic MPC