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 QIDQ6595685FDOQ6595685
Authors: Yi Liu, Junzuo Lai, Qi Wang, Xianrui Qin, Anjia Yang, Jian Weng 
Publication date: 30 August 2024
Recommendations
- Covert security with public verifiability: faster, leaner, and simpler
- Generic compiler for publicly verifiable covert multi-party computation
- Public verifiability in the covert model (almost) for free
- Calling out cheaters: covert security with public verifiability
- Black-box transformations from passive to covert security with public verifiability
Cites Work
- A proof of security of Yao's protocol for two-party computation
- How to construct constant-round zero-knowledge proof systems for NP
- Foundations of Cryptography
- Security against covert adversaries: Efficient protocols for realistic adversaries
- Efficient secure two-party computation using symmetric cut-and-choose
- Garbled circuits checking garbled circuits: more efficient and secure two-party computation
- Fast cut-and-choose-based protocols for malicious and covert adversaries
- Efficient secure two-party protocols. Techniques and constructions
- Public Key Cryptography - PKC 2006
- New protocols for secure equality test and comparison
- From Passive to Covert Security at Low Cost
- Efficient compiler to covert security with public verifiability for honest majority MPC
- Efficient Two Party and Multi Party Computation Against Covert Adversaries
- 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
- Covert security with public verifiability: faster, leaner, and simpler
- Public verifiability in the covert model (almost) for free
- Calling out cheaters: covert security with public verifiability
- Making private function evaluation safer, faster, and simpler
- Richer Efficiency/Security Trade-offs in 2PC
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595685)
