Paper 2021/857

Secure Computation for G-Module and its Applications

Qizhi Zhang, Bingsheng Zhang, Lichun Li, Shan Yin, and Juanjuan Sun


Secure computation enables two or more parties to jointly evaluate a function without revealing to each other their private input. G-module is an abelian group M, where the group G acts compatibly with the abelian group structure on M. In this work, we present several secure computation protocols for G-module operations in the online/offline mode. We then show how to instantiate those protocols to implement many widely used secure computation primitives in privacy-preserving machine learning and data mining, such as oblivious cyclic shift, one-round shared OT, oblivious permutation, oblivious shuffle, secure comparison, oblivious selection, DReLU, and ReLU, etc. All the proposed protocols are constant-round, and they are 2X - 10X more efficient than the-state-of-the-art constant-round protocols in terms of communication complexity.

Available format(s)
Cryptographic protocols
Publication info
secret sharingG-module
Contact author(s)
qizhi zqz @ antgroup com
bingsheng @ zju edu cn
2021-06-25: last of 2 revisions
2021-06-24: received
See all versions
Short URL
Creative Commons Attribution


      author = {Qizhi Zhang and Bingsheng Zhang and Lichun Li and Shan Yin and Juanjuan Sun},
      title = {Secure Computation for G-Module and its Applications},
      howpublished = {Cryptology ePrint Archive, Paper 2021/857},
      year = {2021},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.