Black-box transformations from passive to covert security with public verifiability
type: Item
instance of: scholarly article
title: Black-box transformations from passive to covert security with public verifiability
DOI: 10.1007/978-3-030-56880-1_23
author: Claudio Orlandi
author: Mark Simkin
author: Ivan B. Damgård
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 68N20
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7614583
MaRDI profile type: Publication
full work available at URL: 978-3-030-56880-1 23
OpenAlex ID: W3046593469
cites work: Perfect secure computation in two rounds
cites work: Two round information-theoretic MPC with malicious security
cites work: Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
cites work: Calling Out Cheaters: Covert Security with Public Verifiability
cites work: An O (log n ) expected rounds randomized byzantine generals protocol
cites work: Efficient Multiparty Protocols via Log-Depth Threshold Formulae
cites work: From Passive to Covert Security at Low Cost
cites work: Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
cites work: Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
cites work: Yet another compiler for active security or: efficient MPC over arbitrary rings
cites work: Multiparty Computation from Somewhat Homomorphic Encryption
cites work: How to construct constant-round zero-knowledge proof systems for NP
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: Efficient secure two-party protocols. Techniques and constructions
cites work: Player simulation and general adversary structures in perfect multiparty computation
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Q3549593
cites work: Founding Cryptography on Oblivious Transfer – Efficiently
cites work: Public Verifiability in the Covert Model (Almost) for Free
cites work: How to Simulate It – A Tutorial on the Simulation Proof Technique
cites work: The IPS Compiler: Optimizations, Variants and Concrete Efficiency
cites work: Covert two-party computation
description: scientific article; zbMATH DE number 7614583