Filters








729 Hits in 3.0 sec

Multi-identity and Multi-key Leveled FHE from Learning with Errors [chapter]

Michael Clear, Ciarán McGoldrick
2015 Lecture Notes in Computer Science  
In this work, we extend their results to the multi-identity setting and obtain a multi-identity IBFHE scheme that is selectively secure in the random oracle model under the hardness of Learning with Errors  ...  There exists a multi-identity IBFHE scheme that is selectively secure under the Learning With Errors problem in the random oracle model.  ...  Acknowledgments The authors would like to thank Fuqun Wang for pointing out errors in an earlier version of this paper.  ... 
doi:10.1007/978-3-662-48000-7_31 fatcat:pccqptaj25gcrk3t3kym75xqg4

Attribute-Based Fully Homomorphic Encryption with a Bounded Number of Inputs [chapter]

Michael Clear, Ciarán McGoldrick
2016 Lecture Notes in Computer Science  
Our construction relies on multi-key FHE and leveled ABFHE, both of which have been realized from LWE, and therefore we obtain a concrete scheme that is secure under LWE.  ...  This has been achieved from the Learning with Errors (LWE) assumption. However we know of no other way without obfuscation of constructing a scheme that can evaluate circuits of unbounded depth.  ...  We can instantiate the multi-key FHE scheme in our construction with the CM multi-key FHE from [7] , whose security is based on LWE.  ... 
doi:10.1007/978-3-319-31517-1_16 fatcat:e3zlnnmfajf6lcincfd4olq64q

Attribute-based fully homomorphic encryption with a bounded number of inputs

Michael Clear, Ciarán Mc Goldrick
2017 International Journal of Applied Cryptography  
Our construction relies on multi-key FHE and leveled ABFHE, both of which have been realized from LWE, and therefore we obtain a concrete scheme that is secure under LWE.  ...  This has been achieved from the Learning with Errors (LWE) assumption. However we know of no other way without obfuscation of constructing a scheme that can evaluate circuits of unbounded depth.  ...  the Learning with Errors (LWE) problem.  ... 
doi:10.1504/ijact.2017.089356 fatcat:pagtcewegncldkc6ddfzwxngyi

Attribute-based fully homomorphic encryption with a bounded number of inputs

Ciarán Mc Goldrick, Michael Clear
2017 International Journal of Applied Cryptography  
Our construction relies on multi-key FHE and leveled ABFHE, both of which have been realized from LWE, and therefore we obtain a concrete scheme that is secure under LWE.  ...  This has been achieved from the Learning with Errors (LWE) assumption. However we know of no other way without obfuscation of constructing a scheme that can evaluate circuits of unbounded depth.  ...  the Learning with Errors (LWE) problem.  ... 
doi:10.1504/ijact.2017.10010329 fatcat:u56mktp54bablcxnnwemxaqese

Fully dynamic Multi-Key FHE without Gaussian Noise

Yu Huang, Kaigui Wu, Ming Chen
2021 IEEE Access  
INDEX TERMS Learning with errors, Learning with rounding, Multi-key FHE.  ...  The existed fully dynamic multi-key FHE scheme is based on the learning with errors (LWE) problem.  ...  The authors would like to thank the anonymous reviewers for their detailed reviews and valuable feedback.  ... 
doi:10.1109/access.2021.3069214 fatcat:rroc4mp3unddpgqx6nky63xav4

Multi-key FHE for multi-bit messages

Zengpeng Li, Chunguang Ma, Hongsheng Zhou
2018 Science China Information Sciences  
More specifically, because of well-understood assumptions such as learning with errors (LWE), the FHE constructions are now efficient and nearly practical.  ...  ., multi-key FHE, hereafter referred as MFHE).  ...  The responsibility for scientific accuracy and content remains entirely with the authors.  ... 
doi:10.1007/s11432-017-9206-y fatcat:zhd4hqoayzgjrpgjn5xomxfhgi

Bootstrappable Identity-Based Fully Homomorphic Encryption [chapter]

Michael Clear, Ciarán McGoldrick
2014 Lecture Notes in Computer Science  
At CRYPTO 2013, Gentry, Sahai and Waters largely settled the problem by presenting leveled IBFHE constructions based on the Learning With Errors problem.  ...  Brakersi and Vaikuntanathan's paradigm based on the learning with errors (LWE) problem [5, 6] entailing techniques such as relinearization, modulus switching and dimension reduction.  ...  The main change is that E FHE is replaced with a multi-key FHE scheme E MKFHE (such as the NTRU-based scheme from [24] ).  ... 
doi:10.1007/978-3-319-12280-9_1 fatcat:sajo7ysvovgvnm5r33hvstwewe

Compressible Multikey and Multi-Identity Fully Homomorphic Encryption

Tongchen Shen, Fuqun Wang, Kefei Chen, Zhonghua Shen, Renjun Zhang, Neetesh Saxena
2021 Security and Communication Networks  
under the standard learning with errors (LWE) assumption.  ...  Then, we use this technique to construct a compressible multikey FHE scheme and a compressible multi-identity FHE scheme to overcome the bottleneck of bandwidth inefficiency in the multikey and multi-identity  ...  Multi-identity FHE (MIFHE) is an identity-based version of MKFHE.  ... 
doi:10.1155/2021/6619476 fatcat:tuizclf2wzevxik6yqn4yphfpm

