Streaming functional encryption
From MaRDI portal
Publication:6190119
DOI10.1007/978-3-031-38551-3_14MaRDI QIDQ6190119
Alexis Korb, Jiaxin Guan, Amit Sahai
Publication date: 6 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Cites Work
- Practical functional encryption for quadratic functions with applications to predicate encryption
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- A generic approach to constructing and proving verifiable random functions
- Function-private functional encryption in the private-key setting
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Functional Encryption for Turing Machines
- Functional Encryption Without Obfuscation
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Adaptively Secure Garbled Circuits from One-Way Functions
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Simple Functional Encryption Schemes for Inner Products
- Functional Encryption: Definitions and Challenges
- Single-Key to Multi-Key Functional Encryption with Polynomial Loss
- Compactness vs Collusion Resistance in Functional Encryption
- Predicate Encryption for Circuits from LWE
- From Selective to Adaptive Security in Functional Encryption
- Indistinguishability Obfuscation from Compact Functional Encryption
- Foundations of Cryptography
- Foundations of Cryptography
- Indistinguishability Obfuscation from Functional Encryption
- How to use indistinguishability obfuscation
- Breaking the Sub-Exponential Barrier in Obfustopia
- Fuzzy Identity-Based Encryption
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Multi-input Functional Encryption
- Reusable garbled circuits and succinct functional encryption
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Indistinguishability obfuscation from well-founded assumptions
This page was built for publication: Streaming functional encryption
