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 条
  • [1] Batch Public Key Cryptosystem with batch multi-exponentiation
    Wu, Qianhong
    Sun, Yang
    Qin, Bo
    Hu, Jiankun
    Liu, Weiran
    Liu, Jianwei
    Ding, Yong
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2016, 62 : 196 - 204
  • [2] Combination in Advance Batch Multi-exponentiation on Elliptic Curve
    Tao, Rui
    Liu, Jianwei
    Su, Hang
    Sun, Yang
    Liu, Xiao
    2015 IEEE 2ND INTERNATIONAL CONFERENCE ON CYBER SECURITY AND CLOUD COMPUTING (CSCLOUD), 2015, : 411 - 416
  • [3] MULTI-EXPONENTIATION
    YEN, SM
    LAIH, CS
    LENSTRA, AK
    IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 1994, 141 (06): : 325 - 326
  • [4] Faster Multi-exponentiation through Caching: Accelerating (EC)DSA Signature Verification
    Moeller, Bodo
    Rupp, Andy
    SECURITY AND CRYPTOGRAPHY FOR NETWORKS, PROCEEDINGS, 2008, 5229 : 39 - 56
  • [5] Parallel algorithms for modular multi-exponentiation
    Borges, Fabio
    Lara, Pedro
    Portugal, Renato
    APPLIED MATHEMATICS AND COMPUTATION, 2017, 292 : 406 - 416
  • [6] Parallel computation of the multi-exponentiation for cryptosystems
    Chang, CC
    Lou, DC
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1997, 63 (1-2) : 9 - 26
  • [7] The complexity of certain multi-exponentiation techniques in cryptography
    Avanzi, RM
    JOURNAL OF CRYPTOLOGY, 2005, 18 (04) : 357 - 373
  • [8] The Complexity of Certain Multi-Exponentiation Techniques in Cryptography
    Roberto M. Avanzi
    Journal of Cryptology, 2005, 18 : 357 - 373
  • [9] Algorithms for multi-exponentiation based on complex arithmetic
    Dimitrov, VS
    Jullien, GA
    Miller, WC
    13TH IEEE SYMPOSIUM ON COMPUTER ARITHMETIC, PROCEEDINGS, 1997, : 208 - 215
  • [10] Fast modular multi-exponentiation using modified complex arithmetic
    Wu, Chia-Long
    Lou, Der-Chyuan
    Lai, Jui-Chang
    Chang, Te-Jen
    APPLIED MATHEMATICS AND COMPUTATION, 2007, 186 (02) : 1065 - 1074