• No results found

A Strongly Secure Distributed Oblivious Transfer Protocol

On Unconditionally Secure Distributed Oblivious Transfer

On Unconditionally Secure Distributed Oblivious Transfer

... about distributed protocols for oblivious trans- fer, proposed by Naor and Pinkas, and recently generalized by Blundo ...These distributed oblivious transfer pro- tocols provide ...

14

Analysis of an unconditionally secure distributed oblivious transfer

Analysis of an unconditionally secure distributed oblivious transfer

... OT protocol is to guarantee that the receiver cannot learn anything about the secrets that he is not supposed to ... protocol cannot prevent a receiver who attempts to obtain more than one ...their ...

5

A  Secure  Oblivious  Transfer  Protocol  from  Indistinguishing  Obfuscation

A Secure Oblivious Transfer Protocol from Indistinguishing Obfuscation

... new oblivious transform protocol from indistinguishability obfuscation has been proposed in this paper under DDH assumption and based on the the dual- mode ...the oblivious transform functionality, ...

18

Exploratory designs of unconditionally secure distributed oblivious transfer protocols

Exploratory designs of unconditionally secure distributed oblivious transfer protocols

... However, a preliminary analysis shows that most unconditionally secure DOT pro- tocols have weaknesses, flaws or are inefficient, especially in some specific scenarios. Furthermore, when the research on DOT ...

195

An  Efficient  Secure  Oblivious  Transfer

An Efficient Secure Oblivious Transfer

... traditional oblivious transfer protocols are treated as a cryptographic primitive, they are usually executed without the consideration of possible attacks, ...novel secure oblivious ...

17

The  Simplest  Protocol  for  Oblivious  Transfer

The Simplest Protocol for Oblivious Transfer

... A framework for efficient adaptively secure composable oblivious transfer in the rom. Cryptology ePrint Archive, Report 2017/993, 2017. https://eprint.iacr.org/2017/993, Version 21 December 2017. BDL ...

12

Generic  Construction  of  UC-Secure  Oblivious  Transfer

Generic Construction of UC-Secure Oblivious Transfer

... the protocol and all the means of the ...a protocol Π emulates F , one has to construct, for any polynomial adversary A (which controls the communication between the players), a simulator S such that no ...

21

Distributed  Oblivious  RAM  for  Secure  Two-Party  Computation

Distributed Oblivious RAM for Secure Two-Party Computation

... the secure two-party computation, Alice and Bob can simulate two non- communicating ...new Oblivious RAM proto- col where a client interacts with two non-communicating servers, that supports n reads and ...

21

An  Oblivious  Transfer  Protocol  with  Log-Squared  Communication

An Oblivious Transfer Protocol with Log-Squared Communication

... retrieval protocol for `-bit strings with low-degree polylogarithmic receiver- computation, linear sender-computation and communication Θ(k · log 2 n + ` · log n), where k is a possibly non-constant security ...

15

Secure  Oblivious  Transfer  from  Semi-Commutative  Masking

Secure Oblivious Transfer from Semi-Commutative Masking

... the protocol and its execution in the presence of an adversary are formalized, this rep- resents the real-life model which we also call the real ...the protocol internally and returning the output assigned ...

34

Efficient  k-out-of-n  oblivious  transfer  protocol

Efficient k-out-of-n oblivious transfer protocol

... computation, oblivious transfer, DDH assumption 1 Introduction Nowadays, cryptography has been used to implement schemes for varies purposes in digital world and many crypto- graphic theories and ...

5

Faster Oblivious Transfer Extension and Its Impact on Secure Computation

Faster Oblivious Transfer Extension and Its Impact on Secure Computation

... called Secure Function Definition Language (SFDL), which is compiled into a Boolean ...a secure computation language and uses a scheduler, which evaluates gate when the inputs become ...generates ...

195

SHADE:  Secure  HAmming  DistancE  computation  from  oblivious  transfer

SHADE: Secure HAmming DistancE computation from oblivious transfer

... efficient protocol, based solely on 1-out-of-2 Oblivious Transfer, that achieves full security in the semi-honest setting and one-sided security in the mali- cious ...this protocol is ...

20

Adaptive  Zero-Knowledge  Proofs   and  Adaptively  Secure  Oblivious  Transfer

Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer

... adaptively secure oblivious ...adaptively secure oblivious transfer require assumptions of the flavor that it is possible to sample a permutation without its ...adaptively secure ...

37

Separating Two-Round Secure Computation From Oblivious Transfer

Separating Two-Round Secure Computation From Oblivious Transfer

... h(x, y). Overall, we get a separation between all 2-party functionalities and all external functionalities f g whose underlying g is non-trivial. Relation with homomorphic secret sharing. Two-round MPC for ...

18

Do  Distributed  Differentially-Private  Protocols  Require  Oblivious  Transfer?

Do Distributed Differentially-Private Protocols Require Oblivious Transfer?

... 5.1 Extension to Functionalities with an Embedded XOR Recall that we say that a function f contains an embedded XOR on adjacent inputs if there exist adjacent inputs x 0 , x 1 , y 0 , y 1 and outputs z 0 , z 1 such that ...

20

Universally  Composable  Oblivious  Transfer  Protocol  based  on  the  RLWE  Assumption

Universally Composable Oblivious Transfer Protocol based on the RLWE Assumption

... post-quantum oblivious transfer based on the Ring Learning with Errors ...our protocol is secure in the Universal Composability framework against static malicious adversaries in the random ...

21

Somewhat  Non-Committing  Encryption   and  Efficient  Adaptively  Secure  Oblivious  Transfer

Somewhat Non-Committing Encryption and Efficient Adaptively Secure Oblivious Transfer

... world protocol which realizes F SC ` is called an ` -equivocal non-committing encryption scheme ( ` ...a secure channel, as modeled by F SC ` , in a way that allows him to later explain this communication ...

28

Secure  Two-Party  Computation  via  Cut-and-Choose  Oblivious  Transfer

Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer

... Otherwise, do nothing. The idea behind the transformation. Let π be a Σ-protocol for a relation R. Then, in order to achieve simulation in the case of a corrupted verifier, we need to know the verifier query β ...

40

Efficient,  Adaptively  Secure,   and  Composable  Oblivious  Transfer  with  a  Single,  Global  CRS

Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS

... the protocol first needs to be changed so that the last round message is sent over a secure ...Sigma protocol, some of the internal state cannot be erased until the last ...Sigma protocol, the ...

51

Show all 10000 documents...

Related subjects