Self-Bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications
Self-Bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications
复制标题
DOI:
10.1007/s00453-016-0250-8
复制
发表时间:
2014-08
期刊:
影响因子:
1.1
通讯作者:
Takashi Yamakawa;Shota Yamada;Goichiro Hanaoka;N. Kunihiro
中科院分区:
文献类型:
--
作者:
Takashi Yamakawa;Shota Yamada;Goichiro Hanaoka;N. Kunihiro
A self-bilinear map is a bilinear map where the domain and target groups are identical. In this paper, we introduce aself-bilinear map with auxiliary informationwhich is a weaker variant of a self-bilinear map, construct it based on indistinguishability obfuscation and prove that a useful hardness assumption holds with respect to our construction under the factoring assumption. From our construction, we obtain a multilinear map with interesting properties: the level of multilinearity is not bounded in the setup phase, and representations of group elements are compact, i.e., their size is independent of the level of multilinearity. This is the first construction of a multilinear map with these properties. Note, however, that to evaluate the multilinear map, auxiliary information is required. As applications of our multilinear map, we construct multiparty non-interactive key-exchange and distributed broadcast encryption schemes where the maximum number of users is not fixed in the setup phase. Besides direct applications of our self-bilinear map, we show that our technique can also be used for constructing somewhat homomorphic encryption based on indistinguishability obfuscation and the-hiding assumption.