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 条
  • [41] Endemic Oblivious Transfer
    Mansy, Daniel
    Rindal, Peter
    PROCEEDINGS OF THE 2019 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'19), 2019, : 309 - 326
  • [42] Concurrent oblivious transfer
    Garay, JA
    MacKenzie, P
    41ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2000, : 314 - 324
  • [43] Equivocable oblivious transfer
    Beaver, D
    ADVANCES IN CRYPTOLOGY - EUROCRYPT '96, 1996, 1070 : 119 - 130
  • [44] ON THE REVERSIBILITY OF OBLIVIOUS TRANSFER
    CREPEAU, C
    SANTHA, M
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 547 : 106 - 113
  • [45] NONINTERACTIVE OBLIVIOUS TRANSFER
    HARN, L
    LIN, HY
    ELECTRONICS LETTERS, 1990, 26 (10) : 635 - 636
  • [46] Fast batch verification for modular exponentiation and digital signatures
    Bellare, M
    Garay, JA
    Rabin, T
    ADVANCES IN CRYPTOLOGY - EUROCRYPT '98, 1998, 1403 : 236 - 250
  • [47] Efficient oblivious transfer protocols
    Naor, M
    Pinkas, B
    PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 448 - 457
  • [48] Oblivious Transfer Based on NTRUEncrypt
    Mi, Bo
    Huang, Darong
    Wan, Shaohua
    Mi, Libo
    Cao, Jianqiu
    IEEE ACCESS, 2018, 6 : 35283 - 35291
  • [49] Fast exponentiation algorithms based on batch-processing and precomputation
    Tsuruoka, Y
    Koyama, K
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1997, E80A (01) : 34 - 39
  • [50] Batch PIR and Labeled PSI with Oblivious Ciphertext Compression
    Bienstock, Alexander
    Patel, Sarvar
    Seo, Joon Young
    Yeo, Kevin
    PROCEEDINGS OF THE 33RD USENIX SECURITY SYMPOSIUM, SECURITY 2024, 2024, : 5949 - 5966