Security analysis of multilinear maps over the integers

Citations

SCOPUS

17

초록

At Crypto 2013, Coron, Lepoint, and Tibouchi (CLT) proposed a practical Graded Encoding Scheme (GES) over the integers, which has very similar cryptographic features to ideal multilinear maps. In fact, the scheme of Coron et al. is the second proposal of a secure GES, and has advantages over the first scheme of Garg, Gentry, and Halevi (GGH). For example, unlike the GGH construction, the subgroup decision assumption holds in the CLT construction. Immediately following the elegant innovations of the GES, numerous GES-based cryptographic applications were proposed. Although these applications rely on the security of the underlying GES, the security of the GES has not been analyzed in detail, aside from the original papers produced by Garg et al. and Coron et al. We present an attack algorithm against the system parameters of the CLT GES. The proposed algorithm's complexity Õ(2ρ/2) is exponentially smaller than Õ(2ρ) of the previous best attack of Coron et al., where ρ is a function of the security parameter. Furthermore, we identify a flaw in the generation of the zero-testing parameter of the CLT GES, which drastically reduces the running time of the proposed algorithm. The experimental results demonstrate the practicality of our attack.

제목
Security analysis of multilinear maps over the integers
저자
Lee, H.T.; Seo, J.H.
DOI
10.1007/978-3-662-44371-2_13
발행일
2014-08
유형
Conference Paper
저널명
Lecture Notes in Computer Science
권
8616 LNCS
호
PART 1
페이지
224 ~ 240

파일 다운로드

Thumbnail