Generic compiler for publicly verifiable covert multi-party computation
type: Item
instance of: scholarly article
title: Generic compiler for publicly verifiable covert multi-party computation
DOI: 10.1007/978-3-030-77886-6_27
author: Sebastian Faust
author: Carmit Hazay
author: David Kretzler
author: Benjamin Schlosser
publication date: 2021-12-08T00:00:00Z
Mathematics Subject Classification ID: 68N20
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7440627
zbMATH Keywords: covert security
zbMATH Keywords: multi-party computation
zbMATH Keywords: public verifiability
zbMATH Keywords: time-lock puzzles
MaRDI profile type: Publication
full work available at URL: 978-3-030-77886-6 27
OpenAlex ID: W3158918373
cites work: Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
cites work: Calling Out Cheaters: Covert Security with Public Verifiability
cites work: Ciphers for MPC and FHE
cites work: Verifiable delay functions
cites work: Q4035736
cites work: Time-lock puzzles from randomized encodings
cites work: A key-exchange system based on imaginary quadratic fields
cites work: From Passive to Covert Security at Low Cost
cites work: Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
cites work: Black-box transformations from passive to covert security with public verifiability
cites work: Multiparty Computation from Somewhat Homomorphic Encryption
cites work: Efficient Two Party and Multi Party Computation Against Covert Adversaries
cites work: Covert security with public verifiability: faster, leaner, and simpler
cites work: The price of active security in cryptographic protocols
cites work: Secure Multi-Party Computation with Identifiable Abort
cites work: Founding Cryptography on Oblivious Transfer – Efficiently
cites work: Public Verifiability in the Covert Model (Almost) for Free
cites work: The IPS Compiler: Optimizations, Variants and Concrete Efficiency
cites work: Time-Lock Puzzles in the Random Oracle Model
cites work: Homomorphic time-lock puzzles and applications
cites work: Simple verifiable delay functions
cites work: Efficient verifiable delay functions
description: scientific article; zbMATH DE number 7440627