Multi-key FHE from LWE, Revisited [chapter]

Chris Peikert, Sina Shiehian
2016 Lecture Notes in Computer Science  
More recently, Clear and McGoldrick (CRYPTO 2015), followed by Mukherjee and Wichs (EUROCRYPT 2016), proposed a multi-key FHE based on learning with errors (LWE).  ...  In this work we construct two multi-key FHE schemes, based on LWE assumptions, which are multi-hop with respect to keys: the output of a homomorphic computation on ciphertexts encrypted under a set of  ...  Our Results In this work we construct two (leveled) multi-key FHE schemes, for any number of keys, from LWE assumptions.  ... 
doi:10.1007/978-3-662-53644-5_9 fatcat:jegobtgdujahxfdwsfonoh3zxi

Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts [chapter]

Zvika Brakerski, Renen Perlman
2016 Lecture Notes in Computer Science  
We present a multi-key fully homomorphic encryption scheme that supports an unbounded number of homomorphic operations for an unbounded number of parties.  ...  Our hardness assumption is that the scheme of Mukherjee and Wichs is circular secure (and thus bootstrappable). A leveled scheme can be achieved under standard LWE.  ...  Acknowledgements The first author wishes to thank Michael Clear for discussions on multi-key FHE.  ... 
doi:10.1007/978-3-662-53018-4_8 fatcat:4hsed2vinnf37hesmvea53k5zm

Maliciously Circuit-Private FHE [chapter]

Rafail Ostrovsky, Anat Paskin-Cherniavsky, Beni Paskin-Cherniavsky
2014 Lecture Notes in Computer Science  
We devise the first known circuit private FHE, by instantiating our framework by various (standard) FHE schemes from the literature.  ...  The framework uses techniques akin to Gentry's bootstrapping and conditional disclosure of secrets (CDS [AIR01]) combining a non circuit private FHE scheme, with a homomorphic encryption (HE) scheme for  ...  We start from the scheme M 4 resulting from our construction, instantiated with an FHE F , and a maliciously circuit private P, where M 1 = A 3 = F , and A 1 = A 2 = P, reusing keys for the same scheme  ... 
doi:10.1007/978-3-662-44371-2_30 fatcat:eas77tpz3fg6xjpipy7gsczuje

Leakage Resilient Fully Homomorphic Encryption [chapter]

Alexandra Berkoff, Feng-Hao Liu
2014 Lecture Notes in Computer Science  
We do so by applying ideas from recent works analyzing the leakage resilience of public key encryption schemes based on the decision learning with errors (DLWE ) assumption to the Gentry, Sahai and Waters  ...  We show that by combining leakage resilient leveled FHE with multi-key FHE, it is possible to create a leakage resilient scheme capable of homomorphically evaluating circuits of arbitrary depth, with a  ...  We would like to thank Anna Lysyanskaya for many useful discussions and our TCC reviewers for their helpful comments.  ... 
doi:10.1007/978-3-642-54242-8_22 fatcat:p5g7gogknvedfpaw5fisuy4aau

Spooky Encryption and Its Applications [chapter]

Yevgeniy Dodis, Shai Halevi, Ron D. Rothblum, Daniel Wichs
2016 Lecture Notes in Computer Science  
Furthermore, we can construct spooky-free homomorphic encryption schemes from SNARKs, and it remains an open problem whether it is possible to do so from falsifiable assumptions.  ...  keys completely independently.  ...  The first author was partially supported by gifts from VMware Labs and Google, and NSF grants 1319051, 1314568, 1065288, 1017471.  ... 
doi:10.1007/978-3-662-53015-3_4 fatcat:oey3p4bthvasnd3bksxsy4imi4

Efficient Multi-key FHE with short extended ciphertexts and directed decryption protocol

NingBo LI, TanPing Zhou, XiaoYuan Yang, YiLiang Han, WenChao Liu, GuangSheng Tu
2019 IEEE Access  
Multi-key full homomorphic encryption (MKFHE) can perform arbitrary operations on encrypted data under different public keys (users), and the final ciphertext can be jointly decrypted by all involved users  ...  Therefore, MKFHE has natural advantages and application value in security multi-party computation (MPC).  ...  THE GENERAL LEARNING WITH ERRORS (GLWE) PROBLEM The learning with errors (LWE) problem and the ring learning with errors (RLWE) problem are syntactically identical, aside from different rings, and these  ... 
doi:10.1109/access.2019.2913943 fatcat:p2mxihgu7fcibbnzbwjn35ft7q

Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based [chapter]

Craig Gentry, Amit Sahai, Brent Waters
2013 Lecture Notes in Computer Science  
We describe a comparatively simple fully homomorphic encryption (FHE) scheme based on the learning with errors (LWE) problem.  ...  We focus on leveled FHE schemes, and typically omit the term "leveled".  ...  We also thank Boaz Barak and the anonymous CRYPTO reviewers for their many helpful comments.  ... 
doi:10.1007/978-3-642-40041-4_5 fatcat:fqwzglav2fhy7olktxlob536jq
« Previous Showing results 1 — 15 out of 729 results