Add to ORKGWe introduce the first efficient fully simulatable construction of oblivious transfer based on the McEliece assumptions in the common reference string model
We continue the line of work initiated by Katz (Eurocrypt 2007) on using tamper-proof hardware for u...
Abstract. We study an adaptive variant of oblivious transfer in which a sender has N messages, of wh...
Abstract. Oblivious transfer (OT) is a cryptographic primitive of cen-tral importance, in particular...
We implement one-out-of-two bit oblivious transfer (OT) based on the assumptions used in the McEliec...
We present a general framework for efficient, universally composable oblivious transfer (OT) protoco...
1 Introduction Oblivious transfer (OT) [21, 8, 27] is a cryptographic primitive of central importanc...
Oblivious transfer is widely used in secure multiparty computation. In this paper, we propose a game...
Abstract. We show that oblivious transfer of bits from A to B can be obtained from a single instance...
We present a novel scheme of noninteractive m out of n oblivious transfer, which demonstrates signif...
In this paper, a universally composable 1-out-of-N oblivious transfer protocol with low communicatio...
Abstract. We present protocols for two flavors of oblivious transfer (OT): the Rabin and 1-out-of-2 ...
Abstract. We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable s...
We describe how to construct an oblivious transfer protocol which security is based on subset member...
Abstract—We derive a new upper bound on the string oblivious transfer capacity of discrete memoryles...
This work examines the part of an asymmetric cryptography called an oblivious transfer. Our goal is ...
We continue the line of work initiated by Katz (Eurocrypt 2007) on using tamper-proof hardware for u...
Abstract. We study an adaptive variant of oblivious transfer in which a sender has N messages, of wh...
Abstract. Oblivious transfer (OT) is a cryptographic primitive of cen-tral importance, in particular...
We implement one-out-of-two bit oblivious transfer (OT) based on the assumptions used in the McEliec...
We present a general framework for efficient, universally composable oblivious transfer (OT) protoco...
1 Introduction Oblivious transfer (OT) [21, 8, 27] is a cryptographic primitive of central importanc...
Oblivious transfer is widely used in secure multiparty computation. In this paper, we propose a game...
Abstract. We show that oblivious transfer of bits from A to B can be obtained from a single instance...
We present a novel scheme of noninteractive m out of n oblivious transfer, which demonstrates signif...
In this paper, a universally composable 1-out-of-N oblivious transfer protocol with low communicatio...
Abstract. We present protocols for two flavors of oblivious transfer (OT): the Rabin and 1-out-of-2 ...
Abstract. We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable s...
We describe how to construct an oblivious transfer protocol which security is based on subset member...
Abstract—We derive a new upper bound on the string oblivious transfer capacity of discrete memoryles...
This work examines the part of an asymmetric cryptography called an oblivious transfer. Our goal is ...
We continue the line of work initiated by Katz (Eurocrypt 2007) on using tamper-proof hardware for u...
Abstract. We study an adaptive variant of oblivious transfer in which a sender has N messages, of wh...
Abstract. Oblivious transfer (OT) is a cryptographic primitive of cen-tral importance, in particular...