Practical homomorphic encryption over the integers for secure computation in the cloud
- Submitting institution
-
The University of Huddersfield
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 54
- Type
- D - Journal article
- DOI
-
10.1007/s10207-019-00427-0
- Title of journal
- International Journal of Information Security
- Article number
- -
- First page
- 549
- Volume
- 18
- Issue
- 5
- ISSN
- 1615-5262
- Open access status
- Technical exception
- Month of publication
- February
- Year of publication
- 2019
- 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
-
2
- Research group(s)
-
-
- Citation count
- 2
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Developed from Dyer’s previous IMA Cryptography & Coding 2017 paper, this completed research outlines several related somewhat homomorphic encryption schemes over the integers. The schemes in the paper outperform similar systems in the literature by factors of 1,000,000 to 1,000 depending on the security and complexity of the individual scheme. Just as significantly, cryptanalysis within Sanyashi, Desai and Menezes’s paper “Cryptanalysis of Homomorphic Encryption Schemes based on the Aproximate GCD Problem” https://www.scitepress.org/Papers/2019/80716/80716.pdf, showed that Dyer's HE2/N schemes could not be broken by the authors.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -