On the Inner Product Predicate and a Generalization of Matching Vector Families

10/04/2018
by   Balthazar Bauer, et al.
0

Motivated by cryptographic applications such as predicate encryption, we consider the problem of representing an arbitrary predicate as the inner product predicate on two vectors. Concretely, fix a Boolean function P and some modulus q. We are interested in encoding x to x⃗ and y to y⃗ so that P(x,y) = 1 〈x⃗,y⃗〉= 0 q, where the vectors should be as short as possible. This problem can also be viewed as a generalization of matching vector families, which corresponds to the equality predicate. Matching vector families have been used in the constructions of Ramsey graphs, private information retrieval (PIR) protocols, and more recently, secret sharing. Our main result is a simple lower bound that allows us to show that known encodings for many predicates considered in the cryptographic literature such as greater than and threshold are essentially optimal for prime modulus q. Using this approach, we also prove lower bounds on encodings for composite q, and then show tight upper bounds for such predicates as greater than, index and disjointness.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/24/2019

The space complexity of inner product filters

Motivated by the problem of filtering candidate pairs in inner product s...
research
05/17/2022

New Lower Bounds for Private Estimation and a Generalized Fingerprinting Lemma

We prove new lower bounds for statistical estimation tasks under the con...
research
10/13/2020

General lower bounds for interactive high-dimensional estimation under information constraints

We consider the task of distributed parameter estimation using sequentia...
research
06/09/2022

Optimal SQ Lower Bounds for Robustly Learning Discrete Product Distributions and Ising Models

We establish optimal Statistical Query (SQ) lower bounds for robustly le...
research
02/19/2018

Upper and lower bounds for dynamic data structures on strings

We consider a range of simply stated dynamic data structure problems on ...
research
05/17/2021

Bounds on the Capacity of PIR over Graphs

In the private information retrieval (PIR) problem, a user wants to retr...
research
06/13/2021

Optimal detection of the feature matching map in presence of noise and outliers

We consider the problem of finding the matching map between two sets of ...

Please sign up or login with your details

Forgot password? Click here to reset