Generic-group barriers for function-hiding and multi-input functional encryption
From MaRDI portal
Cites work
- A lower bound on the length of signatures based on group actions and generic isogenies
- A new paradigm for public-key functional encryption for degree-2 polynomials
- Access-controlled inner product function-revealing encryption
- Ad Hoc Multi-Input Functional Encryption.
- Adaptive simulation security for inner product functional encryption
- Compactness vs collusion resistance in functional encryption
- Cryptography and Coding
- Efficient function-hiding functional encryption: from inner-products to orthogonality
- Efficient functional encryption for inner-product values with full-hiding security
- Fine-grained non-interactive key-exchange: constructions and lower bounds
- From single-input to multi-client inner-product functional encryption
- Fully secure functional encryption for inner products, from standard assumptions
- Function-hiding inner product encryption
- Function-hiding inner product encryption is practical
- Function-private functional encryption in the private-key setting
- Functional encryption for inner product with full function privacy
- Functional encryption for quadratic functions from k-lin, revisited
- Functional encryption: definitions and challenges
- Fuzzy Identity-Based Encryption
- Generic-group delay functions require hidden-order groups
- Generic-Group Identity-Based Encryption: A Tight Impossibility Result
- Impossibility results for lattice-based functional encryption schemes
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from functional encryption
- Inner-product functional encryption with fine-grained access control
- Lower bounds for lattice-based compact functional encryption
- Lower bounds on inner-product functional encryption from all-or-nothing encryption primitives
- Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
- Multi-input inner-product functional encryption from pairings
- Multi-input quadratic functional encryption from pairings
- On the black-box complexity of private-key inner-product functional encryption
- On the impossibility of algebraic vector commitments in pairing-free groups
- On the impossibility of purely algebraic signatures
- Optimal bounded-collusion secure functional encryption
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Practical functional encryption for quadratic functions with applications to predicate encryption
- Predicate Privacy in Encryption Systems
- Simple functional encryption schemes for inner products
- Single-key to multi-key functional encryption with polynomial loss
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions
- To label, or not to label (in generic groups)
- Unbounded quadratic functional encryption and more from pairings
This page was built for publication: Generic-group barriers for function-hiding and multi-input functional encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443222)