Paillier Cryptosystem Optimisations for Homomorphic Computation.
Loading...
Date
2022
Authors
ORCID
Advisor
Referee
Mark
Journal Title
Journal ISSN
Volume Title
Publisher
Vysoké učení technické v Brně, Fakulta elektrotechniky a komunikačních technologií
Abstract
Homomorphic encryptions can ensure privacy in systems operating with sensitive data. It also allows outsourcing the data processing without the need to disclose the information within. To keep good performance over the growing mass of data, the execution of homomorphic schemes has to be efficient. In this article, we focus on the optimization of the Paillier scheme. This scheme allows the addition of a constant or another ciphertext without decryption of the encrypted values. Since the exponentiation used in the encryption process is time-consuming, we have implemented noise and message pre-computation to avoid time-demanding operations. These adjustments significantly fasten the encryption process, especially using the noise pre-computation.
Description
Citation
Proceedings I of the 28st Conference STUDENT EEICT 2022: General papers. s. 287-290. ISBN 978-80-214-6029-4
https://conf.feec.vutbr.cz/eeict/index/pages/view/ke_stazeni
https://conf.feec.vutbr.cz/eeict/index/pages/view/ke_stazeni
Document type
Peer-reviewed
Document version
Published version
Date of access to the full text
Language of document
en
Study field
Comittee
Date of acceptance
Defence
Result of defence
Document licence
© Vysoké učení technické v Brně, Fakulta elektrotechniky a komunikačních technologií