Presentation 2000/9/21
An approximate scheme of oblivious transfer with probabilistic receipt
Shouichi Hirose, Susumu Yoshida,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this manuscript, we propose an efficient scheme which achieves the oblivious transfer with probabilistic receipt, α-OT, approximately for 0<α<1. First, we present an efficient scheme which approximates α-OT with 2^<-i>-OT's for i=1, 2, ..., k. The proposed scheme implements γ-OT for some γ such that (α-2^<-k>)/(1-2^<-k>)<γ≤α with ⌊-log(1-α)⌋ invocations of 2^<-1>-OT and at most 2 invocations of 2^<-i>-OT for i=2, ..., k. These OT's can be executed in parallel. Second, we show an efficient scheme which achieves 2^<-i>-OT based on discrete logarithms. The proposed 2^<-i>-OT scheme is a two-move protocol initiated by the receiver. We also analyze the security of the scheme against the computationally unbounded sender and the computationally bounded receiver.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Oblivious transfer / Approximation / Discrete logarithms / Diffie-Hellman problem
Paper # ISEC2000-63
Date of Issue

Conference Information
Committee ISEC
Conference Date 2000/9/21(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) An approximate scheme of oblivious transfer with probabilistic receipt
Sub Title (in English)
Keyword(1) Oblivious transfer
Keyword(2) Approximation
Keyword(3) Discrete logarithms
Keyword(4) Diffie-Hellman problem
1st Author's Name Shouichi Hirose
1st Author's Affiliation Department of Communications and Computer Engineering, Graduate School of Informatics, Kyoto University()
2nd Author's Name Susumu Yoshida
2nd Author's Affiliation Department of Communications and Computer Engineering, Graduate School of Informatics, Kyoto University
Date 2000/9/21
Paper # ISEC2000-63
Volume (vol) vol.100
Number (no) 323
Page pp.pp.-
#Pages 8
Date of Issue