International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Function Private Predicate Encryption for Low Min-Entropy Predicates

Authors:
Sikhar Patranabis
Debdeep Mukhopadhyay
Somindu C. Ramanna
Download:
DOI: 10.1007/978-3-030-17259-6_7
Search ePrint
Search Google
Conference: PKC 2019
Abstract: In this work, we propose new constructions for zero inner-product encryption (ZIPE) and non-zero inner-product encryption (NIPE) from prime-order bilinear pairings, which are both attribute and function private in the public-key setting. Our ZIPE scheme is adaptively attribute private under the standard Matrix DDH assumption for unbounded collusions. It is additionally computationally function private under a min-entropy variant of the Matrix DDH assumption for predicates sampled from distributions with super-logarithmic min-entropy. Existing (statistically) function private ZIPE schemes due to Boneh et al. [Crypto’13, Asiacrypt’13] necessarily require predicate distributions with significantly larger min-entropy in the public-key setting.Our NIPE scheme is adaptively attribute private under the standard Matrix DDH assumption, albeit for bounded collusions. In addition, it achieves computational function privacy under a min-entropy variant of the Matrix DDH assumption for predicates sampled from distributions with super-logarithmic min-entropy. To the best of our knowledge, existing NIPE schemes from bilinear pairings were neither attribute private nor function private. Our constructions are inspired by the linear FE constructions of Agrawal et al. [Crypto’16] and the simulation secure ZIPE of Wee [TCC’17]. In our ZIPE scheme, we show a novel way of embedding two different hard problem instances in a single secret key - one for unbounded collusion-resistance and the other for function privacy. For NIPE, we introduce new techniques for simultaneously achieving attribute and function privacy. We further show that the two constructions naturally generalize to a wider class of predicate encryption schemes such as subspace membership, subspace non-membership and hidden-vector encryption.
BibTeX
@inproceedings{pkc-2019-29301,
  title={Function Private Predicate Encryption for Low Min-Entropy Predicates},
  booktitle={Public-Key Cryptography – PKC 2019},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={11443},
  pages={189-219},
  doi={10.1007/978-3-030-17259-6_7},
  author={Sikhar Patranabis and Debdeep Mukhopadhyay and Somindu C. Ramanna},
  year=2019
}