On actively-secure elementary MPC reductions

DOI10.1007/978-3-030-90459-3_24MaRDI QIDQ2695655zbMATH OpenOpenAlexFDO

Authors Benny Applebaum, Aarushi Goel

Publication date 31 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-90459-3_24

zbMATH Keywords

constant-degree non-cryptographic functionalityconstant-round protocol

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Fully-secure MPC with minimal trust
• The price of active security in cryptographic protocols
• On fully secure MPC with solitary output
• Secure multiparty computation with minimal interaction
• Secure protocol transformations

Cites work

• scientific article; zbMATH DE number 3856987 (Why is no real title available?)
• scientific article; zbMATH DE number 2013820 (Why is no real title available?)
• scientific article; zbMATH DE number 2086626 (Why is no real title available?)
• scientific article; zbMATH DE number 4185033 (Why is no real title available?)
• Advances in Cryptology - EUROCRYPT 2004
• An optimally fair coin toss
• Complete fairness in secure two-party computation
• Computationally private randomizing polynomials and their applications
• Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
• Cryptography in constant parallel time
• Degree 2 is complete for the round-complexity of malicious MPC
• Efficient constant-round MPC with identifiable abort and public verifiability
• Foundations of Cryptography
• Founding Cryptography on Oblivious Transfer – Efficiently
• Garbled circuits as randomized encodings of functions: a primer
• How to share a secret
• Limits of random oracles in secure computation (extended abstract)
• Limits on the Usefulness of Random Oracles
• Low cost constant round MPC combining BMR and oblivious transfer
• Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
• On complete primitives for fairness
• Perfect secure computation in two rounds
• Round-optimal secure multiparty computation with honest majority
• Secure multi-party computation with identifiable abort
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• Separating two-round secure computation from oblivious transfer
• Some open problems in information-theoretic cryptography
• Two round information-theoretic MPC with malicious security
• Two-round MPC: information-theoretic and black-box
• Two-round multiparty secure computation from minimal assumptions
• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits

Cited in

(3)

• Secure computation with parallel calls to 2-ary functions
• Yet another compiler for active security or: efficient MPC over arbitrary rings
• Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)

This page was built for publication: On actively-secure elementary MPC reductions

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