[PDF] Top 20 Generic Construction of UC-Secure Oblivious Transfer

... the construction given in [ABB + 13], giving the protocol presented on Figure ...somewhat secure channel (they would not be used in the static ...The oblivious transfer scheme described in ... See full document

... composable oblivious transfer protocols proposed by Peikert et ...black-box construction of UC secure OT from dual-mode cryptosystems, which were initially instantiated under the DDH, ... See full document

... efficient construction of cut-and-choose bilateral oblivious transfer based on decisional Diffied-Hellman ...The construction is divided into two ...bilateral oblivious transfer ... See full document

... the generic models applied in the rest of the document, that is the communication model, the security model and the adversary ...distributed oblivious transfer protocol introduced by Blundo, D’Arco, ... See full document

... as Secure Function Evaluation. Several generic constructions exist in this setting, which apply SMC to any function computed by two ...using Oblivious Transfers and Garbled ...many generic ... See full document

... a construction of adaptively secure garbled circuit transfer where the size of the input encoding grows only with the input and the output ...their construction is a technique to “linearize” a ... See full document

... earlier construction by ...a UC secure PAKE protocol and [31, 20] presents an adaptively secure ...the construction of one-round PAKE schemes [32, 33, ... See full document

... the construction using the standard discrete logarithm setting, so as to fix ideas for the ...the construction from hard homogeneous spaces, [CLM + ... See full document

... maliciously secure MPC from any of low-noise LPN, high-noise LWE, Subset Sum, CDH, DDH, and RSA, all with polynomial ...maliciously secure MPC in the plain model, for arbitrary functionalities: • Using 5 ... See full document

... secret transfer with access structure, with the aim of revealing as little information as ...on oblivious polynomial evaluation, and the other one is based on a new variant of garbled Bloom ...be ... See full document

... 80’s, oblivious transfer is a universal basic block for secure multiparty computations [21], and a number of constructions have been pro- ...Wang’s construction [38] relies solely on ... See full document

... and point out that if the circuit class C has efficiently computable canonical forms, then the computation of that canonical form would already be an indis- tinguishability obfuscator. More recently, there are several ... See full document

... Oblivious Transfer Extension. We provide the first adaptively-secure protocols for OT Extension solely relying on the PRO ...statically secure, if we invoke them in a non-blackbox ...our ... See full document

... “black-box” construction of universally composable OT using fewer than two stateless tokens, but universally composable coin tossing (and hence OT) can be based on a single stateless token using nonblack-box ... See full document

... 2. Determining final offset of real blocks. The blocks that are going to be written back in the path P can come from only A[1..LZ], which is sorted according to the field offset, that currently indicates the lowest index ... See full document

... The basic cryptographic method to hide access patterns is Oblivious RAM (ORAM) [8,9]. It compiles logical access sequences (from a client) into garbled ones (to a storage space, or server) so that a curious ... See full document

... Before describing our results in more detail, we remark that the group we construct actually has non-unique element encodings (much like in a “graded encoding scheme” [27], only without any notion of multilinear map). It ... See full document

... perfectly oblivious simulation of PRAM iff OPRAM is perfectly oblivious, and moreover OPRAM(inp) is identically distributed as PRAM(inp) for any input ...overhead). Oblivious simulation ...(parallel) ... See full document

... (strong) multiplicative homomorphism. Since such schemes can be easily constructed under Regev’s Learning-With-Errors (LWE) assumption [Reg05], this exposes a qualitative difference between the two assumptions. Indeed, ... See full document

... hand, the clients do not want to reveal which mes- sages they are retrieving. Summing up, there are situations which both the server and the clients want to preserve some kind of privacy. The server wants to restrict the ... See full document