Filters








189 Hits in 3.4 sec

Predicate Encryption for Circuits from LWE [chapter]

Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee
2015 Lecture Notes in Computer Science  
We construct a leveled predicate encryption scheme for all circuits, assuming the hardness of the subexponential learning with errors (LWE) problem.  ...  That is, for any polynomial function d = d(λ), we construct a predicate encryption scheme for the class of all circuits with depth bounded by d(λ), where λ is the security parameter. *  ...  product encryption (IPE), attribute-based encryption for general circuits (ABE) and predicate encryption for general circuits.  ... 
doi:10.1007/978-3-662-48000-7_25 fatcat:sfnrzxcwkbafld3m56ib7hhihy

Lockable Obfuscation

Rishab Goyal, Venkata Koppula, Brent Waters
2017 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)  
(Such a system is also know as predicate encryption with one-sided security.)  ...  First, we show how to transform any attribute-based encryption (ABE) scheme into one in which the attributes used to encrypt the message are hidden from any user that is not authorized to decrypt the message  ...  A prototypical example is an ABE for circuits scheme from LWE [GVW13, BGG + 14].  ... 
doi:10.1109/focs.2017.62 dblp:conf/focs/GoyalKW17 fatcat:vbaadqt3ofarpaynqwxhot5voe

Attribute-based encryption for circuits

Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee
2013 Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13  
We present attribute-based encryption schemes for circuits of any arbitrary polynomial size, where the public parameters and the ciphertext grow linearly with the depth of the circuit.  ...  In an attribute-based encryption (ABE) scheme, a ciphertext is associated with an -bit public index ind and a message m, and a secret key is associated with a Boolean predicate P .  ...  We thank Dan Boneh and Shafi Goldwasser for helpful comments and insightful conversations.  ... 
doi:10.1145/2488608.2488677 dblp:conf/stoc/GorbunovVW13 fatcat:pweov2c4wvfm3owycwrvgjuliq

Attribute-Based Encryption for Circuits

Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee
2015 Journal of the ACM  
We present attribute-based encryption schemes for circuits of any arbitrary polynomial size, where the public parameters and the ciphertext grow linearly with the depth of the circuit.  ...  In an attribute-based encryption (ABE) scheme, a ciphertext is associated with an -bit public index ind and a message m, and a secret key is associated with a Boolean predicate P .  ...  We thank Dan Boneh and Shafi Goldwasser for helpful comments and insightful conversations.  ... 
doi:10.1145/2824233 fatcat:3zjlrdhjdncj7hff5ah2lg5cwi

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  
Garbled circuits found numerous applications, but every known construction suffers from one limitation: it offers no security if used on multiple inputs x.  ...  In this paper, we construct for the first time reusable garbled circuits. The key building block is a new succinct single-key functional encryption scheme.  ...  Under the subexponential LWE assumption, for any depth d, there is a single-key functional encryption scheme for general functions computable by circuits of depth d.  ... 
doi:10.1145/2488608.2488678 dblp:conf/stoc/GoldwasserKPVZ13 fatcat:whwl6pfenzexvkgvjotuzy6uwa

Stronger Security for Reusable Garbled Circuits, General Definitions and Attacks [chapter]

Shweta Agrawal
2017 Lecture Notes in Computer Science  
: reusable garbled circuits by Goldwasser, Kalai, Popa, Vaikuntanathan and Zeldovich (STOC 2013) [GKP + 13] and predicate encryption for circuits by Gorbunov, Vaikuntanathan and Wee (CRYPTO 2015) [GVW15  ...  We construct a functional encryption scheme for circuits which simultaneously achieves and improves upon the security of the current best known, and incomparable, constructions from standard assumptions  ...  We thank Aloni Cohen for pointing out an issue with an earlier version of the draft.  ... 
doi:10.1007/978-3-319-63688-7_1 fatcat:fqlsymnqybcu3bc6acwdlx2lku

Obfuscating Compute-and-Compare Programs under LWE

Daniel Wichs, Giorgos Zirdelis
2017 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)  
obfuscation which is secure for all null circuits.  ...  We can also use our obfuscator to generically upgrade attribute-based encryption to predicate encryption with one-sided attribute-hiding security, as well as witness encryption to indistinguishability  ...  From Attribute-Based Encryption to One-Sided Predicate Encryption An attribute based encryption (ABE) scheme allows us to create secret keys sk C corresponding to a circuit C and ciphertexts ct encrypting  ... 
doi:10.1109/focs.2017.61 dblp:conf/focs/WichsZ17 fatcat:vw6qdii6y5gbbcrw2lb3vxrgkq

Private Puncturable PRFs from Standard Lattice Assumptions [chapter]

Dan Boneh, Sam Kim, Hart Montgomery
2017 Lecture Notes in Computer Science  
In addition, we also study the simulation based definition of private constrained PRFs for general circuits, and show that the definition is not satisfiable.  ...  We construct the first privately puncturable PRF from standard lattice assumptions, namely from the hardness of learning with errors (LWE) and 1 dimensional short integer solutions (1D-SIS), which have  ...  We also thank David Wu for his helpful comments on the definition of privately constrained PRFs. This work is supported by NSF, DARPA, the Simons foundation, and a grant from ONR.  ... 
doi:10.1007/978-3-319-56620-7_15 fatcat:k2fxfxv5wbannavvm4rcz5vdzm

