On the inner product predicate and a generalization of matching vector families
From MaRDI portal
Publication:5090982
Recommendations
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Predicate encryption supporting disjunctions, polynomial equations, and inner products
- Matching-vector families and LDCs over large modulo
- On the untapped potential of encoding predicates by arithmetic circuits and their applications
- Hierarchical Predicate Encryption for Inner-Products
Cites work
- 3-query locally decodable codes of subexponential length
- A minimal model for secure computation (extended abstract)
- Conditional disclosure of secrets via non-linear reconstruction
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Cryptography in $NC^0$
- Matching vector codes
- Matching-vector families and LDCs over large modulo
- New bounds for matching vector families
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Predicate encryption for circuits from LWE
- Probabilistic rank and matrix rigidity
- Randomly encoding functions: a new cryptographic paradigm. (Invited talk)
- Secure multi-party computation
- Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
- Towards 3-query locally decodable codes of subexponential length
- Towards breaking the exponential barrier for general secret sharing
Cited in
(3)
This page was built for publication: On the inner product predicate and a generalization of matching vector families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090982)
