• No results found

[PDF] Top 20 The Simplest Protocol for Oblivious Transfer

Has 10000 "The Simplest Protocol for Oblivious Transfer" found on our website. Below are the top 20 most common "The Simplest Protocol for Oblivious Transfer".

The  Simplest  Protocol  for  Oblivious  Transfer

The Simplest Protocol for Oblivious Transfer

... our protocol; Section 3 describes the chosen representation of group elements; Section 4 describes the low level building blocks of the group operations; and Section 5 reports the timings of our ... See full document

12

Analysis  Of  The  Simulatability  Of  An  Oblivious  Transfer

Analysis Of The Simulatability Of An Oblivious Transfer

... among known protocols, because it is the most e ffi cient protocol for OT 2 1 against malicious adversaries in plain model and it is a generally realizable framework. In [10] the authors also discuss the ... See full document

5

Supersingular  Isogeny  Oblivious  Transfer

Supersingular Isogeny Oblivious Transfer

... -SIOT protocol, Bob’s choice should not be known to ...the protocol execution, Bob will not be able to gain any knowledge about the message that he did not ...proposed protocol, Theorem 1 was ... See full document

23

Oblivious  Transfer  in  Incomplete  Networks

Oblivious Transfer in Incomplete Networks

... the protocol does not ...the protocol is aborted in the precomputation phase, the privacy of B’s input is preserved as the real input is never used until the OT computation ... See full document

43

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

... Biometric authentication over insecure network raises more security and privacy issues. The primary security issue is the protection of the plain biometric templates against malicious adversary because they cannot be ... See full document

10

Wireless security by handling computations

Wireless security by handling computations

... 1-out-of-2 oblivious transfer tool which plays a major role in cryptography & can build a cryptographic protocol for any polynomial-time computable function which does not depend on any ... See full document

5

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

... Yao’s approach Following the initial ideas of Yao, one can construct a two-party computation protocol from garbled circuits [33, 34] and oblivious transfer [30] (see Figure 1). The basic idea is to ... See full document

16

Exploratory designs of unconditionally secure distributed oblivious transfer protocols

Exploratory designs of unconditionally secure distributed oblivious transfer protocols

... (PIR) protocol enables a party A to retrieve one of the data items contained in a database held by a server S , in such a way that S does not learn any information on party A ’s ...PIR protocol was ... See full document

195

Universally  Composable  Efficient  Priced  Oblivious  Transfer  from  a  Flexible  Membership  Encryption

Universally Composable Efficient Priced Oblivious Transfer from a Flexible Membership Encryption

... priced oblivious transfer (POT) protocol which, unlike the existing 1-out-of-n POT schemes, is proven secure under the universally composable (UC) security model and thus preserves secu- rity when it ... See full document

20

New  Smooth  Projective  Hashing  For  Oblivious  Transfer

New Smooth Projective Hashing For Oblivious Transfer

... PAKE is proposed by Bellovin and Merritt [27] where authentication is done using a simple password, possibly drawn from a small entropy space subject to exhaustive search. SPH has been extensively used in PAKE, starting ... See full document

20

Generic  Construction  of  UC-Secure  Oblivious  Transfer

Generic Construction of UC-Secure Oblivious Transfer

... We require the chameleon hash to be verifiable by the receiver. For the sake of con- cision, we describe here the case where the chameleon hash is only verifiable by the server. In this case, we need a pre-flow, in which ... See full document

21

Analysis of an unconditionally secure distributed oblivious transfer

Analysis of an unconditionally secure distributed oblivious transfer

... In [1], Blundo et al. proposed a one-round protocol based on polynomial interpolation that satisfies the first three properties. They have stated that in DOT protocols with only one round of interaction it is ... See full document

5

Cryptographic  Reverse  Firewalls

Cryptographic Reverse Firewalls

... the protocol with non-negligible ...the protocol. For example, consider an oblivious transfer protocol in which Bob’s first message is uniformly random over some large set (as is the ... See full document

30

Are  you  The  One  to  Share?  Secret  Transfer  with  Access  Structure

Are you The One to Share? Secret Transfer with Access Structure

... secret transfer (TST), as a special case of ...to transfer a secret κ to a client if and only if their respective private sets have more than t common ...on oblivious polynomial evaluation (OPE) ... See full document

24

Feasibility   and  Infeasibility  of  Adaptively  Secure  Fully  Homomorphic  Encryption

Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption

... semi-honest oblivious transfer (OT) protocol with receiver adaptive security, (ii) a projective garbling scheme leaking only the circuit size [Yao86, BHR12], and (iii) multiple-message, ... See full document

19

LOAD CURRENT CONTROL BASED ON LUENBERGER OBSERVER FOR THREE PHASE POWER 
CONVERTER SVPWM

LOAD CURRENT CONTROL BASED ON LUENBERGER OBSERVER FOR THREE PHASE POWER CONVERTER SVPWM

... adaptive oblivious transfers that were both proposed by Herranz ...new protocol for restricted adap- tive oblivious transfer by using fully homomorphic ...our protocol is more efficient ... See full document

7

Arithmetic  Cryptography

Arithmetic Cryptography

... The IPS model. Most relevant to our work is the model suggested by Ishai, Prabhakaran and Sahai [IPS09] (hereafter referred to as the IPS model) in the context of secure multiparty com- putation. In this model the ... See full document

80

Simple  oblivious  transfer  protocols  compatible  with  Kummer   and  supersingular  isogenies

Simple oblivious transfer protocols compatible with Kummer and supersingular isogenies

... Hellman protocol is its vulnerability to quantum attacks: if quantum computers are eventually constructed, they will be able to efficiently solve the discrete logarithm problem thanks to Shor’s algorithm ... See full document

31

Generalizing  Efficient  Multiparty  Computation

Generalizing Efficient Multiparty Computation

... Preserving Oblivious Transfer (SPOT) and a generic composable constructions of Verifiable Oblivious Transfer: We introduce SPOT, which is basically a 1-out-of-2 OT compati- ble with GS-Proofs ... See full document

22

Efficient  k-out-of-n  oblivious  transfer  protocol

Efficient k-out-of-n oblivious transfer protocol

... an oblivious transfer scheme, the performance criteria involve sender's computational effort and receiver's computa- tional effort as well as the communicational cost between the sender and the ...an ... See full document

5

Show all 10000 documents...