Access-controlled inner product function-revealing encryption
From MaRDI portal
Cites work
- A new approach to practical function-private inner product encryption
- Adaptive simulation security for inner product functional encryption
- An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
- Approximate distance-comparison-preserving symmetric encryption
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Deterministic and Efficiently Searchable Encryption
- Efficient functional encryption for inner-product values with full-hiding security
- Factoring Polynomials Over Large Finite Fields
- Finding the four squares in Lagrange's theorem
- Function-hiding inner product encryption
- Function-hiding inner product encryption is practical
- Function-revealing encryption (definitions and constructions)
- Functional encryption for inner product with full function privacy
- Functional encryption for quadratic functions from k-lin, revisited
- Functional encryption: definitions and challenges
- Impossibility results for lattice-based functional encryption schemes
- Indistinguishability obfuscation from well-founded assumptions
- Inner-product functional encryption with fine-grained access control
- Multi-input functional encryption
- Multi-input quadratic functional encryption from pairings
- Multi-party functional encryption
- New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts
- On the black-box complexity of private-key inner-product functional encryption
- On the ditribution of quadratic residues and nonresidues of a prime P in the series 1, 2,, P 1.
- On the practical security of inner product functional encryption
- Order-Preserving Symmetric Encryption
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Property preserving symmetric encryption
- Public Key Cryptography - PKC 2006
- Randomized algorithms in number theory
- Revealing encryption for partial ordering
- Simple functional encryption schemes for inner products
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Unbounded inner product functional encryption from bilinear maps
- Unbounded inner-product functional encryption with succinct keys
- Unbounded predicate inner product functional encryption from pairings
This page was built for publication: Access-controlled inner product function-revealing encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7390762)