Results 11  20
of
560
Oblivious Transfer with Adaptive Queries
 Proc. CRYPTO, Springer LNCS
, 1999
"... . We provide protocols for the following twoparty problem: One party, the sender, has N values and the other party, the receiver, would like to learn k of them, deciding which ones in an adaptive manner (i.e. the ith value may depend on the first i \Gamma 1 values). The sender does not want the rec ..."
Abstract

Cited by 62 (2 self)
 Add to MetaCart
the receiver to obtain more than k values. This is a variant of the well known Oblivious Transfer (OT) problem and has applications in protecting privacy in various settings. We present efficient protocols for the problem that require an O(N) computation in the preprocessing stage and fixed computation
Oblivious Transfers and Intersecting Codes
, 1996
"... Assume A owns t secret kbit strings. She is willing to disclose one of them to B, at his choosing, provided he does not learn anything about the other strings. Conversely, B does not want A to learn which secret he chose to learn. A protocol for the above task is said to implement Oneoutoft St ..."
Abstract

Cited by 52 (4 self)
 Add to MetaCart
outoft String Oblivious Transfer, denoted ( t 1 )OT k 2 . This primitive is particularly useful in a variety of cryptographic settings. An apparently simpler task corresponds to the case k = 1 and t = 2 of two onebit secrets: this is known as Oneoutoftwo Bit Oblivious Transfer, denoted ( 2 1 )OT 2
On Security of Sublinear Oblivious Transfer
, 2006
"... We study the maximal security attainable by adaptive moutofn oblivious transfer protocols with sublinear communication. It is known how to construct such protocols that are private, but not known how to construct such protocols that are (fully) secure. We define the intermediate notion of cohe ..."
Abstract
 Add to MetaCart
We study the maximal security attainable by adaptive moutofn oblivious transfer protocols with sublinear communication. It is known how to construct such protocols that are private, but not known how to construct such protocols that are (fully) secure. We define the intermediate notion
An efficient secure oblivious transfer
, 2009
"... As traditional oblivious transfer protocols are treated as a cryptographic primitive, they are usually executed without the consideration of possible attacks, e.g., impersonation, replaying, and maninthemiddle attacks. Therefore, when these protocols are applied in certain applications such as me ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
As traditional oblivious transfer protocols are treated as a cryptographic primitive, they are usually executed without the consideration of possible attacks, e.g., impersonation, replaying, and maninthemiddle attacks. Therefore, when these protocols are applied in certain applications
Oblivious Transfers and Privacy Amplification
, 1997
"... Assume A owns two secret kbit strings. She is willing to disclose one of them to B, at his choosing, provided he does not learn anything about the other string. Conversely, B does not want A to learn which secret he chose to learn. A protocol for the above task is said to implement Oneoutoftwo ..."
Abstract

Cited by 39 (8 self)
 Add to MetaCart
outoftwo String Oblivious Transfer, denoted ( 2 1 )OT k . This primitive is particularly useful in a variety of cryptographic settings. An apparently simpler task corresponds to the case k = 1 of two onebit secrets: this is known as Oneoutoftwo Bit Oblivious Transfer, denoted ( 2 1 )OT. We address
Oblivious Transfer is Symmetric
"... Abstract. We show that oblivious transfer of bits from A to B can be obtained from a single instance of the same primitive from B to A. Our reduction is perfect and shows that oblivious transfer is in fact a symmetric functionality. This solves an open problem posed by Cr'epeau and S'antha ..."
Abstract
 Add to MetaCart
Abstract. We show that oblivious transfer of bits from A to B can be obtained from a single instance of the same primitive from B to A. Our reduction is perfect and shows that oblivious transfer is in fact a symmetric functionality. This solves an open problem posed by Cr'epeau and S
On the foundations of oblivious transfer
, 1998
"... cachinlacm.org Abstract. We show that oblivious transfer can be based on a very general notion of asymmetric information difference. We investigate a Universal Oblivious Ransfer, denoted UOT(X, Y), that gives Bob the freedom to access Alice’s input X in an arbitrary way as long as he does not obtai ..."
Abstract

Cited by 30 (0 self)
 Add to MetaCart
cachinlacm.org Abstract. We show that oblivious transfer can be based on a very general notion of asymmetric information difference. We investigate a Universal Oblivious Ransfer, denoted UOT(X, Y), that gives Bob the freedom to access Alice’s input X in an arbitrary way as long as he does
On the Reversibility of Oblivious Transfer
"... A \Gamma 2 1 \Delta OT 2 (oneoutoftwo Bit Oblivious Transfer) is a technique by which a party S owning two secret bits b 0 ; b 1 , can transfer one of them b c to another party R, who chooses c. This is done in a way that does not release any bias about b ¯ c to R nor any bias about c to S. ..."
Abstract

Cited by 61 (9 self)
 Add to MetaCart
A \Gamma 2 1 \Delta OT 2 (oneoutoftwo Bit Oblivious Transfer) is a technique by which a party S owning two secret bits b 0 ; b 1 , can transfer one of them b c to another party R, who chooses c. This is done in a way that does not release any bias about b ¯ c to R nor any bias about c to S
Restricted Adaptive Oblivious Transfer
"... In this work we consider the following primitive, that we call restricted adaptive oblivious transfer. On the one hand, the owner of a database wants to restrict the access of users to this data according to some policy, in such a way that a user can only obtain information satisfying the restrictio ..."
Abstract
 Add to MetaCart
In this work we consider the following primitive, that we call restricted adaptive oblivious transfer. On the one hand, the owner of a database wants to restrict the access of users to this data according to some policy, in such a way that a user can only obtain information satisfying
Simulatable adaptive oblivious transfer
 IN EUROCRYPT
, 2007
"... We study an adaptive variant of oblivious transfer in which a sender has N messages, of which a receiver can adaptively choose to receive k oneaftertheother, in such a way that (a) the sender learns nothing about the receiver’s selections, and (b) the receiver only learns about the k requested m ..."
Abstract

Cited by 35 (1 self)
 Add to MetaCart
We study an adaptive variant of oblivious transfer in which a sender has N messages, of which a receiver can adaptively choose to receive k oneaftertheother, in such a way that (a) the sender learns nothing about the receiver’s selections, and (b) the receiver only learns about the k requested
Results 11  20
of
560