Paper Info
Title
Symmetric inner-product predicate encryption based on three groups
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.
Year
DOI
Venue
2012
10.1007/978-3-642-33272-2_14
ProvSec
Keywords
Field
DocType
moderate security parameter,predicate encryption scheme,symmetric-key inner-product predicate encryption,hidden subgroup,previous scheme,non-interactive assumption,symmetric predicate scheme,encryption scheme,symmetric inner-product predicate encryption,hidden group,hidden subgroup problem
Integer,Discrete mathematics,Computer science,Encryption,Theoretical computer science,Probabilistic encryption,40-bit encryption,Predicate (grammar),Computer security model,Factoring,Bilinear interpolation
Conference
Citations 
PageRank 
References 
6
0.50
41
Authors
4
Name
Order
Citations
PageRank
Masayuki Yoshino1217.43
Noboru Kunihiro242545.72
Ken Naganuma393.59
Hisayoshi Sato4134.83