Symmetric inner-product predicate encryption based on three groups

  • Authors:
  • Masayuki Yoshino;Noboru Kunihiro;Ken Naganuma;Hisayoshi Sato

  • Affiliations:
  • Hitachi, Ltd., Japan, The University of Tokyo, Japan;The University of Tokyo, Japan;Hitachi, Ltd., Japan;Hitachi, Ltd., Japan

  • Venue:
  • ProvSec'12 Proceedings of the 6th international conference on Provable Security
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents the first symmetric-key inner-product predicate encryption scheme based on three groups. The performance of predicate encryption schemes based on hidden subgroup problems depends on the number of hidden subgroups and this number should be optimized. The scheme presented here satisfies the selective security model under a non-interactive assumption where the number of terms does not depend on the number of adversarial queries. It is therefore as secure as the symmetric predicate scheme proposed by Shen et al., which is based on four groups, under a simpler assumption. Using three hidden groups instead of four, it has a message space more than 33% wider and is more resistant to integer factoring attacks with moderate security parameters. The available techniques for converting encryption schemes using composite-order bilinear groups into schemes using prime-order groups are applicable to our scheme. Compared with the previous scheme using the conversion techniques, our prime-order group instantiation is asymptotically more than 33% faster and has ciphertexts and tokens that are asymptotically 25% smaller.