314 Hits in 2.8 sec

FHE Circuit Privacy Almost for Free [chapter]

Florian Bourse, Rafaël Del Pino, Michele Minelli, Hoeteck Wee
2016 Lecture Notes in Computer Science  
In particular, we show that a variant of the GSW FHE for branching programs already achieves circuit privacy; this immediately yields a circuit-private FHE for NC 1 circuits under the standard LWE assumption  ...  Circuit privacy is an important property for many applications of fully homomorphic encryption.  ...  Acknowledgements We thank Vinod Vaikuntanathan for insightful discussions, as well as Damien Stehlé and the organizers of the HEAT summer school where this research started.  ... 
doi:10.1007/978-3-662-53008-5_3 fatcat:ndnbojbubzglncptuxhwdyivj4

Maliciously Circuit-Private FHE [chapter]

Rafail Ostrovsky, Anat Paskin-Cherniavsky, Beni Paskin-Cherniavsky
2014 Lecture Notes in Computer Science  
We present a framework for transforming FHE (fully homomorphic encryption) schemes with no circuit privacy requirements into maliciously circuit-private FHE.  ...  Previous literature on FHE only considered semi-honest circuit privacy. Circuitprivate FHE schemes have direct applications to computing on encrypted data.  ...  Privacy against a malicious sender comes "for free", as the protocol is 2-round, and the client speaks first.  ... 
doi:10.1007/978-3-662-44371-2_30 fatcat:eas77tpz3fg6xjpipy7gsczuje

Challenges of Fully Homomorphic Encryptions for the Internet of Things

Licheng WANG, Jing LI, Haseeb AHMAD
2016 IEICE transactions on information and systems  
In particular, some issues about designing noise-free FHE schemes would be addressed. key words: Internet of Things (IoT), fully homomorphic encryption (FHE), challenges, cloud * In a modern hospital,  ...  Although the concept of privacy homomorphism was proposed along with the birth of the well-known RSA cryptosystems, cryptographers over the world have spent about three decades for finding the first implementation  ...  Therefore, it is interesting to seek noise-free designs of FHE schemes.  ... 
doi:10.1587/transinf.2015ini0003 fatcat:zx3mj3425fbb5exactwj4sm3fm

Practical Privacy-Preserving Medical Diagnosis Using Homomorphic Encryption

Sergiu Carpov, Thanh Hai Nguyen, Renaud Sirdey, Gianpiero Constantino, Fabio Martinelli
2016 2016 IEEE 9th International Conference on Cloud Computing (CLOUD)  
However, when personal data are sent to the Cloud, users may lose privacy on the datacontent, and on the other side cloud providers may use those data for their own businesses.  ...  Our solution make use of Fully Homomorphic Encryption (FHE) to protect users' data during the analysis.  ...  of FHE, a compiler chain targeting FHE execution has to manipulate Boolean circuits.  ... 
doi:10.1109/cloud.2016.0084 dblp:conf/IEEEcloud/CarpovNSCM16 fatcat:knosxluxinhpvnuddzap2v3ifu

Sanitization of FHE Ciphertexts [chapter]

Léo Ducas, Damien Stehlé
2016 Lecture Notes in Computer Science  
In particular, the distribution of the ciphertext does not depend on the circuit that led to it via homomorphic evaluation, thus providing circuit privacy in the honestbut-curious model.  ...  By definition, fully homomorphic encryption (FHE) schemes support homomorphic decryption, and all known FHE constructions are bootstrapped from a Somewhat Homomorphic Encryption (SHE) scheme via this technique  ...  This technique almost provides a solution to a problem suggested by Gentry in [Gen09a, page 30], stating that bootstrapping could imply circuit privacy.  ... 
doi:10.1007/978-3-662-49890-3_12 fatcat:wqv257smnzezdbf5f36hdywph4

A Survey of Homomorphic Encryption for Outsourced Big Data Computation

2016 KSII Transactions on Internet and Information Systems  
However, this outsourced initiative introduces a number of security and privacy concerns.  ...  Finally, this paper discusses the current implementation, challenges, and future direction towards a practical homomorphic encryption scheme for securing outsourced Big Data computation.  ...  The author also thanks the anonymous reviewers of the paper for their careful reviews and valuable comments  ... 
doi:10.3837/tiis.2016.08.022 fatcat:plj6fns2l5b6xilzr3kmr3sw4u

Spooky Encryption and Its Applications [chapter]

Yevgeniy Dodis, Shai Halevi, Ron D. Rothblum, Daniel Wichs
2016 Lecture Notes in Computer Science  
Lastly, it immediately yields a function secret sharing (FSS) scheme for all functions. We also define a notion of spooky-free encryption, which ensures that no spooky relationship is achievable.  ...  [ABOR00] for building arguments for NP from homomorphic encryption.  ...  Acknowledgments This work was done in part while the authors were visiting the Simons Institute for the Theory of Computing, supported by the Simons Foundation and by the DIMACS/Simons Collaboration in  ... 
doi:10.1007/978-3-662-53015-3_4 fatcat:oey3p4bthvasnd3bksxsy4imi4

On the Efficiency of FHE-Based Private Queries

