On the inner product predicate and a generalization of matching vector families
From MaRDI portal
Publication:5090982
DOI10.4230/LIPICS.FSTTCS.2018.41MaRDI QIDQ5090982FDOQ5090982
Authors: Balthazar Bauer, Jevgēnijs Vihrovs, Hoeteck Wee 
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1810.02396
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
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Cites Work
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Randomly encoding functions: a new cryptographic paradigm. (Invited talk)
- Cryptography in $NC^0$
- A minimal model for secure computation (extended abstract)
- Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
- Towards 3-query locally decodable codes of subexponential length
- Matching vector codes
- New bounds for matching vector families
- Towards breaking the exponential barrier for general secret sharing
- Conditional disclosure of secrets via non-linear reconstruction
- Secure multi-party computation
- Predicate encryption for circuits from LWE
- 3-query locally decodable codes of subexponential length
- Probabilistic rank and matrix rigidity
- Matching-vector families and LDCs over large modulo
Cited In (2)
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)
