Filters








1,368 Hits in 5.1 sec

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

Michael Clear, Ciarán McGoldrick
2016 Lecture Notes in Computer Science  
The only known way to achieve Attribute-based Fully Homomorphic Encryption (ABFHE) is through indistinguishability obfsucation.  ...  In this paper, we present an ABFHE scheme that can evaluate circuits of unbounded depth but with one limitation: there is a bound N on the number of inputs that can be used in a circuit evaluation.  ...  Suppose we set N to be a large value so as not to practically limit the number of inputs to a circuit. As a result, N dominates λ.  ... 
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  
The only known way to achieve Attribute-based Fully Homomorphic Encryption (ABFHE) is through indistinguishability obfuscation.  ...  In this paper, we present an ABFHE scheme that can evaluate circuits of unbounded depth but with one limitation: there is a bound N on the number of inputs that can be used in a circuit evaluation.  ...  Gentry, Sahai and Waters ) constructed the first leveled Identity-Based Fully Homomorphic Encryption (IBFHE) scheme and the first leveled Attribute-Based Fully Homomorphic Encryption (ABFHE) scheme from  ... 
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  
The only known way to achieve Attribute-based Fully Homomorphic Encryption (ABFHE) is through indistinguishability obfuscation.  ...  In this paper, we present an ABFHE scheme that can evaluate circuits of unbounded depth but with one limitation: there is a bound N on the number of inputs that can be used in a circuit evaluation.  ...  Gentry, Sahai and Waters ) constructed the first leveled Identity-Based Fully Homomorphic Encryption (IBFHE) scheme and the first leveled Attribute-Based Fully Homomorphic Encryption (ABFHE) scheme from  ... 
doi:10.1504/ijact.2017.10010329 fatcat:u56mktp54bablcxnnwemxaqese

Attribute-Based Fully Homomorphic Encryption Scheme from Lattices with Short Ciphertext

Yuan Liu, Yun Pan, Lize Gu, Yuan Zhang, Dezhi An, Rongxing Lu
2021 Mathematical Problems in Engineering  
In this paper, based on the LWE problem on lattices, we propose an attribute-based fully homomorphic scheme with short ciphertext.  ...  no longer increased with the total number of system's attributes.  ...  However, in [24, 26] , the size of ciphertext also increases linearly with the number of system attributes which leads to a high storage overhead. e above lattice-based fully homomorphic encryption schemes  ... 
doi:10.1155/2021/6656764 fatcat:niplnpgqjbfkjnzij6sjivbibm

Reusable garbled circuits and succinct functional encryption

