Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead
From MaRDI portal
Publication:6595685
DOI10.1007/978-981-99-8721-4_9zbMATH Open1546.94088MaRDI QIDQ6595685
Jian Weng, Yi Liu, Xianrui Qin, Junzuo Lai, Qi Wang, Anjia Yang
Publication date: 30 August 2024
Cites Work
- Fast cut-and-choose-based protocols for malicious and covert adversaries
- Efficient secure two-party protocols. Techniques and constructions
- A proof of security of Yao's protocol for two-party computation
- New protocols for secure equality test and comparison
- How to construct constant-round zero-knowledge proof systems for NP
- Going beyond dual execution: MPC for functions with efficient verification
- Generic compiler for publicly verifiable covert multi-party computation
- Black-box transformations from passive to covert security with public verifiability
- Efficient compiler to covert security with public verifiability for honest majority MPC
- Security against covert adversaries: Efficient protocols for realistic adversaries
- Covert security with public verifiability: faster, leaner, and simpler
- Public Verifiability in the Covert Model (Almost) for Free
- Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose
- Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation
- From Passive to Covert Security at Low Cost
- Foundations of Cryptography
- Calling Out Cheaters: Covert Security with Public Verifiability
- Making Private Function Evaluation Safer, Faster, and Simpler
- Richer Efficiency/Security Trade-offs in 2PC
- Efficient Two Party and Multi Party Computation Against Covert Adversaries
- Public Key Cryptography - PKC 2006
- Financially backed covert security
- Towards practical homomorphic time-lock puzzles: applicability and verifiability
This page was built for publication: Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead
