Covert security with public verifiability: faster, leaner, and simpler
From MaRDI portal
Publication:2292689
DOI10.1007/978-3-030-17659-4_4OpenAlexW2908294075MaRDI QIDQ2292689
Wen-jie Lu, Vladimir Kolesnikov, Xiao Wang, Cheng Hong, Jonathan N. Katz
Publication date: 4 February 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-17659-4_4
Related Items (7)
MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK) ⋮ Making Private Function Evaluation Safer, Faster, and Simpler ⋮ Financially backed covert security ⋮ Generic compiler for publicly verifiable covert multi-party computation ⋮ Efficient constant-round MPC with identifiable abort and public verifiability ⋮ Black-box transformations from passive to covert security with public verifiability ⋮ Efficient compiler to covert security with public verifiability for honest majority MPC
This page was built for publication: Covert security with public verifiability: faster, leaner, and simpler
