Practical Two-Party Computation Based on the Conditional Gate
نویسندگان
چکیده
We present new results in the framework of secure multiparty computation based on homomorphic threshold cryptosystems. We introduce the conditional gate as a special type of multiplication gate that can be realized in a surprisingly simple and efficient way using just standard homomorphic threshold ElGamal encryption. As addition gates are essentially for free, the conditional gate not only allows for building a circuit for any function, but actually yields efficient circuits for a wide
منابع مشابه
New Approaches to Practical Secure Two-Party Computation
We present two new approaches to maliciously secure two-party computation with practical efficiency: • First, we present the first maliciously secure two-party computation protocol with practical efficiency based on the classic semi-honest protocol given by Goldreich et al. at STOC 1987. Before now all practical protocols with malicious security were based on Yao’s garbled circuits. We report o...
متن کاملTesting for Asymmetric Information in Automobile Insurance Market an Iranian Insurance Company
The presence of asymmetric information is an important source of efficiency loss for insurance companies and could reduce profitability. In this paper, we test the conditional independence of coverage choice and risk, where “conditional” means conditional on all variables observed by the insurer. We use two parametric methods: a pair of probits and a bivariate probit model. The data includes al...
متن کاملMiniLEGO: Efficient Secure Two-Party Computation from General Assumptions
One of the main tools to construct secure two-party computation protocols are Yao garbled circuits. Using the cut-and-choose technique, one can get reasonably efficient Yao-based protocols with security against malicious adversaries. At TCC 2009, Nielsen and Orlandi [28] suggested to apply cut-andchoose at the gate level, while previously cut-and-choose was applied on the circuit as a whole. Th...
متن کاملEfficient Secure Two-Party Computation with Untrusted Hardware Tokens (Full Version)
We consider Secure Function Evaluation (SFE) in the client-server setting where the server issues a secure token to the client. The token is not trusted by the client and is not a trusted third party. We show how to take advantage of the token to drastically reduce the communication complexity of SFE and computation load of the server. Our main contribution is the detailed consideration of desi...
متن کاملFaster Secure Two-Party Computation Using Garbled Circuits
Secure two-party computation enables two parties to evaluate a function cooperatively without revealing to either party anything beyond the function’s output. The garbled-circuit technique, a generic approach to secure two-party computation for semi-honest participants, was developed by Yao in the 1980s, but has been viewed as being of limited practical significance due to its inefficiency. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004