High-Precision Arithmetic in Homomorphic Encryption
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 34960109
- Type
- E - Conference contribution
- DOI
-
10.1007/978-3-319-76953-0_7
- Title of conference / published proceedings
- Topics in Cryptology – CT-RSA 2018 : The Cryptographers' Track at the RSA Conference 2018, San Francisco, CA, USA, April 16-20, 2018, Proceedings
- First page
- 116
- Volume
- 10808
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- March
- Year of publication
- 2018
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
-
- Citation count
- 7
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper presents a new variant of the FV homomorphic encryption scheme which gives a convenient encoding for integer and rational number raw data. Further, we show that the new scheme is more performant, in that it enables evaluation of deeper circuits than FV in the same parameter setting (e.g. depth 14 instead of depth 4). We additionally propose a new model of noise for FV, which simplifies analysis and has been relied upon in several subsequent works. Published in a leading venue with citations as of May 2020.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -