搜索结果: 1-15 共查到“军事学 Garbled Circuits”相关记录26条 . 查询时间(0.118 秒)
Zaphod: Efficiently Combing LSSS and Garbled Circuits in SCALE
MPC GC
font style='font-size:12px;'>
2019/8/30
We present modifications to the MPC system SCALE-MAMBA to enable the evaluation of garbled circuit (GC) based MPC functionalities and Linear Secret Sharing (LSSS) based MPC functionalities along side ...
On the Leakage of Corrupted Garbled Circuits
Garbled circuits Malicious adversaries Corruption of garbled circuits
font style='font-size:12px;'>
2018/8/16
Secure two-party computation provides a way for two parties to compute a function, that depends on the two parties' inputs, while keeping them private. Known since the 1980s, Yao's garbled circuits ap...
Symbolic security of garbled circuits
symbolic cryptography garbled circuit formal methods in cryptography
font style='font-size:12px;'>
2018/2/8
We present the first computationally sound symbolic analysis of Yao's garbled circuit construction for secure two party computation. Our results include an extension of the symbolic language for crypt...
Efficient Adaptively Secure Zero-knowledge from Garbled Circuits
Zero-knowledge Garbled Circuits Adaptive Security
font style='font-size:12px;'>
2018/1/11
Zero-knowledge (ZK) protocols are undoubtedly among the central primitives in cryptography, lending their power to numerous applications such as secure computation, voting, auctions, and anonymous cre...
Improvements for Gate-Hiding Garbled Circuits
garbled circuits Yao's protocol private function evaluation
font style='font-size:12px;'>
2017/10/9
Garbled circuits have been highly optimized for practice over the last several years. Today's most efficient constructions treat different types of gates (e.g., AND vs XOR) differently; as such, they ...
Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model
Plain Model single evaluation
font style='font-size:12px;'>
2017/9/28
We consider the problem of constant-round secure two-party computation in the presence of active (malicious) adversaries. We present the first protocol that has only a constant multiplicative communic...
Adaptively Indistinguishable Garbled Circuits
Garble Circuits Adaptive Security Functional Encryption
font style='font-size:12px;'>
2017/9/26
A garbling scheme is used to garble a circuit C and an input x in a way that reveals the output C(x) but hides everything else. An adaptively secure scheme allows the adversary to specify the input x ...
Efficient Scalable Constant-Round MPC via Garbled Circuits
Garbled Circuits Constant Round MPC Key-Homomorphic PRFs
font style='font-size:12px;'>
2017/9/13
In the setting of secure multiparty computation, a set of mutually distrustful parties carry out a joint computation of their inputs, without revealing anything but the output. Over recent years, ther...
Privacy-Preserving Ridge Regression Without Garbled Circuits
Garbled Circuits data points
font style='font-size:12px;'>
2017/8/2
Ridge regression is an algorithm that takes as input a large number of data points and finds the best-fit linear curve through these points. It is a building block for many machine-learning operations...
Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic
Garbled Circuits Privacy-free Formula
font style='font-size:12px;'>
2017/6/15
Garbled circuits are of central importance in cryptography, finding widespread application in secure computation, zero-knowledge (ZK) protocols, and verifiable outsourcing of computation to name a few...
Garbled Circuits as Randomized Encodings of Functions: a Primer
randomized encoding garbled circuits
font style='font-size:12px;'>
2017/5/5
Yao's garbled circuit construction is a central cryptographic tool with numerous applications. In this tutorial, we study garbled circuits from a foundational point of view under the framework of rand...
DUPLO: Unifying Cut-and-Choose for Garbled Circuits
2PC LEGO Implementation
font style='font-size:12px;'>
2017/4/24
Cut-and-choose (C&C) is the standard approach to making Yao’s garbled circuit two-party computation (2PC) protocol secure against malicious adversaries. Traditional cut-and-choose operates at the leve...
Hashing Garbled Circuits for Free
garbled circuits hashing secure computation
font style='font-size:12px;'>
2017/2/20
We introduce {\em Free Hash}, a new approach to generating Garbled Circuit (GC) hash at no extra cost during GC generation. This is in contrast with state-of-the-art approaches, which hash GCs at comp...
Adaptive Security of Yao's Garbled Circuits
Garbled Circuits Adaptive Security Secure Computation
font style='font-size:12px;'>
2016/12/10
A recent work of Hemenway et al. (CRYPTO '16) modifies Yao's construction and shows that the resulting scheme is adaptively secure. This is done by encrypting the garbled circuit from Yao's constructi...
Cross&Clean: Amortized Garbled Circuits with Constant Overhead
garbling schemes two-party computation
font style='font-size:12px;'>
2016/5/23
Garbled circuits (GC) are one of the main tools for secure two-party computation. One of the most promising techniques for efficiently achieving active-security in the context of GCs is the so called ...