Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Improved Multiplication Triple Generation over Rings via RLWE-Based AHE

Deevashwer Rathee, Thomas H. Schneider, K.K. Shukla

Published Jan 1, 2019• 30 citations
Publisher
DOI
10.1007/978-3-030-31578-8_19

Related papers

RLWE-Based Zero-Knowledge Proofs for Linear and Multiplicative Relations

Ramiro Martínez, Paz Morillo

Lecture notes in computer science•Jan 1, 2019•2 citations

WINK:A Semi-Honest Secure Multi-Party Computation Framework with Efficient Comparison Protocol

Yuanqing Feng, Tao Bai, Zhi Gang Lu +3 more

Secure multi-party computation (MPC) allows multiple parties to jointly compute a task while preserving the privacy of their individual inputs. In recent years, researchers have extensively studied various security protocols to improve the efficiency of MPC and reduce communication overhead. However, the efficiency of MPC in an$n$-party setting still remains a challenge. In this paper, we introduce WINK, a MPC framework designed for the semi-honest security model that accommodates an arbitrary number of participants. We design an$n$-party multiplication protocol in the$n$-out-of-$n$arithmetic secret sharing setting and, based on this, construct independent multiplication triples. We leverage a RLWE-based oblivious linear evaluation (OLE) technique to batch generate multiplication triples between any two parties, significantly reducing communication overhead. Furthermore, we design a constant-round n-party comparison protocol based on the properties of odd-sized rings and garbled circuits. This protocol completes in only three rounds of communication with the help of additional non-colluding semi-honest servers, marking a significant improvement over previous$n$-party comparison protocols. We prove that our framework achieves universally composable security. Moreover, experimental results demonstrate that our proposed comparison protocol outperforms existing comparison protocols in terms of efficiency.

IEEE Symposium on Reliable Distributed Systems (SRDS)•Sep 29, 2025•0 citations

A New Secure Matrix Multiplication from Ring-LWE

Lihua Wang, Yoshinori Aono, Le Trieu Phong

Lecture notes in computer science•Jan 1, 2018•6 citations

RLWE-Based Homomorphic Encryption and Private Information Retrieval

Wei Zhang, Shuguang Liu, Xiaoyuan Yang

A multi-bit somewhat homomorphic encryption scheme based on Learning With Errors over Rings (RLWE) assumption is provided, which use canonical embedding to transform elements over a ring into vectors, thus the operation of polynomial multiplication can be performed within O(nlog n) scalar operations, and cipher text size is reduced as well. CPA security of this scheme can be reduced into RLWE assumption. Moreover, an efficient private information retrieval protocol that employs this scheme is presented.

International Conference on Intelligent Networking and Collaborative Systems (INCoS)•Sep 1, 2013•7 citations

Ring-LWE: Applications to Cryptography and Their Efficient Realization

Sujoy Sinha Roy, Angshuman Karmakar, Ingrid M.R. Verbauwhede

Lecture notes in computer science•Jan 1, 2016•9 citations

Highly Efficient OT-Based Multiplication Protocols

Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci +1 more

Lecture notes in computer science•Jan 1, 2022•7 citations
Secure multi-party computation (MPC) allows multiple parties to jointly compute a task while preserving the privacy of their individual inputs. In recent years, researchers have extensively studied various security protocols to improve the efficiency of MPC and reduce communication overhead. However, the efficiency of MPC in annnn-party setting still remains a challenge. In this paper, we introduce WINK, a MPC framework designed for the semi-honest security model that accommodates an arbitrary number of participants. We design annnn-party multiplication protocol in thennn-out-of-nnnarithmetic secret sharing setting and, based on this, construct independent multiplication triples. We leverage a RLWE-based oblivious linear evaluation (OLE) technique to batch generate multiplication triples between any two parties, significantly reducing communication overhead. Furthermore, we design a constant-round n-party comparison protocol based on the properties of odd-sized rings and garbled circuits. This protocol completes in only three rounds of communication with the help of additional non-colluding semi-honest servers, marking a significant improvement over previousnnn-party comparison protocols. We prove that our framework achieves universally composable security. Moreover, experimental results demonstrate that our proposed comparison protocol outperforms existing comparison protocols in terms of efficiency.
A multi-bit somewhat homomorphic encryption scheme based on Learning With Errors over Rings (RLWE) assumption is provided, which use canonical embedding to transform elements over a ring into vectors, thus the operation of polynomial multiplication can be performed within O(nlog n) scalar operations, and cipher text size is reduced as well. CPA security of this scheme can be reduced into RLWE assumption. Moreover, an efficient private information retrieval protocol that employs this scheme is presented.