113 Hits in 10.5 sec

Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds [chapter]

Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, Malika Izabachène
2016 Lecture Notes in Computer Science  
As a result, we obtain a speed up from less than 1 second to less than 0.1 seconds.  ...  In this paper, we revisit fully homomorphic encryption (FHE) based on GSW and its ring variants.  ...  Acknowledgements This work has been supported in part by the CRYPTO-COMP project.  ... 
doi:10.1007/978-3-662-53887-6_1 fatcat:t4z76ghccbbulot4ousstoan7a

Logistic regression over encrypted data from fully homomorphic encryption

Hao Chen, Ran Gilad-Bachrach, Kyoohyung Han, Zhicong Huang, Amir Jalali, Kim Laine, Kristin Lauter
2018 BMC Medical Genomics  
Methods: Our solution to this problem has several novelties: we use a multi-bit plaintext space in fully homomorphic encryption together with fixed point number encoding; we combine bootstrapping in fully  ...  homomorphic encryption, and send them to an untrusted cloud for storage.  ...  Since the unencrypted computation in MATLAB is several orders of magnitude faster than the encrypted computation (less than 1 second), we decided not to compare the unencrypted and encrypted running times  ... 
doi:10.1186/s12920-018-0397-z pmid:30309350 pmcid:PMC6180402 fatcat:lkncb3c6mvcmlf3usn4tjptebm

Glyph: Fast and Accurately Training Deep Neural Networks on Encrypted Data [article]

Qian Lou and Bo Feng and Geoffrey C. Fox and Lei Jiang
2020 arXiv   pre-print
To train a DNN on encrypted data in a completely non-interactive way, a recent work proposes a fully homomorphic encryption (FHE)-based technique implementing all activations in the neural network by Brakerski-Gentry-Vaikuntanathan  ...  In this paper, we propose, Glyph, a FHE-based scheme to fast and accurately train DNNs on encrypted data by switching between TFHE (Fast Fully Homomorphic Encryption over the Torus) and BGV cryptosystems  ...  As Table 1 shows, BGV computes MultCPs and MultCCs faster than BFV, because it has less scaling operations [12, 13] .  ... 
arXiv:1911.07101v3 fatcat:ynxlpeuu7reiplsstlnbteppjq

Toward Scalable Fully Homomorphic Encryption Through Light Trusted Computing Assistance [article]

Wenhao Wang, Yichen Jiang, Qintao Shen, Weihao Huang, Hao Chen, Shuang Wang, XiaoFeng Wang, Haixu Tang, Kai Chen, Kristin Lauter, Dongdai Lin
2019 arXiv   pre-print
While fully homomorphic encryption (FHE) is a promising technique that allows computations performed on the encrypted data, it suffers from a significant slow down to the computation.  ...  In this paper we propose a hybrid solution that uses the latest hardware Trusted Execution Environments (TEEs) to assist FHE by moving the bootstrapping step, which is one of the major obstacles in designing  ...  Overall, the computation in TEEFHE is about 2 orders faster and the memory usage is less than 1% of the software only implementation.  ... 
arXiv:1905.07766v1 fatcat:e5h56qsfoneyzlob2wlzg4j6fi

Performance of Adder Architectures on Encrypted Integers

Paulin Boale B., Lecturer & Ph.D, Department of Mathematics and Computers Sciences. University of Kinshasa. Congo - Kinshasa., Simon Ntumba B., Eugene Mbuyi M, Professor and head Department of Mathematic and Computers Sciences University of Kinshasa. Congo - Kinshasa., Professor, Department of Mathematic and Computers Sciences University of Kinshasa. Congo - Kinshasa.
2021 International Journal of Engineering and Advanced Technology  
The fully Homomorphic encryption scheme is corner stone of privacy in an increasingly connected world. It allows to perform all kinds of computations on encrypted data.  ...  In this paper, a brief description is made on the homomorphic encryption scheme TFHE of Illaria Chillota and the others.  ...  TFHE is an open source library for fully homomorphic encryption distributed under the terms of the Apache 2.0 license.  ... 
doi:10.35940/ijeat.f3083.0810621 fatcat:nrinsrgktzecbhnesv746qt25i

Encrypted accelerated least squares regression [article]

