2015 IEEE Symposium on Security and Privacy 2015
DOI: 10.1109/sp.2015.32
|View full text |Cite
|
Sign up to set email alerts
|

TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits

Abstract: We introduce TinyGarble, a novel automated methodology based on powerful logic synthesis techniques for generating and optimizing compressed Boolean circuits used in secure computation, such as Yao's Garbled Circuit (GC) protocol. TinyGarble achieves an unprecedented level of compactness and scalability by using a sequential circuit description for GC. We introduce new libraries and transformations, such that our sequential circuits can be optimized and securely evaluated by interfacing with available garbling… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
112
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 156 publications
(112 citation statements)
references
References 45 publications
0
112
0
Order By: Relevance
“…In Section 3, we keep these differences in mind in order to choose the right MPC techniques for each part of the computation. Popular applications used for the empirical evaluation of practical MPC systems include graph algorithms [5,32,42,51,57], data structure algorithms [42,51], string matching and distance algorithms [36,37,66] and AES [3,36,37,66].…”
Section: Multi-party Computationmentioning
confidence: 99%
“…In Section 3, we keep these differences in mind in order to choose the right MPC techniques for each part of the computation. Popular applications used for the empirical evaluation of practical MPC systems include graph algorithms [5,32,42,51,57], data structure algorithms [42,51], string matching and distance algorithms [36,37,66] and AES [3,36,37,66].…”
Section: Multi-party Computationmentioning
confidence: 99%
“…Another family of decentralized frameworks ( [11,28,33,40,42,50]) is based on secure multiparty computation (SMPC) protocols that can theoretically perform any computation task without leaking any party's private data. Yet, several critical issues, with current SMPC solutions, render them impractical in real operational settings.…”
Section: Related Workmentioning
confidence: 99%
“…Yet, several critical issues, with current SMPC solutions, render them impractical in real operational settings. For instance, state-of-the-art SMPC libraries cannot appropriately address computations that involve more than two participants (e.g., [11,28,33,42]). The computation and memory costs of these solutions are already prohibitively high in a semi-honest adversary model, let alone when considering malicious behavior.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations