• No results found

[PDF] Top 20 A Secure Oblivious Transfer Protocol from Indistinguishing Obfuscation

Has 10000 "A Secure Oblivious Transfer Protocol from Indistinguishing Obfuscation" found on our website. Below are the top 20 most common "A Secure Oblivious Transfer Protocol from Indistinguishing Obfuscation".

A  Secure  Oblivious  Transfer  Protocol  from  Indistinguishing  Obfuscation

A Secure Oblivious Transfer Protocol from Indistinguishing Obfuscation

... Oblivious Transfer(OT) is a two-party protocol, which was first proposed by Rabin[3] in 1981 and developed by Even, Goldreich and ...Lempel[4]. Oblivious Transfer is an important tool to ... See full document

18

SHADE:  Secure  HAmming  DistancE  computation  from  oblivious  transfer

SHADE: Secure HAmming DistancE computation from oblivious transfer

... Implementation Results To prove our allegations regarding efficiency im- provements in terms of computational workload, we ran the implementation of secure Hamming distance used in [17] and an implementation of ... See full document

20

The  Simplest  Protocol  for  Oblivious  Transfer

The Simplest Protocol for Oblivious Transfer

... is secure against both passive attacks (our software is immune to timing attacks, since the implementation is constant-time) and active attacks (by designing an appropriate encoding of group elements, which can be ... See full document

12

On the Feasibility of Extending Oblivious Transfer

On the Feasibility of Extending Oblivious Transfer

... extension protocol using only O(log n) ideal OT calls, it is possible for the receiver to guess the bits that it would receive in the ideal calls instead of actually running the ideal OT ...OT protocol that ... See full document

27

Efficient  k-out-of-n  oblivious  transfer  protocol

Efficient k-out-of-n oblivious transfer protocol

... an oblivious transfer scheme, a party’s behavior might be semi-honest or ...OT protocol honestly, but tries to get extra information from received ...deviate from the protocol. ... See full document

5

On  the  Feasibility  of  Extending  Oblivious  Transfer

On the Feasibility of Extending Oblivious Transfer

... extension protocol using only O(log n) ideal OT calls, it is possible for the receiver to guess the bits that it would receive as output from these calls instead of actually running ...OT protocol ... See full document

27

Exploratory designs of unconditionally secure distributed oblivious transfer protocols

Exploratory designs of unconditionally secure distributed oblivious transfer protocols

... information-theoretically secure threshold one-round DOT ...unconditionally secure DOT protocols, the proposed protocol satisfies security conditions C 1 , C 2 for a coalition of any size ...the ... See full document

195

Generic  Construction  of  UC-Secure  Oblivious  Transfer

Generic Construction of UC-Secure Oblivious Transfer

... obtain from them the SPHF-friendly commitment scheme given ...the protocol presented on Figure ...somewhat secure channel (they would not be used in the static ...The oblivious transfer ... See full document

21

Generalizing  Efficient  Multiparty  Computation

Generalizing Efficient Multiparty Computation

... composable oblivious transfer protocols proposed by Peikert et ...UC secure OT from dual-mode cryptosystems, which were initially instantiated under the DDH, QR and LWE ...reduction ... See full document

22

Adaptive  Garbled  RAM  from  Laconic  Oblivious  Transfer

Adaptive Garbled RAM from Laconic Oblivious Transfer

... laconic oblivious transfer (Cho et ...indistinguishability obfuscation or in random oracle ...round secure computation protocol for persistent RAM programs in the malicious setting ... See full document

44

Security   and  Efficiency  Analysis  of  The  Hamming  Distance  Computation  Protocol  Based  On  Oblivious  Transfer

Security and Efficiency Analysis of The Hamming Distance Computation Protocol Based On Oblivious Transfer

... uses Oblivious Transfer and provides security in the semi-honest ...Committed Oblivious Transfer (COT) and is claimed to provide full security in the malicious ...their protocol against ... See full document

10

A  Black-Box  Construction  of  Fully-Simulatable,  Round-Optimal  Oblivious  Transfer  from  Strongly  Uniform  Key  Agreement

A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement

... OT protocol has round complexity t, the final protocol requires 4 ad- ditional rounds for obtaining an intermediate security flavor known as “defensible privacy”, plus 4 rounds for cut and choose, plus 2 ... See full document

38

Secure  Oblivious  Transfer  from  Semi-Commutative  Masking

Secure Oblivious Transfer from Semi-Commutative Masking

... of protocol design that are based on exponentiation-only style operations (such as discrete logarithm and isogeny based ...key-exchange protocol; the second is based on the semi-commutative action of ... See full document

34

Universally  Composable  Oblivious  Transfer  Protocol  based  on  the  RLWE  Assumption

Universally Composable Oblivious Transfer Protocol based on the RLWE Assumption

... implement oblivious transfer in the post-quantum ...OT protocol [DNMQ12], a LPN-based OT protocol [DDN14] and the ones that can be obtained from instantiating the frameworks of [PVW08, ... See full document

21

Fast   and  Universally-Composable  Oblivious  Transfer   and  Commitment  Scheme  with  Adaptive  Security

Fast and Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security

... OT” protocol explored 3-round OT constructions in the PRO ...the protocol of [CO15] insecure in the UC ...their protocol and their new version presents a 3 round OT framework which can be ... See full document

58

Efficient protocols for private record linkage

Efficient protocols for private record linkage

... record from the original database is copied to the duplicate database with 1, 2 or 3 ...the protocol generally performs well with recall always higher than ...see from Figure 1a that with a small α, ... See full document

7

Statistical  Witness  Indistinguishability (and  more)  in  Two  Messages

Statistical Witness Indistinguishability (and more) in Two Messages

... transformation from a non- interactive zero-knowledge (NIZK) protocol to two-message WI requires the un- derlying NIZK to be a proof system – that is, for the NIZK to be sound against computationally ... See full document

32

Communication Protocol Adapters in Sterling Integrator IBM Corporation

Communication Protocol Adapters in Sterling Integrator IBM Corporation

... ■ SFTP Server adapter provides secure file transfer support with SFTP protocol. –Works on top of Secure SHell (SSH) protocol for transport security[r] ... See full document

28

Toward  Practical  Private  Access  to  Data  Centers  via  Parallel  ORAM

Toward Practical Private Access to Data Centers via Parallel ORAM

... Classic. Goldreich and Ostrovsky [12–14] introduced ORAM as a mechanism by which a trusted processor could make use of an untrusted RAM. Most existing ORAM solutions use the basic memory structure sug- gested by ... See full document

20

Proving  Correctness   and  Security  of  Two-Party  Computation  Implemented  in  Java  in  Presence  of  a  Semi-Honest  Sender

Proving Correctness and Security of Two-Party Computation Implemented in Java in Presence of a Semi-Honest Sender

... Our contributions We use the KeY tool[3], a deductive verification tool for Java programs, to show the correctness of a two-party computation protocol implemented in Java. KeY was previously used for verification ... See full document

16

Show all 10000 documents...