Black-box transformations from passive to covert security with public verifiability

DOI10.1007/978-3-030-56880-1_23MaRDI QIDQ2096543zbMATH OpenOpenAlexFDO

Authors Claudio Orlandi, Mark Simkin, Ivan B. Damgård

Publication date 9 November 2022

Full work available at URL https://doi.org/10.1007/978-3-030-56880-1_23

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Efficient compiler to covert security with public verifiability for honest majority MPC
• Generic compiler for publicly verifiable covert multi-party computation
• Covert security with public verifiability: faster, leaner, and simpler
• From Passive to Covert Security at Low Cost
• Verifiable computation in multiparty protocols with honest majority

Cites work

• Advances in Cryptology - CRYPTO 2003
• An O (log n ) expected rounds randomized byzantine generals protocol
• Calling out cheaters: covert security with public verifiability
• Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
• Covert security with public verifiability: faster, leaner, and simpler
• Covert two-party computation
• Efficient multiparty protocols via log-depth threshold formulae. (Extended abstract)
• Efficient secure two-party protocols. Techniques and constructions
• Efficient Two Party and Multi Party Computation Against Covert Adversaries
• Founding Cryptography on Oblivious Transfer – Efficiently
• From Passive to Covert Security at Low Cost
• How to construct constant-round zero-knowledge proof systems for NP
• How to simulate it -- a tutorial on the simulation proof technique
• scientific article; zbMATH DE number 5485433 (Why is no real title available?)
• Multiparty Computation from Somewhat Homomorphic Encryption
• Perfect secure computation in two rounds
• Player simulation and general adversary structures in perfect multiparty computation
• Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
• Public verifiability in the covert model (almost) for free
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• The IPS compiler: optimizations, variants and concrete efficiency
• Two round information-theoretic MPC with malicious security
• Yet another compiler for active security or: efficient MPC over arbitrary rings

Cited in

(8)

• Generic compiler for publicly verifiable covert multi-party computation
• On publicly-accountable zero-knowledge and small shuffle arguments
• Efficient compiler to covert security with public verifiability for honest majority MPC
• Making private function evaluation safer, faster, and simpler
• Putting the online phase on a diet: covert security from short MACs
• Financially backed covert security
• Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead
• Zero-knowledge protocols with PVC security: striking the balance between security and efficiency

This page was built for publication: Black-box transformations from passive to covert security with public verifiability

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