Calling Out Cheaters: Covert Security with Public Verifiability
From MaRDI portal
Publication:4911615
DOI10.1007/978-3-642-34961-4_41zbMath1292.94022OpenAlexW112739640MaRDI QIDQ4911615
Claudio Orlandi, Gilad Asharov
Publication date: 19 March 2013
Published in: Advances in Cryptology – ASIACRYPT 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-34961-4_41
Related Items (12)
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 ⋮ Putting the online phase on a diet: covert security from short MACs ⋮ Financially backed covert security ⋮ (Public) verifiability for composable protocols without adaptivity or zero-knowledge ⋮ Generic compiler for publicly verifiable covert multi-party computation ⋮ Towards accountability in CRS generation ⋮ On publicly-accountable zero-knowledge and small shuffle arguments ⋮ 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: Calling Out Cheaters: Covert Security with Public Verifiability
