Paper 2022/386
Secure Two-party Computation Approach for NTRUEncrypt
Lin You, Yan Wang, Liang Li, and Gengran Hu
Abstract
Secure multi-party computation can provide a solution for privacy protection and ensure the correctness of the final calculation results. Lattice-based algorithms are considered to be one of the most promising post-quantum cryptographic algorithms due to a better balance among security, key sizes and calculation speeds. The NTRUEncrypt is a lattice-based anti-quantum attack cryptographic algorithm. Since there haven't been much candidate post-quantum cryptographic algorithms for secure multi-party computation. In this paper, we propose a novel secure two-party computation scheme based on NTRUEncrypt and implement the polynomial multiplication operations under NTRUEncrypt-OT. Our secure two-party computation scheme mainly uses oblivious transfer and privacy set interaction. We prove the security of our scheme in the semi-honest model. Our scheme can be applied for multi-party computation scenarios, such as quantum attack-resisted E-votes or E-auctions.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint. MINOR revision.
- Keywords
- Secure Multi-party ComputationNTRUEncryptOblivious TransferPrivacy Set IntersectionPolynomial Multiplication
- Contact author(s)
- mryoulin @ gmail com
- History
- 2022-03-28: received
- Short URL
- https://ia.cr/2022/386
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/386,
author = {Lin You and Yan Wang and Liang Li and Gengran Hu},
title = {Secure Two-party Computation Approach for {NTRUEncrypt}},
howpublished = {Cryptology {ePrint} Archive, Paper 2022/386},
year = {2022},
url = {https://eprint.iacr.org/2022/386}
}