Shafi Goldwasser, Yael Kalai, Raluca Ada Popa, Vinod Vaikuntanathan, Nickolai Zeldovich
2013 Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13  
call token-based obfuscation, homomorphic encryption for a class of Turing machines where the evaluation runs in input-specific time rather than worst-case time, and a scheme for delegating computation  ...  The security of our construction is based on the intractability of the Learning with Errors (LWE) problem and holds as long as an adversary has access to a single key sk f (or even an a priori bounded  ...  We use three building blocks in our construction: a (leveled) fully homomorphic encryption scheme FHE, a (leveled) attribute-based encryption scheme ABE, and a Yao garbling scheme Gb.  ... 
doi:10.1145/2488608.2488678 dblp:conf/stoc/GoldwasserKPVZ13 fatcat:whwl6pfenzexvkgvjotuzy6uwa

Bootstrappable Identity-Based Fully Homomorphic Encryption [chapter]

Michael Clear, Ciarán McGoldrick
2014 Lecture Notes in Computer Science  
It has been an open problem for a number of years to construct an identity-based fully homomorphic encryption (IBFHE) scheme (first mentioned by Naccache at CHES/CRYPTO 2010).  ...  Our attribute-based scheme is the first to support homomorphic evaluation on ciphertexts with different attributes.  ...  We would like to especially thank one of the reviewers for suggesting an improvement to the attribute-based construction in Section 3.1 in addition to suggesting interesting directions for future work.  ... 
doi:10.1007/978-3-319-12280-9_1 fatcat:sajo7ysvovgvnm5r33hvstwewe

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.  ...  Using similar techniques, we show how to compile a recent attribute-based encryption scheme for circuits by Gorbunov et al. into an attribute-based FHE scheme that permits data encrypted under the same  ...  In previous LWE-based FHE schemes, the field operations involve multiplying a small number with a general number of Z q , which has complexityÕ(κ) =Õ(L).  ... 
doi:10.1007/978-3-642-40041-4_5 fatcat:fqwzglav2fhy7olktxlob536jq

Private-Key Fully Homomorphic Encryption for Private Classification [chapter]

Alexander Wood, Vladimir Shpilrain, Kayvan Najarian, Ali Mostashari, Delaram Kahrobaei
2018 Lecture Notes in Computer Science  
In this extended abstract we provide an overview of an implementation of a private-key fully homomorphic encryption scheme in a protocol for private Naive Bayes classification.  ...  Fully homomophic encryption enables private computation over sensitive data, such as medical data, via potentially quantum-safe primitives.  ...  Let F denote a family of monotone, continuous, additively homomorphic functions that commute with encryption.  ... 
doi:10.1007/978-3-319-96418-8_56 fatcat:33n2kyip5fhf7chn2mzsgpfisq

Fully Homomorphic Distributed Identity-based Encryption Resilient to Continual Auxiliary Input Leakage

François Gérard, Veronika Kuchta, Rajeev Anand Sahu, Gaurav Sharma, Olivier Markowitch
2018 Proceedings of the 15th International Joint Conference on e-Business and Telecommunications  
In this work, we show how to construct a distributed fully homomorphic identity-based encryption secure in the continual auxiliary input model.  ...  Our construction is based on the fully homomorphic scheme of Gentry, Sahai and Waters and relies merely on the learning with errors assumption, which is conjectured being resistant against quantum attacks  ...  The technique was used to realize the first (leveled) fully homomorphic identity-based and (leveled) fully homomorphic attribute-based encryption as showed in (Gentry et al., 2013) .  ... 
doi:10.5220/0006832202070218 dblp:conf/icete/GerardKS0M18 fatcat:vs77pwj345fava37tuoeh33lgq

How to Run Turing Machines on Encrypted Data [chapter]

Shafi Goldwasser, Yael Tauman Kalai, Raluca Ada Popa, Vinod Vaikuntanathan, Nickolai Zeldovich
2013 Lecture Notes in Computer Science  
-A variant of fully homomorphic encryption scheme for Turing machines, where one can evaluate a Turing machine M on an encrypted input x in time that is dependent on the running time of M on input x as  ...  Specifically, we show: -An attribute-based encryption scheme for any polynomial-time Turing machine and Random Access Machine (RAM).  ...  Acknowledgments We would like to thank the authors of the witness encryption paper [GGH13a] and Zvika Brakerski for useful discussions.  ... 
doi:10.1007/978-3-642-40084-1_30 fatcat:evgkrnr5mvaynhfw3iqwhfm57a

Efficient SMC Protocol Based on Multi-Bit Fully Homomorphic Encryption

Zong-Wu Zhu, Ru-Wei Huang
2021 Applied Sciences  
Its security can be attributed to the Decisional Learning With Errors (DLWE) and a variant of this problem (some-are-errorless LWE).  ...  Compared with the existing secure multi-party computation protocol based on fully homomorphic encryption under the CRS model, the ciphertext size of this protocol is smaller, the efficiency is higher,  ...  Fully Homomorphic Encryption (FHE) has just solved the problem of data privacy computing. Fully homomorphic encryption was first proposed by Rivest et al.  ... 
doi:10.3390/app112110332 fatcat:chfnpae22fakjfdg2vnbwih3gm

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.  ...  Namely, it allows to perform arbitrarily many computational steps on inputs encrypted by an a-priori unbounded (polynomial) number of parties.  ...  Their candidate was almost fully dynamic, except an upper bound on the maximal number of participants in a computation had to be known at the time a key is generated.  ... 
doi:10.1007/978-3-662-53018-4_8 fatcat:4hsed2vinnf37hesmvea53k5zm

High-Precision Arithmetic in Homomorphic Encryption [chapter]

Hao Chen, Kim Laine, Rachel Player, Yuhou Xia
2018 Lecture Notes in Computer Science  
In most RLWE-based homomorphic encryption schemes the native plaintext elements are polynomials in a rting Zt[x]/(x n +1), where n is a power of 2, and t an integer modulus.  ...  We then show how rational numbers can be encoded as elements of this plaintext space, enabling homomorphic evaluation of deep circuits with high-precision rational number inputs.  ...  convenient way of encoding and encrypting fixed-precision rational numbers, and can be used in conjunction with many RLWE-based homomorphic encryption schemes.  ... 
doi:10.1007/978-3-319-76953-0_7 fatcat:w43jak5mabhg5jzdobj6nbxd4i

Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives [chapter]

Sanjam Garg, Mohammad Mahmoody, Ameer Mohammed
2017 Lecture Notes in Computer Science  
as witness encryption (WE), predicate encryption, and fully homomorphic encryption.  ...  In light of this, we prove our impossibility results with respect to a stronger model than the fully black-box framework of Impagliazzo and Rudich (STOC'89) and Reingold, Trevisan, and Vadhan (TCC'04)  ...  We thank the anonymous reviewers of Crypto 2017 for their useful comments.  ... 
doi:10.1007/978-3-319-63688-7_22 fatcat:bgqet5sbynfmfotz74oxd3pykq

Functional Encryption and Its Impact on Cryptography [chapter]

Hoeteck Wee
2014 Lecture Notes in Computer Science  
In this article, we provide a brief introduction to functional encryption, and an overview of its overarching impact on the field of cryptography. ⋆ wee@di.ens.fr. CNRS (UMR 8548) and INRIA.  ...  Functional encryption is a novel paradigm for public-key encryption that enables both fine-grained access control and selective computation on encrypted data, as is necessary to protect big, complex data  ...  I would also like to thank Michel Abdalla and the SCN 2014 PC for inviting me as a speaker.  ... 
doi:10.1007/978-3-319-10879-7_18 fatcat:xpqhqqqjcnaddkdqwcvjpzcztu
« Previous Showing results 1 — 15 out of 1,368 results