Myungsun Kim, Hyung Tae Lee, San Ling, Huaxiong Wang
2018 IEEE Transactions on Dependable and Secure Computing  
Then, we measure the multiplicative depth considering an FHE scheme that takes an extension field as its plaintext space and that supports the depth-free evaluation of Frobenius maps.  ...  The primary reason for this approach is that given an equality test algorithm, its efficiency is measured in terms of the multiplicative depth required to construct its arithmetic circuit expression.  ...  Improvements We can further reduce the multiplicative depth to log (p − 1) + log by switching to an FHE scheme that consumes (almost) no depth to evaluate Frobenius maps.  ... 
doi:10.1109/tdsc.2016.2568182 fatcat:drepes4eprhb5mkk3ev75u7i6y

Efficient Privacy-Preserving Matrix Factorization via Fully Homomorphic Encryption

Sungwook Kim, Jinsu Kim, Dongyoung Koo, Yuna Kim, Hyunsoo Yoon, Junbum Shin
2016 Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security - ASIA CCS '16  
However, such services raise serious privacy concerns for users.  ...  allows the recommender to optimize the parameters for quality of service.  ...  The efficient use of FHE is quite non-trivial; authors in [28] introduced garbled circuit instead of FHE, pointing out that FHE schemes for simpler algebraic computations are not as efficient as garbled  ... 
doi:10.1145/2897845.2897875 dblp:conf/ccs/KimKKKYS16 fatcat:7qnupcletvbk7ea3rti3mbc5nu

An Efficient and Secure Nonlinear Programming Outsourcing in Cloud Computing

M. Madhura, R. Santosh
2012 International Journal of Computer Applications  
It is possible to construct a set of effective privacy-preserving transformation techniques for any problem, by framing a private data possessed by the client for NLP problem as a combination of matrices  ...  It provides a practical mechanism design which fulfils input/output privacy, cheating resilience, and efficiency.  ...  Based on Yao's garbled circuits and Gentry's breakthrough work on Fully Homomorphic Encryption (FHE) [2] [3], a general result of secure computation outsourcing has been shown viable in theory, where  ... 
doi:10.5120/6118-8318 fatcat:33g2plt4sbfqji2by7ijxaokzy

Reusable garbled gates for new fully homomorphic encryption service

Xu An Wang, Fatos Xhafa, Jianfeng Ma, Yunfei Cao, Dianhua Tang
2017 International Journal of Web and Grid Services  
Furthermore, reusable garbled gates can be a core component for constructing X.A. Wang et al. the reusable garbled circuits, which can reduce the communication complexity of them from O(n) to O(1).  ...  In this paper, we propose a novel way to provide a fully homomorphic encryption service, namely by using garbled circuits.  ...  Baodong Qin for many helpful comments. This work is supported by Natural Science Foundation of Shaanxi Province (  ... 
doi:10.1504/ijwgs.2017.082061 fatcat:6lt4wihfrjcnxhp4exzyvvb324

Using Homomorphic Cryptographic Solutions on E-voting Systems

Ahmed A. Abu Aziz, Hasan N.Qunoo, Aiman A. Abu Samra
2018 International Journal of Computer Network and Information Security  
The proposed e-voting system achieved most of the important security issues of the internet-voting systems such as eligibility, privacy, accuracy, verifiability, fairness, and others.  ...  The results show that the implemented internet voting system is secure and applicable for a large number of voters up to 10 million voters.  ...  The depth of the circuit in FHE considered a limitation of the practicality of FHE, we intended to examine much larger in-depth circuits to study its effects on performance and resulted ciphers.  ... 
doi:10.5815/ijcnis.2018.01.06 fatcat:yktqnqilljhejlrpjcbl5wxmzy

A Survey on Homomorphic Encryption Schemes: Theory and Implementation [article]

Abbas Acar, Hidayet Aksu, A. Selcuk Uluagac, Mauro Conti
2017 arXiv   pre-print
Then, the main FHE families, which have become the base for the other follow-up FHE schemes are presented.  ...  However, this approach poses privacy concerns. Especially with popular cloud services, the control over the privacy of the sensitive data is lost.  ...  FHE implementation for "Low-depth" circuits.  ... 
arXiv:1704.03578v2 fatcat:zllpjmbaxrfbdnfkxcpoupgkxm

A Roadmap to Fully Homomorphic Elections: Stronger Security, Better Verifiability [chapter]

Kristian Gjøsteen, Martin Strand
2017 Lecture Notes in Computer Science  
After the trials of remote internet voting for local elections in 2011 and parliamentary elections in 2013, a number of local referendums has renewed interest in internet voting in Norway.  ...  While fully homomorphic cryptosystems are not efficient enough for the the system we sketch to be implemented and run today, we expect future improvements in fully homomorphic encryption which may eventually  ...  This particular exponentiation can be done for free in the BGV system. Of course, we may not care about the privacy of malformed ballots.)  ... 
doi:10.1007/978-3-319-70278-0_25 fatcat:ppyqeioapza3zipha6d6g2rvye

Multi-Client Verifiable Computation with Stronger Security Guarantees [chapter]

S. Dov Gordon, Jonathan Katz, Feng-Hao Liu, Elaine Shi, Hong-Sheng Zhou
2015 Lecture Notes in Computer Science  
Assuming no collusion between the server and the clients, we demonstrate a protocol for multiclient verifiable computation that achieves strong security in several respects.  ...  In that work, the authors defined and realized multi-client verifiable computation satisfying soundness against a malicious server and privacy against the semi-honest corruption of a single client.  ...  Governments are authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation hereon.  ... 
doi:10.1007/978-3-662-46497-7_6 fatcat:z23dup3urjh6jdia7lxdr4xxxa
« Previous Showing results 1 — 15 out of 314 results