Results 1  10
of
15,567
How to garble arithmetic circuits
 In Symposium on Foundations of Computer Science (FOCS ’11
, 2011
"... Yao’s garbled circuit construction transforms a boolean circuit C: {0, 1} n → {0, 1} m into a “garbled circuit ” Ĉ along with n pairs of kbit keys, one for each input bit, such that Ĉ together with the n keys corresponding to an input x reveal C(x) and no additional information about x. The garbled ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
. The garbled circuit construction is a central tool for constantround secure computation and has several other applications. Motivated by these applications, we suggest an efficient arithmetic variant of Yao’s original construction. Our construction transforms an arithmetic circuit C: Zn → Zm over integers
Compact Reusable Garbled Circuits
, 2014
"... Garbled circuits are integral to secure function evaluation. A garbled circuit C ̂ for a circuit C enables a user to compute C(x) and nothing more about C or x, when given an encoding x ̂ for the input x. Earlier, garbling schemes produced only singleuse garbled circuits which did not offer securit ..."
Abstract
 Add to MetaCart
the singleuse ones, incur a multiplicative blowup in size i.e the size of the garbled circuit is C  · poly(λ) for some security parameter λ. Hence, a fundamental question about (reusable) garbled circuits is: How small can a garbled circuit be? The main result of this thesis is a garbling scheme which
Partial Garbling Schemes and Their Applications
"... Abstract. Garbling schemes (aka randomized encodings of functions) represent a function F by a “simpler” randomized function F ̂ such that F ̂ (x) reveals F (x) and no additional information about x. Garbling schemes have found applications in many areas of cryptography. Motivated by the goal of imp ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
”. This notion considers garbling schemes in which part of the input is public, in the sense that it can be leaked by F ̂. – We present constructions of partial garbling schemes for (boolean and arithmetic) formulas and branching programs which take advantage of the public input to gain better efficiency. – We
How to Garble RAM Programs
"... Assuming solely the existence of oneway functions, we show how to construct Garbled RAM Programs (GRAM) where its size only depends on fixed polynomial in the security parameter times the program running time. We stress that we avoid converting the RAM programs into circuits. As an example, our tec ..."
Abstract

Cited by 22 (2 self)
 Add to MetaCart
Assuming solely the existence of oneway functions, we show how to construct Garbled RAM Programs (GRAM) where its size only depends on fixed polynomial in the security parameter times the program running time. We stress that we avoid converting the RAM programs into circuits. As an example, our
RESEARCH ARTICLE Logsum Using Garbled Circuits
"... Secure multiparty computation allows for a set of users to evaluate a particular function over their inputs without revealing the information they possess to each other. Theoretically, this can be achieved using fully homomorphic encryption systems, but so far they remain in the realm of computation ..."
Abstract
 Add to MetaCart
Circuits. This technique relies on replacing the logsum operation with an equivalent piecewise linear approximation, taking advantage of recent advances in efficient methods for both designing and implementing Garbled Circuits. We elaborate on how all the required blocks should be assembled in order
How to Compress (Reusable) Garbled Circuits
, 2013
"... A fundamental question about (reusable) circuit garbling schemes is: how small can the garbled circuit be? Our main result is a reusable garbling scheme which produces garbled circuits that are the same size as the original circuit plus an additive poly(λ) bits, where λ is the security parameter. Sa ..."
Abstract
 Add to MetaCart
A fundamental question about (reusable) circuit garbling schemes is: how small can the garbled circuit be? Our main result is a reusable garbling scheme which produces garbled circuits that are the same size as the original circuit plus an additive poly(λ) bits, where λ is the security parameter
Fully KeyHomomorphic Encryption, Arithmetic Circuit ABE, and Compact Garbled Circuits
, 2014
"... We construct the first (keypolicy) attributebased encryption (ABE) system with short secret keys: the size of keys in our system depends only on the depth of the policy circuit, not its size. Our constructions extend naturally to arithmetic circuits with arbitrary fanin gates thereby further redu ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
We construct the first (keypolicy) attributebased encryption (ABE) system with short secret keys: the size of keys in our system depends only on the depth of the policy circuit, not its size. Our constructions extend naturally to arithmetic circuits with arbitrary fanin gates thereby further
Garbled Circuits via Structured Encryption
"... Abstract. The garbled circuit technique transforms a circuit in such a way that it can be evaluated on encrypted inputs. Garbled circuits were originally introduced by Yao (FOCS ’86) for the purpose of secure twoparty computation but have since found many applications. In this work, we consider the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
specialpurpose garbled circuits based on structured encryption schemes, which are encryption schemes that encrypt data structures in such a way that they can be queried through the use of a token. Using our framework, we show how to design more efficient garbled circuits for several graph
Foundations of Reactive Garbling Schemes
"... Abstract. Garbled circuits is a cryptographic technique, which has been used among other things for the construction of two and threeparty secure computation, private function evaluation and secure outsourcing. Garbling schemes is a primitive which formalizes the syntax and security properties of ..."
Abstract
 Add to MetaCart
party computation secure against a malicious adversary. We demonstrate how garbling schemes can be used to give abstract blackbox descriptions and proof of several advanced applications of garbled circuits in the literature, including Minilego and Lindell’s forgeandloose technique. 1
Fully succinct garbled RAM
 IACR Cryptology ePrint Archive
, 2015
"... We construct the first fully succinct garbling scheme for RAM programs, assuming the existence of indistinguishability obfuscation for circuits and oneway functions. That is, the size, space requirements, and runtime of the garbled program are the same as those of the input program, up to polyloga ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We construct the first fully succinct garbling scheme for RAM programs, assuming the existence of indistinguishability obfuscation for circuits and oneway functions. That is, the size, space requirements, and runtime of the garbled program are the same as those of the input program, up to poly
Results 1  10
of
15,567