Efficient compiler to covert security with public verifiability for honest majority MPC

DOI10.1007/978-3-031-09234-3_33MaRDI QIDQ2096640zbMATH OpenOpenAlexFDO

Authors Thomas Attema, Vincent Dunning, Maarten Everts, Peter Langenkamp

Publication date 9 November 2022

Full work available at URL https://doi.org/10.1007/978-3-031-09234-3_33

zbMATH Keywords

compilercovert securityhonest majoritymulti-party computation

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Verifiable computation in multiparty protocols with honest majority
• Covert security with public verifiability: faster, leaner, and simpler
• From Passive to Covert Security at Low Cost
• Public verifiability in the covert model (almost) for free
• Efficient multiparty computation for arithmetic circuits against a covert majority

Cites work

• Black-box transformations from passive to covert security with public verifiability
• Calling out cheaters: covert security with public verifiability
• Covert security with public verifiability: faster, leaner, and simpler
• Efficient fully secure computation via distributed zero-knowledge proofs
• Efficient Two Party and Multi Party Computation Against Covert Adversaries
• From Passive to Covert Security at Low Cost
• Generic compiler for publicly verifiable covert multi-party computation
• Guaranteed output delivery comes free in honest majority MPC
• How to share a secret
• scientific article; zbMATH DE number 176564 (Why is no real title available?)
• scientific article; zbMATH DE number 1418293 (Why is no real title available?)
• Multiparty Computation from Somewhat Homomorphic Encryption
• Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
• Public verifiability in the covert model (almost) for free
• Publicly verifiable secret sharing
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries

Cited in

(9)

• Yet another compiler for active security or: efficient MPC over arbitrary rings
• Generic compiler for publicly verifiable covert multi-party computation
• Black-box transformations from passive to covert security with public verifiability
• Verifiable computation in multiparty protocols with honest majority
• The IPS compiler: optimizations, variants and concrete efficiency
• scientific article; zbMATH DE number 7774275 (Why is no real title available?)
• Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead
• Cheater identification on a budget: MPC with identifiable abort from pairwise MACs
• Zero-knowledge protocols with PVC security: striking the balance between security and efficiency

This page was built for publication: Efficient compiler to covert security with public verifiability for honest majority MPC

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