Generic compiler for publicly verifiable covert multi-party computation

DOI10.1007/978-3-030-77886-6_27OpenAlexW3158918373MaRDI QIDQ2056768

David Kretzler, Carmit Hazay, Sebastian Faust, 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

multi-party computationpublic verifiabilitytime-lock puzzlescovert security

Mathematics Subject Classification ID

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

Related Items (5)

Making Private Function Evaluation Safer, Faster, and Simpler ⋮ Putting the online phase on a diet: covert security from short MACs ⋮ Financially backed covert security ⋮ Towards practical homomorphic time-lock puzzles: applicability and verifiability ⋮ Efficient compiler to covert security with public verifiability for honest majority MPC

Cites Work

• Unnamed Item
• A key-exchange system based on imaginary quadratic fields
• Verifiable delay functions
• Black-box transformations from passive to covert security with public verifiability
• The price of active security in cryptographic protocols
• Homomorphic time-lock puzzles and applications
• Covert security with public verifiability: faster, leaner, and simpler
• Public Verifiability in the Covert Model (Almost) for Free
• Time-Lock Puzzles from Randomized Encodings
• Secure Multi-Party Computation with Identifiable Abort
• Multiparty Computation from Somewhat Homomorphic Encryption
• Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
• Ciphers for MPC and FHE
• From Passive to Covert Security at Low Cost
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• Founding Cryptography on Oblivious Transfer – Efficiently
• Calling Out Cheaters: Covert Security with Public Verifiability
• Simple verifiable delay functions
• Time-Lock Puzzles in the Random Oracle Model
• The IPS Compiler: Optimizations, Variants and Concrete Efficiency
• Efficient Two Party and Multi Party Computation Against Covert Adversaries
• Efficient verifiable delay functions

This page was built for publication: Generic compiler for publicly verifiable covert multi-party computation