搜索结果: 1-15 共查到“Garbling”相关记录20条 . 查询时间(0.046 秒)
We consider the problem of garbling arithmetic circuits and present a garbling scheme for inner-product predicates over exponentially large fields. Our construction stems from a generic transformation...
Succinct Garbling Schemes from Functional Encryption through a Local Simulation Paradigm
garbling schemes succinct randomized encodings adaptive security
<
2018/8/21
We study a simulation paradigm, referred to as local simulation, in garbling schemes. This paradigm captures simulation proof strategies in which the simulator consists of many local simulators that g...
Optimizing Authenticated Garbling for Faster Secure Two-Party Computation
secure two-party computation malicious security
<
2018/6/7
Wang et al. (CCS 2017) recently proposed a protocol for malicious secure two-party computation that represents the state-of-the- art with regard to concrete efficiency in both the single-execution and...
Limits on the Power of Garbling Techniques for Public-Key Encryption
Public-key encryption one-way function black-box constructions non-black-box separations
<
2018/6/5
Understanding whether public-key encryption can be based on one-way functions is a fundamental open problem in cryptography. The seminal work of Impagliazzo and Rudich [STOC'89] shows that black-box c...
Adaptively Secure Garbling with Near Optimal Online Complexity
Errors assumption standard model
<
2018/3/7
We construct an adaptively secure garbling scheme with an online communication complexity of n+m+poly(log|C|,sec)n+m+poly(log|C|,sec) where C:{0,1}n→{0,1}mC:{0,1}n→{0,1}m is the circuit being g...
In the setting of secure computation, a set of parties wish to compute a joint function of their private inputs without revealing anything but the output. Garbled circuits, first introduced by Yao, ar...
On Multiparty Garbling of Arithmetic Circuits
Arithmetic Garbled Circuits Constant Round MPC Multiparty Garbling
<
2017/12/13
We initiate a study of garbled circuits that contain both Boolean and arithmetic gates in secure multiparty computation. In particular, we incorporate the garbling gadgets for arithmetic circuits rece...
Authenticated Garbling and Efficient Maliciously Secure Multi-Party Computation
multi-party computation secure computation garbled circuits
<
2017/3/6
In this paper, we extend the recent work by Wang et al., who proposed a new framework for secure two-party computation in the preprocessing model that can be instantiated efficiently using TinyOT. We ...
Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation
two-party computation secure computation
<
2017/2/20
We propose a simple and efficient framework for obtaining efficient constant-round protocols for maliciously secure two-party computation. Our framework uses a function-independent preprocessing phase...
How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes
garbled circuits lower bound on linear garbling schemes semi-private function evaluation
<
2017/2/20
At EUROCRYPT 2015, Zahur et al.\ argued that all linear, and thus, efficient, garbling schemes need at least two kk-bit elements to garble an AND gate with security parameter kk. We show how to circum...
Garbling Gadgets for Boolean and Arithmetic Circuits
garbled circuits secure computation arithmetic circuits
<
2016/12/8
We present simple, practical, and powerful new techniques for garbled circuits. These techniques
result in significant concrete and asymptotic improvements over the state of the art, for several natu...
Garbling Scheme for Formulas with Constant Size of Garbled Gates
garbled circuits constant size of garbled gates correlation robustness
<
2016/6/6
We provide a garbling scheme which creates garbled circuits
of a very small constant size (four bits per gate) for circuits with fanout
one (formulas). For arbitrary fan-out, we additionally need on...
In recent years, a lot of progress has been made on speeding up Actively-secure Two-party Function Evaluation (SFE) using Garbled Circuits. For a given level of security, the amount of information tha...
FleXOR: Flexible garbling for XOR gates that beats free-XOR
cryptographic protocols garbled circuits
<
2016/1/9
Most implementations of Yao’s garbled circuit approach for 2-party secure computation
use the free-XOR optimization of Kolesnikov & Schneider (ICALP 2008). We introduce an
alternative technique call...
Succinct Garbling Schemes and Applications
Succinct Garbling Scheme IO for RAM Bounded Space Computation
<
2016/1/7
Assuming the existence of iO for P/poly and one-way functions, we show how to succinctly
garble bounded-space computations (BSC) M: the size of the garbled program (as well as the
time needed to gen...