On Garbling Schemes with and Without Privacy

DOI10.1007/978-3-319-44618-9_25zbMath1478.68088OpenAlexW2514555123MaRDI QIDQ2827734

Carsten Baum

Publication date: 21 October 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44618-9_25

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Networks and circuits as models of computation; circuit complexity (68Q06) Privacy of data (68P27)

Related Items (1)

Enforcing input correctness via certification in garbled circuit evaluation

Uses Software

• ZKBoo

Cites Work

• Unnamed Item
• Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
• Faster Maliciously Secure Two-Party Computation Using the GPU
• Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• From Secrecy to Soundness: Efficient Verification via Secure Computation
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• The knowledge complexity of interactive proof-systems
• Non-Interactive Secure Computation Based on Cut-and-Choose
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries

This page was built for publication: On Garbling Schemes with and Without Privacy