Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions
From MaRDI portal
Publication:5738969
DOI10.1007/978-3-319-56614-6_2zbMath1415.94399OpenAlexW2613071398MaRDI QIDQ5738969
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56614-6_2
Related Items
Functional encryption against probabilistic queries: definition, construction and applications ⋮ Access control encryption with efficient verifiable sanitized decryption ⋮ Match me if you can: matchmaking encryption and its applications ⋮ An efficient CCA-secure access control encryption for any policy ⋮ Steel: composable hardware-based stateful and randomised functional encryption ⋮ Access control encryption from group encryption
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computationally private randomizing polynomials and their applications
- Indistinguishability Obfuscation: From Approximate to Exact
- Functional Encryption Without Obfuscation
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Cryptanalysis of the New CLT Multilinear Map over the Integers
- Cryptanalysis of GGH Map
- Cryptanalysis of GGH15 Multilinear Maps
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Practical Multilinear Maps over the Integers
- Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption
- Functional Encryption: New Perspectives and Lower Bounds
- On the Achievability of Simulation-Based Security for Functional Encryption
- Function-Private Subspace-Membership Encryption and Its Applications
- On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption
- Related-Key Security for Pseudorandom Functions Beyond the Linear Barrier
- Witness Encryption from Instance Independent Assumptions
- Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
- A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
- Functional Encryption with Bounded Collusions via Multi-party Computation
- On the Practical Security of Inner Product Functional Encryption
- Cryptanalysis of the Multilinear Map over the Integers
- How to Obfuscate Programs Directly
- Cryptographic Agents: Towards a Unified Theory of Computing on Encrypted Data
- Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
- Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- Identity-Based Cryptosystems and Signature Schemes
- Functional Encryption: Definitions and Challenges
- Cryptography Secure against Related-Key Attacks and Tampering
- From Selective to Adaptive Security in Functional Encryption
- A Punctured Programming Approach to Adaptively Secure Functional Encryption
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- New Multilinear Maps Over the Integers
- An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security
- Improved proxy re-encryption schemes with applications to secure distributed storage
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
- Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks
- Perfect Non-interactive Zero Knowledge for NP
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- Deterministic and Efficiently Searchable Encryption
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A method for obtaining digital signatures and public-key cryptosystems
- Foundations of Cryptography
- An Identity Based Encryption Scheme Based on Quadratic Residues
- On the Semantic Security of Functional Encryption Schemes
- Improved Constructions of PRFs Secure Against Related-Key Attacks
- Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
- Functional Encryption for Randomized Functionalities
- Obfuscating Circuits via Composite-Order Graded Encoding
- Advances in Cryptology - EUROCRYPT 2004
- Fuzzy Identity-Based Encryption
- Protecting Obfuscation against Algebraic Attacks
- Multi-input Functional Encryption
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Witness encryption and its applications
- Attribute-based encryption for circuits
- Reusable garbled circuits and succinct functional encryption
- Fast Software Encryption
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
