Accelerating Oblivious Transfer with Batch Multi-exponentiation

被引:4
|
作者
Sun, Yang [1 ,5 ]
Wu, Qianhong [1 ,6 ]
Liu, Jingwen [2 ]
Liu, Jianwei [1 ]
Huang, Xinyi [3 ]
Qin, Bo [4 ,6 ]
Hu, Wei [2 ]
机构
[1] Beihang Univ, Sch Elect & Informat Engn, Beijing, Peoples R China
[2] Potevio Informat Technol Co Ltd, Beijing, Peoples R China
[3] Fujian Normal Univ, Sch Math & Comp Sci, Fujian Prov Key Lab Network Secur & Cryptol, Fuzhou, Peoples R China
[4] Renmin Univ China, Sch Informat, Minist Educ, Key Lab Data Engn & Knowledge Engn, Beijing, Peoples R China
[5] Xidian Univ, State Key Lab Integrated Serv Networks, Xian, Peoples R China
[6] Chinese Acad Sci, Inst Informat Engn, State Key Lab Informat Secur, Beijing 100093, Peoples R China
来源
关键词
MODULAR MULTIPLICATION; VERIFICATION; ALGORITHMS;
D O I
10.1007/978-3-319-40253-6_19
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
More and more people use smart end devices to retrieve digital items and purchase on the Internet. Oblivious transfer (OT) is a fundamental tool to protect user privacy in such applications. Most existing works devote to improving the communication performance of OT protocols; few work has been done to improve the computation efficiency. Modular exponentiation is the most frequent operation in OT protocols. It is known that the computation cost of any OT protocol must be linear with the database size; speeding up the exponentiations is critical for OT protocols to be deployed in practice. To this end, we investigate batch multi-exponentiation algorithms and propose two new algorithms. Then we apply our batch multi-exponentiation algorithms to acceleration of OT protocols. Our approach is especially useful for the k-out-n OT. We also exploit the algorithm to speed up simultaneous execution of 1-out-n OT protocols which we called batch OT. We conduct a series of experiments and the experimental results show that our approach is effective and can significantly accelerate OT protocols.
引用
收藏
页码:310 / 326
页数:17
相关论文
共 50 条
  • [31] On Oblivious Transfer Capacity
    Ahlswede, R.
    Csiszar, I.
    ITW: 2009 IEEE INFORMATION THEORY WORKSHOP ON NETWORKING AND INFORMATION THEORY, 2009, : 1 - +
  • [32] Oblivious transfer with verification
    Kak, Subhash (subhash.kak@okstate.edu), 1600, Scientific Association for Infocommunications (09):
  • [33] Distributed oblivious transfer
    Naor, M
    Pinkas, B
    ADVANCES IN CRYPTOLOGY ASIACRYPT 2000, PROCEEDINGS, 2000, 1976 : 205 - 219
  • [34] On oblivious transfer capacity
    Ahlswede, R.
    Csiszar, I.
    2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 2061 - +
  • [35] Network Oblivious Transfer
    Kumaresan, Ranjit
    Raghuraman, Srinivasan
    Sealfon, Adam
    ADVANCES IN CRYPTOLOGY (CRYPTO 2016), PT II, 2016, 9815 : 366 - 396
  • [36] Precomputing oblivious transfer
    Beaver, D
    ADVANCES IN CRYPTOLOGY - CRYPTO '95, 1995, 963 : 97 - 109
  • [37] Independent oblivious transfer
    Department of Computer Science and Engineering, Fudan University, Shanghai 200433, China
    Ruan Jian Xue Bao, 2007, 4 (1015-1025):
  • [38] Oblivious Transfer Is in MiniQCrypt
    Grilo, Alex B.
    Lin, Huijia
    Song, Fang
    Vaikuntanathan, Vinod
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2021, PT II, 2021, 12697 : 531 - 561
  • [39] Oblivious transfer is symmetric
    Wolf, Stefan
    Wullschleger, Juerg
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2006, PROCEEDINGS, 2006, 4004 : 222 - 232
  • [40] QUANTUM OBLIVIOUS TRANSFER
    CREPEAU, C
    JOURNAL OF MODERN OPTICS, 1994, 41 (12) : 2445 - 2454