Lecture notes in computer science

Enforcing Input Correctness via Certification in Garbled Circuit Evaluation

Yihua Zhang, Marina Blanton, Fattaneh Bayatbabolghani

Published Jan 1, 2017• 9 citations

Publisher

DOI: 10.1007/978-3-319-66399-9_30

Related papers

Geometry-Based Garbled Circuits Relying Solely on One Evaluation Algorithm Under Standard Assumption

Jingyu Ning, Zhenhua Tan

Lecture notes in computer scienceJan 1, 20240 citations

Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation

Payman Mohassel, Ben Riva

Lecture notes in computer scienceJan 1, 201365 citations

Efficient Secure Computation with Garbled Circuits

Yan Huang, Chih-Hao Shen, David Evans +2 more

Lecture notes in computer scienceJan 1, 2011146 citations

On Garbled Circuits and Constant Round Secure Function Evaluation

Stephen R. Tate, Ke Xu

In this paper, we examine a form of garbled (or encrypted) circuit introduced by Beaver, Micali, and Rogaway as part of their design of a constant-round secure function evaluation (SFE) protocol [5]. We show that a subtle flaw in their construction allows even a simple passive adversary (also known as an "honest-but-curious adversary") to discover private data when evaluating such a garbled circuit. In particular, information leaks from the garbled circuit at places where multiple gates share a common input wire, and is extracted by exploiting dependencies between the gate labels of the multiple gates that share that input wire. In addition to showing how this flaw manifests itself and how it can be exploited, we pinpoint the errors in the corresponding security proof [19]. Finally, we introduce a new type of gate called a "splitter" which corrects the security flaw by removing all instances of shared input wires, and using this we can correct the problems in the proof as well, giving a secure garbled circuit. This corrected

Jan 1, 201213 citations

Garbled Circuits via Structured Encryption

Seny Kamara, Lei Wei

Lecture notes in computer scienceJan 1, 201311 citations

Reactive Garbling: Foundation, Instantiation, Application

Jesper Buus Nielsen, Samuel Ranellucci

Garbled circuits is a cryptographic technique, which has been used among other things for the construction of two and threeparty secure computation, private function evaluation and secure outsourcing. Garbling schemes is a primitive which formalizes the syntax and security properties of garbled circuits. We define a generalization of garbling schemes called reactive garbling schemes. We consider functions and garbled functions taking multiple inputs and giving multiple outputs. Two garbled functions can be linked together: an encoded output of one garbled function can be transformed into an encoded input of the other garbled function without communication between the parties. Reactive garbling schemes also allow partial evaluation of garbled functions even when only some of the encoded inputs are provided. It is possible to further evaluate the linked garbled functions when more garbled inputs become available. It is also possible to later garble more functions and link them to the ongoing garbled evaluation. We provide rigorous definitions for reactive garbling schemes. We define a new notion of security for reactive garbling schemes called confidentiality. We provide both simulation based and indistinguishability based notions of security. We also show that the simulation based notion of security implies the indistinguishability based notion of security. We present an instantiation of reactive garbling schemes. We present an application of reactive garbling schemes to reactive two-party computation secure against a malicious, static adversary. We demonstrate how garbling schemes can be used to give abstract black-box descriptions and proof of several advanced applications of garbled circuits in the literature, including Minilego and Lindell’s forge-and-lose technique.

Jan 1, 20160 citations