• No results found

[PDF] Top 20 Foundations of Garbled Circuits

Has 10000 "Foundations of Garbled Circuits" found on our website. Below are the top 20 most common "Foundations of Garbled Circuits".

Foundations  of  Garbled  Circuits

Foundations of Garbled Circuits

... Abstract. Garbled circuits, a classical idea rooted in the work of Andrew Yao, have long been understood as a cryptographic technique, not a cryptographic ... See full document

45

Verified  Implementations  for  Secure   and  Verifiable  Computation

Verified Implementations for Secure and Verifiable Computation

... the foundations of garbled circuits set forth by Bellare, Hoang, and Rogaway (CCS 2012, ASIACRYPT 2012) to build verified im- plementations of garbling schemes, a verified implementation of Yao’s ... See full document

13

Combining  Secret  Sharing   and  Garbled  Circuits  for  Efficient  Private  IEEE 754  Floating-Point  Computations

Combining Secret Sharing and Garbled Circuits for Efficient Private IEEE 754 Floating-Point Computations

... The main difference of the two security properties is that in case of privacy the adversary obtains the whole information needed to evaluate the garbled circuit and decode the result. However, for obliviousness ... See full document

20

Two  Halves  Make  a  Whole:  Reducing  Data  Transfer  in  Garbled  Circuits  using  Half  Gates

Two Halves Make a Whole: Reducing Data Transfer in Garbled Circuits using Half Gates

... of garbled circuits use four ciphertexts per gate, although various methods have been proposed to reduce this ...smaller garbled circuits than any prior ...be garbled with a single ... See full document

28

Non-Interactive  Secure  Computation  Based  on  Cut-and-Choose

Non-Interactive Secure Computation Based on Cut-and-Choose

... t garbled circuits for the same soundness, reducing the number of garbled circuits by (at least) a factor of ...t garbled circuits (for soundness 2 −t ... See full document

14

Black-Box  Garbled  RAM

Black-Box Garbled RAM

... more circuits than the expectation of a half to each child, but this causes a chain reaction as now each of them need to give their children another push beyond expectation and so ...extra garbled ... See full document

32

A  Simple  Construction  of  iO  for  Turing  Machines

A Simple Construction of iO for Turing Machines

... step circuits and the database ...the garbled encryption tables are now replaced with garbled step ...step circuits has the desired locality property, meaning that given only the locations ... See full document

30

Time-Lock  Puzzles  from  Randomized  Encodings

Time-Lock Puzzles from Randomized Encodings

... reusable garbled circuits), where a function f is encoded in an expensive preprocessing phase, and subsequently any input x for the function can be encoded in time that is independent of the complexity of f ... See full document

29

Fast   and  Secure  Three-party  Computation:  The  Garbled  Circuit  Approach

Fast and Secure Three-party Computation: The Garbled Circuit Approach

... boolean circuits) is comparable to other implemented constructions with only semi-honest security, a single execution of an AES block requires 232 ms in Sharemind [LTW13], ...boolean circuits circuit but ... See full document

18

Non-Interactive  Secure  Multiparty  Computation

Non-Interactive Secure Multiparty Computation

... Yao’s garbled circuit construction, the secrecy of the input completely breaks down if a pair of input keys is re- ...of garbled circuits and related primitives that are resilient to up to t fully ... See full document

43

k-Round  MPC  from  k-Round  OT  via  Garbled  Interactive  Circuits

k-Round MPC from k-Round OT via Garbled Interactive Circuits

... plain garbled circuits and witness ...combining garbled circuits and witness encryption has already appeared in three recent works by Gordon, Liu, and Shi [GLS15], Cho et ...Our garbled ... See full document

88

Privately  Evaluating  Decision  Trees   and  Random  Forests

Privately Evaluating Decision Trees and Random Forests

... We conduct all experiments at a 128-bit security level. For our implementation of exponential ElGamal, we use the 256-bit elliptic curve numsp256d1. We instantiate the OT scheme at the 128-bit security level using the ... See full document

35

Malicious-Client  Security  in  Blind  Seer:  A  Scalable  Private  DBMS

Malicious-Client Security in Blind Seer: A Scalable Private DBMS

... amortized garbled circuit techniques [12], ...Yao Garbled Circuits (Yao GC) protocol is a practical method that entirely preserves the privacy of the inputs and reveals no more than the private ... See full document

16

Black-Box  Parallel  Garbled  RAM

Black-Box Parallel Garbled RAM

... parallel Garbled RAM was initiated in the paper of Boyle, Chung and Pass [3] where they study it in the context of building an Oblivious Parallel RAM (this work, along with another paper on Oblivious Parallel RAM ... See full document

21

Adaptive  Garbled  RAM  from  Laconic  Oblivious  Transfer

Adaptive Garbled RAM from Laconic Oblivious Transfer

... This task is trivial if one reveals both the function encoding and the input encoding together after the input is specified. However, this task becomes highly non-trivial if we require the size of the input encoding to ... See full document

44

Garbled  RAM  From  One-Way  Functions

Garbled RAM From One-Way Functions

... three circuits instantiated with different parameters hardwired into ...these garbled circuits can “talk to each ...first garbled circuit produce as output the labels needed for the inputs of ... See full document

32

A Flexible Scheme of Garbled Random Access Stored program Machine

A Flexible Scheme of Garbled Random Access Stored program Machine

... of garbled code random access memory and the control circuit to construct the garbled random access stored-program machine ...scheme, garbled code is the sequence of CPU instructions stored in the ... See full document

6

Efficient  Constant  Round  Multi-Party  Computation  Combining  BMR   and  SPDZ

Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ

... Recently, there has been much interest in the problem of concretely efficient secure MPC, where “concretely efficient” refers to protocols that are sufficiently efficient to be implemented in practice (in particular, ... See full document

41

How  to  Garble  RAM  Programs

How to Garble RAM Programs

... the circuits which we described above. The circuits are building blocks to perform the following procedures: We have one circuit searches for a memory location in a bucket and returns the memory contents ... See full document

23

Succinct  Adaptive  Garbled  RAM

Succinct Adaptive Garbled RAM

... Boolean circuits for programs ...the garbled program is proportional to both the runtime and space of the plaintext ...the garbled circuit [KS08, KMR14, ZRE15], in garbling arithmetic circuits ... See full document

41

Show all 10000 documents...