Cryptology ePrint Archive: Report 2015/128

Self-bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications

Takashi Yamakawa and Shota Yamada and Goichiro Hanaoka and Noboru Kunihiro

Abstract: A self-bilinear map is a bilinear map where the domain and target groups are identical. In this paper, we introduce a self-bilinear map with auxiliary information which 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 Phi-hiding assumption.

Category / Keywords: public-key cryptography / self-bilinear map, indistinguishability obfuscation, multilinear map

Original Publication (with major differences): IACR-CRYPTO-2014

Date: received 17 Feb 2015, last revised 26 Feb 2015

Contact author: yamakawa at it k u-tokyo ac jp

Available format(s): PDF | BibTeX Citation

Note: This is the full version of our paper in CRYPTO 2014.

Version: 20150226:121557 (All versions of this report)

Short URL: ia.cr/2015/128

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]