A note on self-bilinear maps
3
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Cryptographic protocols depend on the hardness of some computational problems for their security. Joux briefly summarized known relations between assumptions related bilinear map in a sense that if one problem can be solved easily, then another problem can be solved within a polynomial time [6]. In this paper, we investigate additional relations between them. Firstly, we show that the computational Diffie-Hellman assumption implies the bilinear Diffie-Hellman assumption or the general inversion assumption. Secondly, we show that a cryptographic useful self-bilinear map does not exist. If a self-bilinear map exists, it might be used as a building block for several cryptographic applications such as a multilinear map. As a corollary, we show that a fixed inversion of a bilinear map with homomorphic property is impossible. Finally, we remark that a self-bilinear map proposed in [7] is not essentially self-bilinear.
Abstract
Cryptographic protocols depend on the hardness of some computational problems for their security. Joux briefly summarized known relations between assumptions related bilinear map in a sense that if one problem can be solved easily, then another problem can be solved within a polynomial time [6]. In this paper, we investigate additional relations between them. Firstly, we show that the computational Diffie-Hellman assumption implies the bilinear Diffie-Hellman assumption or the general inversion assumption. Secondly, we show that a cryptographic useful self-bilinear map does not exist. If a self-bilinear map exists, it might be used as a building block for several cryptographic applications such as a multilinear map. As a corollary, we show that a fixed inversion of a bilinear map with homomorphic property is impossible. Finally, we remark that a self-bilinear map proposed in [7] is not essentially self-bilinear.
참고문헌 (11)
- D. Boneh, "Identity-based encryption from the Weil pairing", Advances in cryptology—CRYPTO 2001 (Santa Barbara, CA), 통권 : 2139, pp.213~229 (2001), Lecture Notes in Comput. Sci.
- D. Boneh, "Short signatures from the Weil pairing", Advances in cryptology—ASIACRYPT 2001 (Gold Coast), 통권 : 2248, pp.514~532 (2001), Lecture Notes in Comput. Sci.
- D. Boneh, "Applications of multilinear forms to cryptography", Topics in algebraic and noncommutative geometry (Luminy, 2003, pp.통권 : 324, 71~90[DOI]
- J. Cha, "An identity-based signature from gap Diffie-Hellman groups", Public key cryptography—PKC 2003, 통권 : 2567, pp.18~30 (2002), Lecture Notes in Comput. Sci.
- A. Joux, "A one round protocol for tripartite Diffie-Hellman", Algorithmic number theory (Leiden, 2000), 통권 : 1838, pp.385~393 (2000), Lecture Notes in Comput. Sci
- A. Joux, "The Weil and Tate pairings as building blocks for public key cryptosystems", number theory (Sydney, 2002), 통권 : 2369, pp.20~32 (2002), Lecture Notes in Comput. Sci
- H.-S. Lee, "A self-pairing map and its applications to cryptography", Appl. Math. Comput, 151(3), pp.671~678 (2004)
- A. Menezes, "Reducing elliptic curve logarithms to logarithms in a finite field", IEEE Trans. Inform. Theory, 39(5), pp.1639~1646 (1993)
- N. Smart, "Identity-based Authenticated Key Agreement Protocol based on Weil Pairing", Electronic Letters, 38, pp.630~632 (2002)
- E. Verheul, "Evidence that XTR is more secure than supersingular elliptic curve cryptosystems", Advances in cryptology–EUROCRYPT 2001 (Innsbruck), 통권 : 2045, pp.195~210 (2001), Lecture Notes in Comput.
- E. Verheul, "Self-blindable credential certificates from the Weil pairing", Advances in cryptology–ASIACRYPT 2001 (Gold Coast), 통권 : 2248, pp.533~551 (2001), Lecture Notes in Comput. Sci.