### Predicate Encryption from Bilinear Maps and One-Sided Probabilistic Rank

Josh Alman and Robin Hui

##### Abstract

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.

Available format(s)
Category
Public-key cryptography
Publication info
A minor revision of an IACR publication in TCC 2019
Keywords
Predicate EncryptionBilinear MapsProbabilistic Rank
Contact author(s)
jalman @ mit edu
ctunoku @ mit edu
History
2019-10-29: revised
See all versions
Short URL
https://ia.cr/2019/1045

CC BY

BibTeX

@misc{cryptoeprint:2019/1045,
author = {Josh Alman and Robin Hui},
title = {Predicate Encryption from Bilinear Maps and One-Sided Probabilistic Rank},
howpublished = {Cryptology ePrint Archive, Paper 2019/1045},
year = {2019},
note = {\url{https://eprint.iacr.org/2019/1045}},
url = {https://eprint.iacr.org/2019/1045}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.