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
来源
INFORMATION SECURITY AND PRIVACY, PT I | 2016年 / 9722卷
关键词
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
相关论文
共 45 条
  • [1] Aiello B, 2001, LECT NOTES COMPUT SC, V2045, P119
  • [2] [Anonymous], 2014, ART COMPUTER PROGRAM
  • [3] [Anonymous], LNCS
  • [4] Avanzi R.M., 2002, MULTIEXPONENTIAT CRY
  • [5] Bellare M, 1998, LECT NOTES COMPUT SC, V1403, P236, DOI 10.1007/BFb0054130
  • [6] Bellare M., 1989, P ANN INT CRYPT C SA, P547, DOI DOI 10.1007/0-387-34805-0_48
  • [7] BOS J, 1990, LECT NOTES COMPUT SC, V435, P400
  • [8] BRASSARD G, 1987, LECT NOTES COMPUT SC, V263, P234
  • [9] Brickell E., 1992, EUROCRYPT 92 LNCS, V658, P200
  • [10] Batch Verification of Short Signatures
    Camenisch, Jan
    Hohenberger, Susan
    Pedersen, Michael Ostergaard
    [J]. JOURNAL OF CRYPTOLOGY, 2012, 25 (04) : 723 - 747