[Resource Topic] 2019/1045: Predicate Encryption from Bilinear Maps and One-Sided Probabilistic Rank

Welcome to the resource topic for 2019/1045

Predicate Encryption from Bilinear Maps and One-Sided Probabilistic Rank

Authors: Josh Alman, Robin Hui


In predicate encryption for a function f, an authority can create ciphertexts and secret keys which are associated with attributes'. A user with decryption key $K_y$ corresponding to attribute $y$ can decrypt a ciphertext $CT_x$ corresponding to a message $m$ and attribute $x$ if and only if $f(x,y)=0$. Furthermore, the attribute $x$ remains hidden to the user if $f(x,y) \neq 0$. We construct predicate encryption from assumptions on bilinear maps for a large class of new functions, including sparse set disjointness, Hamming distance at most $k$, inner product mod 2, and any function with an efficient Arthur-Merlin communication protocol. Our construction uses a new probabilistic representation of Boolean functions we call one-sided probabilistic rank,’ and combines it with known constructions of inner product encryption in a novel way.

ePrint: https://eprint.iacr.org/2019/1045

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .