Generic compiler for publicly verifiable covert multi-party computation

DOI10.1007/978-3-030-77886-6_27MaRDI QIDQ2056768zbMATH OpenOpenAlexFDO

Authors Sebastian Faust, Carmit Hazay, David Kretzler, Benjamin Schlosser

Publication date 8 December 2021

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

zbMATH Keywords

covert securitymulti-party computationpublic verifiabilitytime-lock puzzles

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
• Covert security with public verifiability: faster, leaner, and simpler
• Black-box transformations from passive to covert security with public verifiability
• Public verifiability in the covert model (almost) for free
• Calling out cheaters: covert security with public verifiability

Cites work

• A key-exchange system based on imaginary quadratic fields
• Black-box transformations from passive to covert security with public verifiability
• Calling out cheaters: covert security with public verifiability
• Ciphers for MPC and FHE
• Covert security with public verifiability: faster, leaner, and simpler
• Efficient Two Party and Multi Party Computation Against Covert Adversaries
• Efficient verifiable delay functions
• Founding Cryptography on Oblivious Transfer – Efficiently
• From Passive to Covert Security at Low Cost
• Homomorphic time-lock puzzles and applications
• scientific article; zbMATH DE number 176564 (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
• Secure multi-party computation with identifiable abort
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• Simple verifiable delay functions
• The IPS compiler: optimizations, variants and concrete efficiency
• The price of active security in cryptographic protocols
• Time-lock puzzles from randomized encodings
• Time-lock puzzles in the random oracle model
• Verifiable delay functions

Cited in

(11)

• Black-box transformations from passive to covert security with public verifiability
• Efficient compiler to covert security with public verifiability for honest majority MPC
• Generic Compilers for Authenticated Key Exchange
• Making private function evaluation safer, faster, and simpler
• Putting the online phase on a diet: covert security from short MACs
• scientific article; zbMATH DE number 7774275 (Why is no real title available?)
• Financially backed covert security
• Towards practical homomorphic time-lock puzzles: applicability and verifiability
• 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: Generic compiler for publicly verifiable covert multi-party computation

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