The Use of Circuit Evaluation Techniques for Secure Computation
نویسنده
چکیده
Secure two-party computation problem is about two parties that want to compute some function of their private inputs in a way that other party won’t learn it. We describe a general way to perform secure two-party computation of a function specified as a boolean circuit, which was proposed by A.A. Yao in 1982. This method is named Yao garbled circuit evaluation and is secure against semi-honest adversaries. We present a new efficient protocol for secure two-party computation Circus, that is secure against malicious adversary in consistency model. Consistency model implies that either both parties will receive correct output and persist privacy of their inputs or a honest party will know, that is was cheated and that adversary potentially have learnt 1 bit of other party’s input value. We specify all necessary sub-protocols and their security requirements and prove security of Circus in malicious environment.
منابع مشابه
PCF: A Portable Circuit Format for Scalable Two-Party Secure Computation
A secure computation protocol for a function f (x,y) must leak no information about inputs x,y during its execution; thus it is imperative to compute the function f in a data-oblivious manner. Traditionally, this has been accomplished by compiling f into a boolean circuit. Previous approaches, however, have scaled poorly as the circuit size increases. We present a new approach to compiling such...
متن کاملA Secure Outsourced Garbled Circuit Evaluation for Mobile Devices
Garbled circuits provide a powerful tool for jointly evaluating functions while preserving the privacy of each user’s inputs. While recent research has made the use of this primitive more practical, such solutions generally assume that participants are symmetrically provisioned with massive computing resources. In reality, most people on the planet only have access to the comparatively sparse c...
متن کاملSecure Outsourced Garbled Circuit Evaluation for Mobile Devices
Garbled circuits provide a powerful tool for jointly evaluating functions while preserving the privacy of each user’s inputs. While recent research has made the use of this primitive more practical, such solutions generally assume that participants are symmetrically provisioned with massive computing resources. In reality, most people on the planet only have access to the comparatively sparse c...
متن کاملEmpirical Evaluation of Secure Two-Party Computation Models
Secure multi-party protocols make the computation of answers and decisions that depend on multiple parties’ private data possible, without revealing anything about the private inputs (other than what unavoidably can be deduced from the outputs). There are general results showing that any probabilistic polynomial time function can be computed in this framework in an asymptotically efficient mann...
متن کاملPractical Secure Two-Party Computation: Techniques, Tools, and Applications
Many compelling applications involve computations that require sensitive data from two or more individuals. As an example, consider the myriad genetics applications soon to be within reach of individuals as the cost of personal genome sequencing rapidly plummets. An individual may wish to compare her genome with the genomes of different groups of participants in a study to determine which treat...
متن کامل