Filters








10,073 Hits in 7.6 sec

Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption [chapter]

Dan Boneh, Ananth Raghunathan, Gil Segev
2013 Lecture Notes in Computer Science  
In light of such an inherent difficulty, any meaningful notion of function privacy must be based on the minimal assumption that, from the adversary's point of view, identities that correspond to its given  ...  We put forward a new notion, function privacy, in identitybased encryption and, more generally, in functional encryption.  ...  This is in contrast to the setting of deterministic public-key encryption (DPKE) [8] , where similar inherent difficulties arise when formalizing notions of security.  ... 
doi:10.1007/978-3-642-40084-1_26 fatcat:rcr2f6ra4jh5nppzxvvco3sgme

Functional Encryption for Randomized Functionalities [chapter]

Vipul Goyal, Abhishek Jain, Venkata Koppula, Amit Sahai
2015 Lecture Notes in Computer Science  
The setting of randomized functionalities require us to revisit functional encryption definitions by, for the first time, explicitly adding security requirements for dishonest encryptors, to ensure that  ...  In this work, we present the first definitions and constructions for functional encryption supporting randomized functionalities.  ...  In particular, they provide a construction of FE for randomized functions from FE for deterministic functions by encrypting a PRF key along with every message.  ... 
doi:10.1007/978-3-662-46497-7_13 fatcat:x6xu5h7z2ndmvaw5l5hoqsajou

Function-Revealing Encryption [chapter]

Marc Joye, Alain Passelègue
2018 Lecture Notes in Computer Science  
Our main result is an efficient order-revealing encryption scheme with limited leakage based on the standard DLin assumption. corresponds to a specific function f .  ...  We then propose a simple construction of orderrevealing encryption based on function-revealing encryption for simple functions, namely orthogonality testing and intersection cardinality.  ...  This result follows from a fairly simple technique to compare two bitstrings.  ... 
doi:10.1007/978-3-319-98113-0_28 fatcat:yjoshcxtxzay7dcp762fmghny4

Functional Encryption for Regular Languages [chapter]

Brent Waters
2012 Lecture Notes in Computer Science  
We provide a functional encryption system that supports functionality for regular languages. In our system a secret key is associated with a Deterministic Finite Automata (DFA) M .  ...  Compared with other known functional encryption systems, this is the first system where the functionality is capable of recognizing an unbounded language.  ...  Our Contribution We construct what we call a Deterministic Finite Automata (DFA)-based Functional Encryption system.  ... 
doi:10.1007/978-3-642-32009-5_14 fatcat:dnz23qwef5efxfoaj3zvixbfou

Practical CCA-Secure Functional Encryptions for Deterministic Functions

Huige Wang, Kefei Chen, Tianyu Pan, Yunlei Zhao
2020 Security and Communication Networks  
In the existing generic transformation from (adaptively) simulation-based CPA- (SIM-CPA-) secure ones for deterministic functions to (adaptively) simulation-based CCA- (SIM-CCA-) secure ones for randomized  ...  Later, a CCA-secure functional encryption from projective hash functions was proposed, but their scheme only applies to inner product functions.  ...  Specifically, they proposed two (q 1 , 1, poly) and (q 1 , poly, 0)-SIM-CPAsecure PK-FE schemes for any class of deterministic functions computable by polynomial-size circuits based on the CPA-secure PKE  ... 
doi:10.1155/2020/8823788 fatcat:tlnozf3pnbcslemlv5uiyapry4

Dynamic Decentralized Functional Encryption

Jérémy Chotard, Edouard Dufour-Sans, Romain Gay, Duong Hieu Phan, David Pointcheval
2020 Zenodo  
Our constructions culminate in an Inner-Product scheme for computing weighted sums on aggregated encrypted data, from standard assumptions in prime-order groups in the Random Oracle Model.  ...  These constructions build upon simple primitives in a modular way, and have instantiations from well-studied assumptions, such as DDH or LWE.  ...  of the public's needs, from the computation of simple statistics to the training of advanced machine learning models.  ... 
doi:10.5281/zenodo.3949876 fatcat:kfzxztrxtzhqrfkcnvfarnvgai

On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption [chapter]

Joël Alwen, Manuel Barbosa, Pooya Farshim, Rosario Gennaro, S. Dov Gordon, Stefano Tessaro, David A. Wilson
2013 Lecture Notes in Computer Science  
We first introduce the notion of Randomized Functional Encryption (RFE), a generalization of Functional Encryption dealing with randomized functionalities of interest in its own right, and show how to  ...  We investigate the relationship between Functional Encryption (FE) and Fully Homomorphic Encryption (FHE), demonstrating that, under certain assumptions, a Functional Encryption scheme supporting evaluation  ...  Acknowledgments Tessaro and Wilson wish to thank Shafi Goldwasser for insightful feedback.  ... 
doi:10.1007/978-3-642-45239-0_5 fatcat:gml6vajgqjhevgm6ydofrok6pi

Verifiable Functional Encryption [chapter]

Saikrishna Badrinarayanan, Vipul Goyal, Aayush Jain, Amit Sahai
2016 Lecture Notes in Computer Science  
This question turns out to be closely related to verifiable functional encryption.  ...  We then give general positive results for the indistinguishability setting: a general compiler from any functional encryption scheme into a verifiable functional encryption scheme with the only additional  ...  Namely, we convert from any secretkey functional encryption scheme to a verifiable secret-key functional encryption scheme with the only additional assumption being DLIN.  ... 
doi:10.1007/978-3-662-53890-6_19 fatcat:jhcex3fxnfdqdntnxhty3t7sui

Practical Functional Encryption for Quadratic Functions with Applications to Predicate Encryption [chapter]

Carmen Elisabetta Zaira Baltico, Dario Catalano, Dario Fiore, Romain Gay
2017 Lecture Notes in Computer Science  
This significantly improves the O(n 2 ) bound one would get from inner product encryption-based constructions.  ...  We present two practically efficient functional encryption schemes for a large class of quadratic functionalities.  ...  Apart from being an interesting theoretical object, Functional Encryption has many natural applications.  ... 
doi:10.1007/978-3-319-63688-7_3 fatcat:c34wxox2dfdc7kh5f6qe7xemza

Building Lossy Trapdoor Functions from Lossy Encryption [chapter]

Brett Hemenway, Rafail Ostrovsky
2013 Lecture Notes in Computer Science  
This is in contrast to the black box separation of injective trapdoor functions from many common cryptographic protocols, e.g. IND-CCA encryption.  ...  In this work we show how to derandomize lossy encryption (with long messages) to obtain lossy trapdoor functions, and hence injective one-way trapdoor functions.  ...  Our main contribution is to give a simple construction of injective trapdoor functions from lossy encryption (with long messages).  ... 
doi:10.1007/978-3-642-42045-0_13 fatcat:fsi26usu5jcslpchrewjq4quge

Indistinguishability Obfuscation from Functional Encryption

Nir Bitansky, Vinod Vaikuntanathan
2015 2015 IEEE 56th Annual Symposium on Foundations of Computer Science  
We present a generic construction of indistinguishability obfuscation from public-key functional encryption with succinct encryption circuits and subexponential security.  ...  Our main construction can be based on functional encryption schemes that support a single function key, and where the encryption circuit grows sub-linearly in the circuit-size of the function.  ...  From functional encryption to token-based obfuscation.  ... 
doi:10.1109/focs.2015.20 dblp:conf/focs/BitanskyV15 fatcat:q6p3gz4pmrbltkanym7xhyit5q

Multi-input Functional Encryption [chapter]

Shafi Goldwasser, S. Dov Gordon, Vipul Goyal, Abhishek Jain, Jonathan Katz, Feng-Hao Liu, Amit Sahai, Elaine Shi, Hong-Sheng Zhou
2014 Lecture Notes in Computer Science  
Functional encryption (FE) is a powerful primitive enabling fine-grained access to encrypted data.  ...  In this work we introduce the notion of multi-input functional encryption.  ...  Functional encryption applies to unary functions taking a single input. Here, we introduce the notion of multi-input functional encryption, a generalization to the case of n-ary functions.  ... 
doi:10.1007/978-3-642-55220-5_32 fatcat:bxsbliuhrreh7g73tgchse33ei

Power of public-key function-private functional encryption

Vincenzo Iovino, Qiang Tang, Karol Żebrowski
2018 IET Information Security  
In the public-key setting, known constructions of function-private functional encryption (FPFE) were limited to very restricted classes of functionalities like inner-product.  ...  One key observation entailed by their results is that attribute-based encryption with function privacy implies FE, a notable fact that sheds light on the importance of the function privacy property for  ...  This leads to the main questions that we study in this work: Can we achieve public-key FPFE for more general functionalities, like NC 1 or even all poly-sized circuits, from reasonable assumptions?  ... 
doi:10.1049/iet-ifs.2016.0459 fatcat:m6aymmxrtva2nokdy7p3p4t5fa

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  ...  what appears to be a very thorough review.  ... 
doi:10.1007/978-3-642-36594-2_8 fatcat:puklxgbuvza4dfidwgkep7e5li

Efficient Function-Hiding Functional Encryption: From Inner-Products to Orthogonality

Manuel Barbosa, Dario Catalano, Azam Soleimanian, Bogdan Warinschi
2019 Zenodo  
We construct functional encryption (FE) schemes for the orthogonality (OFE) relation where each ciphertext encrypts some vector x and each decryption key, associated to some vector y, allows to determineif  ...  Conceptually, both our constructions can be seen as further evidence that shutting down leakage from inner product values to only a single bit for the orthogonality relation can be done with little overhead  ...  A solution is to reveal to the cloud, for each file deterministic encryptions of the keywords which occur in that file.  ... 
doi:10.5281/zenodo.3405909 fatcat:3j27w653fjdjtc4r7wxterqhbm
« Previous Showing results 1 — 15 out of 10,073 results