A Full RNS Variant of FV like Somewhat Homomorphic Encryption SchemesExport this event to calendar

Thursday, November 24, 2016 — 2:30 PM to 3:30 PM EST

ECE Seminar

Julien Eynard

Title

A Full RNS Variant of FV like Somewhat Homomorphic Encryption Schemes

Invited by Professor Anwar Hasan

All are welcome!

Abstract

Homomorphic encryption (HE) enables arithmetic operations in the encrypted domain and hence makes it possible to secure outsourced computations. Gentry's breakthrough work in 2009 opened the way to the development of fully HE schemes, allowing the possibility of unlimited number of additions and multiplications on encrypted data. However,
practicality of such schemes still remains severely restricted due to their poor performance. For this reason, somewhat homomorphic encryption (SHE) schemes, which support only a limited number of operations but offer much better performance, are considered suitable for a variety of practical applications.
Many of the leading SHE schemes proposed so far rely on Ring Learning With Errors (RLWE) problems. For such schemes the underlying operations occur on high-degree polynomials with large coefficients. Various techniques are applied to improve the performance of polynomial and integer arithmetic. For instance, the Residue Number Systems (RNS) can be applied to large coefficients. In SHE schemes like that of Fan and
Vercauteren (FV), such a representation has been exploited to a limited extent only, since RNS is hardly compatible with coefficient-wise division and rounding required in decryption and homomorphic multiplication. Thus, costly switching between RNS and classical positional representation is still used for such operations. In our recent work, we show how to entirely eliminate the need for multi-precision arithmetic in FV like schemes. We present a full RNS implementation of FV. For realistic parameters, we report speedups from 5x to 20x (resp. 2x to 4x) for software implementation of decryption (resp.homomorphic multiplication).

Biography:

Dr. Julien Eynard is a post-doctoral fellow in the Department of Electrical and Computer Engineering at the University of Waterloo, and hosted by Prof. Anwar Hasan. Dr. Eynardreceived his MSc (2011) at University Joseph Fourier (Grenoble, France), and obtained a PhD (2015) from University Pierre and Marie Curie (Paris, France). His interests are
related to applied cryptography focussing on acceleration of cryptographic algorithms and their protection against side channel attacks.

Cost 
Free
Location 
EIT - Centre for Environmental and Information Technology
EIT 3142
200 University Avenue West

Waterloo, ON N2L 3G1
Canada

S M T W T F S
28
29
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
  1. 2019 (194)
    1. December (1)
    2. November (1)
    3. October (1)
    4. September (1)
    5. August (26)
    6. July (40)
    7. June (24)
    8. May (23)
    9. April (35)
    10. March (25)
    11. February (9)
    12. January (10)
  2. 2018 (150)
    1. December (13)
    2. November (25)
    3. October (12)
    4. September (13)
    5. August (7)
    6. July (23)
    7. June (9)
    8. May (6)
    9. April (9)
    10. March (16)
    11. February (10)
    12. January (7)
  3. 2017 (212)
  4. 2016 (242)
  5. 2015 (242)
  6. 2014 (268)
  7. 2013 (192)
  8. 2012 (31)