From Minicrypt to Obfustopia via Private-Key Functional Encryption
From MaRDI portal
Publication:5738873
DOI10.1007/978-3-319-56620-7_5zbMath1410.94086OpenAlexW2592460471MaRDI QIDQ5738873
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-56620-7_5
Related Items (14)
Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound ⋮ FE and iO for Turing machines from minimal assumptions ⋮ Anonymous IBE, leakage resilience and circular security from new assumptions ⋮ From cryptomania to obfustopia through secret-key functional encryption ⋮ From FE combiners to secure MPC and back ⋮ Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions ⋮ From Minicrypt to Obfustopia via Private-Key Functional Encryption ⋮ Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness ⋮ Constrained pseudorandom functions from functional encryption ⋮ Combiners for functional encryption, unconditionally ⋮ Continuous verifiable delay functions ⋮ Multi-client functional encryption for separable functions ⋮ Amplifying the security of functional encryption, unconditionally ⋮ Delegation with updatable unambiguous proofs and PPAD-hardness
Cites Work
- Unnamed Item
- Unnamed Item
- On the complexity of the parity argument and other inefficient proofs of existence
- Functional Encryption Without Obfuscation
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Cryptanalysis of the New CLT Multilinear Map over the Integers
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption
- Constrained Pseudorandom Functions and Their Applications
- Function-Private Subspace-Membership Encryption and Its Applications
- 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
- Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- Functional Encryption: Definitions and Challenges
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
- Settling the complexity of computing two-player Nash equilibria
- 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
- Indistinguishability Obfuscation from Compact Functional Encryption
- Predicate Privacy in Encryption Systems
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
- The Complexity of Computing a Nash Equilibrium
- How to use indistinguishability obfuscation
- Function-Private Functional Encryption in the Private-Key Setting
- Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions
- On the (im)possibility of obfuscating programs
- Functional Signatures and Pseudorandom Functions
- Multi-input Functional Encryption
- Reusable garbled circuits and succinct functional encryption
- From Minicrypt to Obfustopia via Private-Key Functional Encryption
- Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
- On Extractability Obfuscation
This page was built for publication: From Minicrypt to Obfustopia via Private-Key Functional Encryption
