Adaptively secure streaming functional encryption
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1024079 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- scientific article; zbMATH DE number 1842485 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- (Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin
- A generic approach to constructing and proving verifiable random functions
- A new paradigm for public-key functional encryption for degree-2 polynomials
- A punctured programming approach to adaptively secure functional encryption
- Ad Hoc Multi-Input Functional Encryption.
- Adaptive succinct garbled RAM or: how to delegate your database
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- Adaptively secure attribute-based encryption from witness encryption
- Adaptively secure garbled circuits from one-way functions
- Adaptively simulation-secure attribute-hiding predicate encryption
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Anonymous traitor tracing: how to embed arbitrary information in a key
- Attribute-based multi-input FE (and more) for attribute-weighted sums
- Be adaptive, avoid overcommitting
- Breaking the sub-exponential barrier in obfustopia
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Collusion-resistant functional encryption for RAMs
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}
- Compact adaptively secure ABE for \(\mathrm{NC}^1\) from \(k\)-lin
- Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
- Constant input attribute based (and predicate) encryption from evasive and tensor LWE
- Constrained Pseudorandom Functions for Unconstrained Inputs
- Cryptography for parallel RAM from indistinguishability obfuscation
- Decentralized multi-client functional encryption for inner product
- Decentralizing attribute-based encryption
- Decentralizing inner-product functional encryption
- Dual System Encryption via Predicate Encodings
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Dual system encryption via doubly selective security: framework, fully secure functional encryption for regular languages, and more
- Dynamic decentralized functional encryption
- Efficient selective identity-based encryption without random oracles
- From Minicrypt to Obfustopia via private-key functional encryption
- From single-input to multi-client inner-product functional encryption
- Full domain hash from (leveled) multilinear maps and identity-based aggregate signatures
- Full-hiding (unbounded) multi-input inner product functional encryption from the \(k\)-linear assumption
- Fully adaptive decentralized multi-authority \textsf{ABE}
- Fully secure functional encryption with general relations from the decisional linear assumption
- Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
- Function-hiding inner product encryption is practical
- Functional Encryption for Turing Machines
- Functional encryption for attribute-weighted sums from \(k\)-Lin
- Functional encryption for randomized functionalities
- Functional encryption with bounded collusions via multi-party computation
- Functional encryption: definitions and challenges
- Fuzzy Identity-Based Encryption
- How to Generate and Use Universal Samplers
- How to use indistinguishability obfuscation
- Identity-based cryptosystems and signature schemes
- Indistinguishability obfuscation and UCEs: the case of computationally unpredictable sources
- Indistinguishability obfuscation for Turing machines with unbounded memory
- Indistinguishability obfuscation for Turing machines: constant overhead and amortization
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from functional encryption
- Indistinguishability obfuscation from well-founded assumptions
- Inner-product functional encryption with fine-grained access control
- Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation
- Multi-authority Attribute Based Encryption
- Multi-client functional encryption for linear functions in the standard model from LWE
- Multi-client functional encryption with fine-grained access control
- Multi-client inner product encryption: function-hiding instantiations without random oracles
- Multi-client inner-product functional encryption in the random-oracle model
- Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
- Multi-input attribute based encryption and predicate encryption
- Multi-input functional encryption
- Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
- Multi-input functional encryption for unbounded arity functions
- Multi-input functional encryption with unbounded-message security
- Multi-input inner-product functional encryption from pairings
- Multi-input quadratic functional encryption from pairings
- Multi-input quadratic functional encryption: stronger security, broader functionality
- Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors
- Multi-key and multi-input predicate encryption from learning with errors
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts
- Non-trivial witness encryption and null-iO from standard assumptions
- Obfustopia built on secret-key functional encryption
- On the cryptographic hardness of finding a Nash equilibrium
- On the relationship between functional encryption, obfuscation, and fully homomorphic encryption
- Optimal security notion for decentralized multi-client functional encryption
- Order-revealing encryption and the hardness of private learning
- Output compression, MPC, and iO for Turing machines
- Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
- Practical functional encryption for quadratic functions with applications to predicate encryption
- Practical order-revealing encryption with limited leakage
- Public-coin differing-inputs obfuscation and its applications
- Reusable garbled circuits and succinct functional encryption
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation
- Simple functional encryption schemes for inner products
- Streaming functional encryption
- Succinct and adaptively secure ABE for ABP from \(k\)-Lin
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions
- Unbounded ABE via bilinear entropy expansion, revisited
- Upgrading to functional encryption
- Verifiable decentralized multi-client functional encryption for inner product
- Verifiable functional encryption
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Watermarking cryptographic capabilities
This page was built for publication: Adaptively secure streaming functional encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233198)
