Paper 2019/577
Improved Multiplication Triple Generation over Rings via RLWE-based AHE
Deevashwer Rathee, Thomas Schneider, and K. K. Shukla
Abstract
An important characteristic of recent MPC protocols is an input-independent setup phase in which most computations are offloaded, which greatly reduces the execution overhead of the online phase where parties provide their inputs. For a very efficient evaluation of arithmetic circuits in an information-theoretic online phase, the MPC protocols consume Beaver multiplication triples generated in the setup phase. Triple generation is generally the most expensive part of the protocol, and improving its efficiency is the aim of our work.
We specifically focus on computation over rings of the form
Note: The runtime of initialization phase for RLWE-AHE based generation has decreased significantly, and has become much smaller than that of OT based generation for the faster network settings.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Major revision. CANS'19
- DOI
- 10.1007/978-3-030-31578-8_19
- Keywords
- Secure Two-party ComputationBeaver Multiplication TriplesRing-LWEAdditively Homomorphic Encryption
- Contact author(s)
- deevashwer student cse15 @ iitbhu ac in
- History
- 2019-10-29: last of 3 revisions
- 2019-05-28: received
- See all versions
- Short URL
- https://ia.cr/2019/577
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/577, author = {Deevashwer Rathee and Thomas Schneider and K. K. Shukla}, title = {Improved Multiplication Triple Generation over Rings via {RLWE}-based {AHE}}, howpublished = {Cryptology {ePrint} Archive, Paper 2019/577}, year = {2019}, doi = {10.1007/978-3-030-31578-8_19}, url = {https://eprint.iacr.org/2019/577} }