Can someone explain what is a pairing-free group ? There is encryption schemes, for example 1, that qualify there proposed construction as pairing-free group. However, they use bilinear group in the setup phase. Therefore, how we can qualify a work as a pairing-free based scheme.

  • $\begingroup$ "However, they use bilinear group in the setup phase." It seemed to me that the setup only uses cyclic groups. Could you point out the exact place? $\endgroup$
    – ckamath
    Aug 2 '19 at 11:44
  • $\begingroup$ See please page 23, Function-Hiding Inner Product Functional Encryption construction $\endgroup$
    – kawsaw
    Aug 2 '19 at 12:49
  • $\begingroup$ A pairing-free group, as the name suggests, is a group (or groups) for which bilinear pairing is not known to exist. The construction in section 5, as far as I understood, does not claim to be in the pairing-free setting. $\endgroup$
    – ckamath
    Aug 5 '19 at 9:04

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.