You are looking at a specific version 20190605:131532 of this paper. See the latest version.

Paper 2019/577

Improved Multiplication Triple Generation over Rings via RLWE-based AHE

Deevashwer Rathee and Thomas Schneider and K. K. Shukla

Abstract

An important characteristic of recent MPC protocols is an input independent preprocessing 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 preprocessing 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 the semi-honest model and the two-party setting, for which an Oblivious Transfer (OT)-based protocol is the currently best solution. To improve upon this method, we propose a protocol based on RLWE-based Additive Homomorphic Encryption. Our experiments show that our protocol is more scalable, and it outperforms the OT-based protocol in most cases. For example, we improve communication by up to 6.9x and runtime by up to 3.6x for 64-bit triple generation.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint. MINOR revision.
Keywords
Secure Two-party ComputationBeaver Multiplication TriplesRing-LWEAdditive 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
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.