Public Verifiability in the Covert Model (Almost) for Free

DOI10.1007/978-3-662-48800-3_9zbMath1375.94140OpenAlexW2294478556MaRDI QIDQ2795972

Vladimir Kolesnikov, Alex J. Malozemoff

Publication date: 23 March 2016

Published in: Advances in Cryptology – ASIACRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48800-3_9

zbMATH Keywords

secure computationpublicly verifiable covert security

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

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 ⋮ Hashing Garbled Circuits for Free

This page was built for publication: Public Verifiability in the Covert Model (Almost) for Free