Enforcing input correctness via certification in garbled circuit evaluation
From MaRDI portal
Publication:2167732
DOI10.1007/978-3-319-66399-9_30zbMath1496.68149OpenAlexW2753005465MaRDI QIDQ2167732
Yihua Zhang, Fattaneh Bayatbabolghani, Marina Blanton
Publication date: 25 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-319-66399-9_30
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Networks and circuits as models of computation; circuit complexity (68Q06)
Related Items (2)
Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms ⋮ Improved signature schemes for secure multi-party computation with certified inputs
Cites Work
- Unnamed Item
- A proof of security of Yao's protocol for two-party computation
- Non-cooperative computation: Boolean functions with correctness and exclusivity
- Realizable Rational Multiparty Cryptographic Protocols
- On Garbling Schemes with and Without Privacy
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
- Multiparty Computation from Somewhat Homomorphic Encryption
- Two-Output Secure Computation with Malicious Adversaries
- Equilibrium Concepts for Rational Multiparty Computation
- Rational secret sharing and multiparty computation
- Private Intersection of Certified Sets
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Advances in Cryptology – CRYPTO 2004
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Revisiting the Efficiency of Malicious Two-Party Computation
- Public Key Cryptography - PKC 2006
This page was built for publication: Enforcing input correctness via certification in garbled circuit evaluation
