A Novel k-out-of-n Oblivious Transfer Protocol from Bilinear Pairing

Table 2

Needed rounds and data size comparisons among OT^𝑛_𝑘 protocols.

Protocol	Passes	Size of message: C→S (bits)	Size of message: S→C (bits)	Mutual authentication
Ours	2	160 * (k+2)	160𝑘+𝑛∗|ciphertext|	Yes
Naor and Pinkas [7]	k* log n OT^21	depends on OT^21	depends on OT^21	No
Mu et al.’s scheme (1) [13]	3	1024k	1024𝑛+𝑛𝑘∗|ciphertext|	No
Mu et al.’s scheme (2) [13]	2	1024 * 2n	𝑛∗|ciphertext|	No
Chu and Tzeng [16]	2	1024k	1024∗(𝑘+1)+𝑛∗|ciphertext|	No
Zhang and Wang [17]	2	1024 * (k+3)	1024𝑛+𝑛∗|ciphertext|	No
Huang and Chang [18]	3	1024k	(𝑛+𝑘)∗|ciphertext|
Camenisch et al. [24]	2+𝑘∗Pok	|Pok|+𝑘∗|BlindExtract|	𝑛∗|ciphertext|+|Pok|+𝑘∗|BlindExtract|	No
Chang and Lee [27]	4	1024k	(𝑛+2𝑘+2) * 1024	No
Ma et al. [28]	𝑘∗(2+Pok)	k * 3|ciphertext|	𝑘∗(𝑛∗2|ciphertext|)	No