Cryptology ePrint Archive: Report 2021/857

Secure Computation for G-Module and its Applications

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

Abstract: 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.

Category / Keywords: cryptographic protocols / secret sharing, G-module

Date: received 23 Jun 2021, last revised 24 Jun 2021

Contact author: qizhi zqz at antgroup com,bingsheng@zju edu cn

Available format(s): PDF | BibTeX Citation

Version: 20210625:032746 (All versions of this report)

Short URL: ia.cr/2021/857


[ Cryptology ePrint archive ]