Non-trivial Witness Encryption and Null-iO from Standard Assumptions [chapter]

Zvika Brakerski, Aayush Jain, Ilan Komargodski, Alain Passelègue, Daniel Wichs
2018 Lecture Notes in Computer Science  
In particular, under the LWE assumptions we get a XniO scheme where the obfuscation time is 2 n/2 for all circuits with input size n.  ...  We show how to construct such XWE schemes for all of NP with encryption run-time 2 m/2 under the sub-exponential learning with errors (LWE) assumption.  ...  Thus, using our Corollary 3.3 (instantiated with LWE) together with their transformation, we get a 1/2-XniO (for all polynomial-size circuits) assuming sub-exponentially-secure LWE.  ... 
doi:10.1007/978-3-319-98113-0_23 fatcat:twazot2ytfdc5mccjbtwj6jivm

A Decade of Lattice Cryptography

Chris Peikert
2016 Foundations and Trends® in Theoretical Computer Science  
Lattice-based cryptography is the use of conjectured hard problems on point lattices in R n as the foundation for secure cryptographic systems.  ...  The main focus is on the foundational short integer solution (SIS) and learning with errors (LWE) problems (and their more efficient ring-based variants), their provable hardness assuming the worst-case  ...  I warmly thank Vadim Lyubashevsky, Dieter van Melkebeek, Oded Regev, Noah Stephens-Davidowitz, Madhu Sudan, and an anonymous reviewer for many valuable comments on earlier drafts.  ... 
doi:10.1561/0400000074 fatcat:5orjj3lrufdalfufl7ju6rnz3e

New Perspectives on Lattice-Based Functional Encryption for Analysis on Encrypted Data

Zongchen Sun, Leyou Zhang
2017 ICIC Express Letters  
In this work, we discuss how to construct a succinct lattice-based functional encryption scheme by linear FE (short as LinFE) for inner products and show some new perspectives on the applications of it  ...  A solution to this problem is functional encryption (FE) that enables direct computation on encrypted data. This novel paradigm breaks all-or-nothing access model.  ...  LinFE for inner products from LWE. LinFE.Setup ( 1 λ , 1 l ) .  ... 
doi:10.24507/icicel.11.04.871 fatcat:eo3bkrh5pnf3jnamkq3635xx7y

Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits [chapter]

Dan Boneh, Craig Gentry, Sergey Gorbunov, Shai Halevi, Valeria Nikolaenko, Gil Segev, Vinod Vaikuntanathan, Dhinakaran Vinayagamurthy
2014 Lecture Notes in Computer Science  
under the public-key (f (x), f) of the same plaintext, for any efficiently computable f .  ...  We construct the first (key-policy) attribute-based encryption (ABE) system with short secret keys: the size of keys in our system depends only on the depth of the policy circuit, not its size.  ...  An FKHE for Arithmetic Circuits from LWE We now turn to building an FKHE for arithmetic circuits from the learning with errors (LWE) problem.  ... 
doi:10.1007/978-3-642-55220-5_30 fatcat:fvwajgpwnvgwtjl2ii7cwk56ae

On the Untapped Potential of Encoding Predicates by Arithmetic Circuits and Their Applications [chapter]

Shuichi Katsumata
2017 Lecture Notes in Computer Science  
In particular, we develop two predicate encoding schemes with different properties and construct cryptographic primitives that benefit from these: verifiable random functions (VRFs) and predicate encryption  ...  For the time being, it is enough to view it as a subset predicate. 4 [GKW17, WZ17] give a generic conversion from ABEs to PEs that uses an obfuscation for a specific program proven secure under the subexponential  ...  In particular, we are grateful for Takahiro Matsuda and Shota Yamada for precious comments on the earlier version of this work.  ... 
doi:10.1007/978-3-319-70700-6_4 fatcat:td4jkrvrwnaq5pephmql4ckcme

Revocable attribute-based proxy re-encryption

Fucai Luo, Saif Al-Kuwari
2021 Journal of Mathematical Cryptology  
Previously, revocation mechanism was considered in the settings of identity-based encryption (IBE), ABE, predicate encryption (PE), and broadcast PRE, but not ABPRE, which is what we set to do in this  ...  the supported policy circuits.  ...  The latter has been discussed for ABE [4] and predicate encryption (PE) [33] .  ... 
doi:10.1515/jmc-2020-0039 fatcat:rxdopwunbzaczoz27uan7g3oyq

Attribute-Based Functional Encryption on Lattices [chapter]

Xavier Boyen
2013 Lecture Notes in Computer Science  
We introduce a broad lattice manipulation technique for expressive cryptography, and use it to realize functional encryption for access structures from post-quantum hardness assumptions.  ...  Specically, we build an ecient key-policy attribute-based encryption scheme, and prove its security in the selective sense from learning-with-errors intractability in the standard model. 0 This is a longer  ...  Acknowledgments The author would like to thank Dan Boneh for suggesting a simplication of the scheme and its proof by way of the ExtendRight abstraction, and to thank the TCC 2013 program committee for  ... 
doi:10.1007/978-3-642-36594-2_8 fatcat:puklxgbuvza4dfidwgkep7e5li
« Previous Showing results 1 — 15 out of 189 results