Fixed-Point Arithmetic in Somewhat Homomorphic Encryption Schemes

Add to your list(s) Download to your calendar using vCal

• Srinivas Vivek (University of Bristol)
• Thursday 16 February 2017, 11:00-12:00
• Computer Science, The Sloman Lounge (UG).

If you have a question about this talk, please contact Andreea Radu.

Homomorphic encryption schemes allow users to meaningfully manipulate ciphertexts “without revealing” any information about the underlying plaintexts. In this work, we investigate issues related to performing fixed-point arithmetic homomorphically using existing fully/somewhat homomorphic encryption (FHE/SHE) schemes. We analyse and compare various encoding schemes to encode fractional numbers in the native algebraic plaintext space of an SHE scheme and derive bounds on the parameters to used by an SHE scheme. As an application of these bounds, we investigate homomorphic image processing and also perform an implementation using the HElib homomorphic encryption library.

This talk is part of the Computer Security Seminars series.

This talk is included in these lists:

• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Computer Science, The Sloman Lounge (UG)
• Computer Security Seminars
• computer sience

Note that ex-directory lists are not shown.