Pedro M. Esperança, Louis J. M. Aslett, Chris C. Holmes
2017 arXiv   pre-print
under a fully homomorphic encryption scheme.  ...  Information that is stored in an encrypted format is, by definition, usually not amenable to statistical analysis or machine learning methods.  ...  Fully Homomorphic encryption An encryption scheme is said to be fully homomorphic if it also possesses two operations, ⊕ and ⊗, which satisfy the following identities: Dec(k s , Enc(k p , m 1 ) ⊕ Enc(k  ... 
arXiv:1703.00839v1 fatcat:2gdixsvw2ver7cj3pmrngrgaam

F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption (Extended Version) [article]

Axel Feldmann, Nikola Samardzic, Aleksandar Krastev, Srini Devadas, Ron Dreslinski, Karim Eldefrawy, Nicholas Genise, Chris Peikert, Daniel Sanchez
2021 arXiv   pre-print
Fully Homomorphic Encryption (FHE) allows computing on encrypted data, enabling secure offloading of computation to untrusted serves.  ...  Though it provides ideal security, FHE is expensive when executed in software, 4 to 5 orders of magnitude slower than computing on unencrypted data.  ...  Overall, instruction fetches consume less than 0.1% of memory traffic. Register file (RF) design: Each cluster in F1 requires 10 read ports and 6 write ports to keep all FUs busy.  ... 
arXiv:2109.05371v2 fatcat:i2577nw2mrafvkp75zokllu72q

TAPAS: Tricks to Accelerate (encrypted) Prediction As a Service [article]

Amartya Sanyal and Matt J. Kusner and Adrià Gascón and Varun Kanade
2018 arXiv   pre-print
The main drawback of using fully homomorphic encryption is the amount of time required to evaluate large machine learning models on encrypted data.  ...  Fully homomorphic encryption offers a possible way out, whereby clients may encrypt their data, and on which the server may perform arithmetic computations.  ...  Acknowledgments The authors would like to thank Nick Barlow and Oliver Strickson for their support in using the SHEEP platform.  ... 
arXiv:1806.03461v1 fatcat:qt4mamav7fcp5hkgh3k54k63z4

Survey on Securing IoT Data using Homomorphic Encryption Scheme

Anita Chaudhari, Rajesh Bansode
2021 International Journal of Engineering and Advanced Technology  
Based on the analysis minimum computation time is 0.25 Second required for ECC based homomorphic encryption (HE).  ...  In today's world everyone is using cloud services. Every user uploads his/her sensitive data on cloud in encrypted form.  ...  Fully HE is a solution on encrypted data, to secure cloud confidentiality, however, fully HE runs slow and the faster fully HE systems are needed.  ... 
doi:10.35940/ijeat.d2333.0410421 fatcat:gb3e7kdrzzbdbh6cjwynqmxkom

Implementing Gentry's Fully-Homomorphic Encryption Scheme [chapter]

Craig Gentry, Shai Halevi
2011 Lecture Notes in Computer Science  
We describe a working implementation of a variant of Gentry's fully homomorphic encryption scheme (STOC 2009), similar to the variant used in an earlier implementation effort by Smart and Vercauteren (  ...  Other optimizations include a batching technique for encryption, a careful analysis of the degree of the decryption polynomial, and some space/time trade-offs for the fully-homomorphic scheme.  ...  scheme and a fully homomorphic scheme.  ... 
doi:10.1007/978-3-642-20465-4_9 fatcat:2xjet3nvmracjco2ylyb7o4zf4

Falcon: Fast Spectral Inference on Encrypted Data

Qian Lou, Wen-jie Lu, Cheng Hong, Lei Jiang
2020 Neural Information Processing Systems  
In the HE-based MLaaS setting, a client encrypts the sensitive data, and uploads the encrypted data to the server that directly processes the encrypted data without decryption, and returns the encrypted  ...  We also propose several efficient methods to reduce inference latency, including Homomorphic Spectral Convolution and Homomorphic Spectral Fully Connected operations by combining the batched HE and block-circulant  ...  Flacon has k× less noise increase than LoLa.  ... 
dblp:conf/nips/LouLH020 fatcat:qrzypbcm7vgx7fci5mhqdjd3my

Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes [article]

Pierre-Alain Fouque, Benjamin Hadjibeyli, Paul Kirchner
2018 IACR Cryptology ePrint Archive  
Optimizing performance of Fully Homomorphic Encryption (FHE) is nowadays an active trend of research in cryptography.  ...  We show that they have lower multiplicative depth than usual block ciphers, and hence allow more FHE operations before a heavy bootstrapping becomes necessary.  ...  The schemes based on LWR can have running time down to less than a microsecond per bit. Their total running time is less than a second for standard version and around 25 seconds for ring versions.  ... 
dblp:journals/iacr/FouqueHK18 fatcat:ryrx3yaeujdibaywyzysoteoiu

Fast Private Set Intersection from Homomorphic Encryption

Hao Chen, Kim Laine, Peter Rindal
2017 Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security - CCS '17  
We use fully homomorphic encryption to construct a fast PSI protocol with a small communication overhead that works particularly well when one of the two sets is much smaller than the other.  ...  The approach we take is similar, except that we use homomorphic encryption in place of OT. Another OT-based approach was introduced by Dong et al.  ...  Conclusions Although there has been huge progress in lattice-based fully homomorphic encryption schemes since the groundbreaking work of Craig Gentry in 2009, it is still believed by many to be too expensive  ... 
doi:10.1145/3133956.3134061 dblp:conf/ccs/ChenLR17 fatcat:djnzrezqenblplkkhklikequli

BTS: An Accelerator for Bootstrappable Fully Homomorphic Encryption [article]

Sangpyo Kim and Jongmin Kim and Michael Jaemin Kim and Wonkyung Jung and Minsoo Rhu and John Kim and Jung Ho Ahn
2021 arXiv   pre-print
Homomorphic encryption (HE) enables secure offloading of computation to the cloud by providing computation on encrypted data (ciphertexts).  ...  Bootstrapping enables an unlimited number of operations or fully HE (FHE) by refreshing the ciphertext.  ...  CONCLUSION We have proposed an accelerator architecture for fully homomorphic encryption (FHE), primarily optimized for the throughput of bootstrapping encrypted data.  ... 
arXiv:2112.15479v1 fatcat:34kvgmm6ajdrxczele5ti3gm34

Efficient Privacy-Preserving Fingerprint-Based Authentication System Using Fully Homomorphic Encryption

Taeyun Kim, Yongwoo Oh, Hyoungshick Kim
2020 Security and Communication Networks  
In this paper, we present an efficient privacy-preserving fingerprint authentication system using a fully homomorphic encryption scheme in which fingerprint data are always stored and processed in an encrypted  ...  We implement a fully working fingerprint authentication system with a fingerprint database (containing 4,000 samples) using the Fast Fully Homomorphic Encryption over the Torus (TFHE) library.  ...  As part of future work, we plan to further optimize the performance of bootstrapping operation which is the most time-consuming step in fully homomorphic encryption schemes.  ... 
doi:10.1155/2020/4195852 fatcat:7a54ead3rzezvad5s4uw76dd3e
« Previous Showing results 1 — 15 out of 113 results