Robust Publicly Verifiable Covert Security: Limited Information Leakage and Guaranteed Correctness with Low Overhead
- 18 December 2023
- book chapter
- Published by Springer Nature
- p. 272-301
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Fast Cut-and-Choose-Based Protocols for Malicious and Covert AdversariesJournal of Cryptology, 2015
- Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation2013
- Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose2013
- Calling Out Cheaters: Covert Security with Public Verifiability2012
- From Passive to Covert Security at Low Cost2010
- Security Against Covert Adversaries: Efficient Protocols for Realistic AdversariesJournal of Cryptology, 2009
- A Proof of Security of Yao’s Protocol for Two-Party ComputationJournal of Cryptology, 2008
- Efficient Two Party and Multi Party Computation Against Covert Adversaries2008
- Efficiency Tradeoffs for Malicious Two-Party Computation2006
- How to construct constant-round zero-knowledge proof systems for NPJournal of Cryptology, 1996