• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Zhao Shengnan, Jiang Han, Wei Xiaochao, Ke Junming, Zhao Minghao. An Efficient Single Server-Aided k-out-of-n Oblivious Transfer Protocol[J]. Journal of Computer Research and Development, 2017, 54(10): 2215-2223. DOI: 10.7544/issn1000-1239.2017.20170463
Citation: Zhao Shengnan, Jiang Han, Wei Xiaochao, Ke Junming, Zhao Minghao. An Efficient Single Server-Aided k-out-of-n Oblivious Transfer Protocol[J]. Journal of Computer Research and Development, 2017, 54(10): 2215-2223. DOI: 10.7544/issn1000-1239.2017.20170463

An Efficient Single Server-Aided k-out-of-n Oblivious Transfer Protocol

More Information
  • Published Date: September 30, 2017
  • Oblivious transfer (OT) is a cryptographic primitive used for choice information hiding for the receiver. As a basic tool for high-level multi-party cryptographic protocol construction, it plays an important role in numerous specific applications. In the k-out-of-n OT(OT\+k\-n), the receiver acquires k selections among the n choice in an oblivious manner. Generally, the construction of the OT\+k\-n involves lots of group exponential operations, which brings a heavy burden for embedded devices with limited computational capabilities. With the proliferation of cloud computing, it is feasible to implement complex cryptographic primitives with the support of powerful computing recourse and high-speed dedicated network provided by the cloud service provider (CSP). In this paper, we propose a service-assisted k-out-of-n OT protocol in single server architecture, which outsources the vast majority of exponentiation operations to the cloud. This scheme is constructed with secret sharing and other fundamental public-key primitives, and it achieves provable security on none-collusion semi-honest model under the decisional Diffie-Hellamn (DDH) hard problem; meanwhile it ensures data privacy against the cloud server. Besides, a detailed description of scheme construction and security proof is presented in the context. As a basic cryptographic primitive in cloud environment, the single server-added oblivious transfer protocol will play an important role in designs of general cloud-assisted multi-party computation protocol as well as developments of secure and efficient cloud service software.
  • Related Articles

    [1]Zhang Zhenyu, Jiang Yuan. Label Noise Robust Learning Algorithm in Environments Evolving Features[J]. Journal of Computer Research and Development, 2023, 60(8): 1740-1753. DOI: 10.7544/issn1000-1239.202330238
    [2]Liu Biao, Zhang Fangjiao, Wang Wenxin, Xie Kang, Zhang Jianyi. A Byzantine-Robust Federated Learning Algorithm Based on Matrix Mapping[J]. Journal of Computer Research and Development, 2021, 58(11): 2416-2429. DOI: 10.7544/issn1000-1239.2021.20210633
    [3]LiJin, YueKun, ZhangDehai, LiuWeiyi. Robust Influence Blocking Maximization in Social Networks[J]. Journal of Computer Research and Development, 2016, 53(3): 601-610. DOI: 10.7544/issn1000-1239.2016.20148341
    [4]Zhang Jing, Feng Lin. An Algorithm of Robust Online Extreme Learning Machine for Dynamic Imbalanced Datasets[J]. Journal of Computer Research and Development, 2015, 52(7): 1487-1498. DOI: 10.7544/issn1000-1239.2015.20140182
    [5]Qin Chuan, Chang Chin Chen, Guo Cheng. Perceptual Robust Image Hashing Scheme Based on Secret Sharing[J]. Journal of Computer Research and Development, 2012, 49(8): 1690-1698.
    [6]Fan Zhiqiang and Zhao Qinping. A Data-Clustering Based Robust SIFT Feature Matching Method[J]. Journal of Computer Research and Development, 2012, 49(5): 1123-1129.
    [7]Zhao Qiyang and Yin Baolin. On the Luminance Overflow in Spread Spectrum Robust Image Watermarking Schemes[J]. Journal of Computer Research and Development, 2009, 46(10): 1729-1736.
    [8]Wang Xiangyang, Hou Limin, Yang Hongying. A Robust Watermarking Scheme Based on Image Feature and PseudoZernike Moments[J]. Journal of Computer Research and Development, 2008, 45(5): 772-778.
    [9]Hu Yusuo and Chen Zonghai. A Novel Robust Estimation Algorithm Based on Linear EIV Model[J]. Journal of Computer Research and Development, 2006, 43(3): 483-488.
    [10]Liu Yi, Wang Yumin. A Robust Itinerary Protection Based on Mobile Agents[J]. Journal of Computer Research and Development, 2005, 42(12): 2106-2110.

Catalog

    Article views (1530) PDF downloads (603) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return