래티스에서 ID 기반의 이행성 서명 기법
Identity-Based Transitive Signature Scheme from Lattices
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
이행성 서명 기법은 이행적으로 닫혀있는 그래프에서 간선들을 인증하는 경우 매우 유용하게 사용될 수 있는 기법이다. 다시 말하면, 간선 (i, j)에 대한 인증 값이 있고, 간선 (j, k)에 대한 인증 값이 있을 때, 해당 인증 값을 이행성 서명을 통해 생성하게 되면 간선 (i, k)에 대한 인증 값도 별도의 인증 절차 없이 바로 계산할 수 있게 된다. 본 논문에서 우리는 공개키가 난수 형태가 아닌, ID 구조를 가지는 이행성 서명 기법을 처음으로 설계한다. 우리가 설계한 기법은 래티스의 어려운 문제에 기반을 두고 설계되었다.
Abstract
The transitive signature scheme is a technique that can be very useful when authenticating edges in a graph that is transitively closed. In other words, when there is an authentication value for an edge (i, j) and an authentication value for an edge (j, k), the authentication value for the edge (i, k) can also be calculated immediately without any separate authentication procedure through a transitive signature. In this paper, we propose the first identity-based transitive signature scheme. Our scheme is based on the lattice problem.
참고문헌 (13)
- S. Micali, "Transitive signature schemes", Proceedings of the Cryptographers’ Track, RSA Conference, CT-RSA'02, pp.236~243 (2002)
- S. Xu, "Authenticated AODV Routing Protocol using one-time signature and transitive signature schemes", Journal of Networks, 1(1), pp.47~53 (2006)
- S. R. Hohenberger, "The cryptographic impact of groups with infeasible inversion", Master’s, Department of Electrical Engineering and Computer Science, pp.2003
- S.F. Shahandashti, "A Provably Secure Short Transitive Signature Scheme from Bilinear Group Pairs", Proceedings of the 4th International Conference on Security in Communication Networks, SCN'04, pp.60~76 (2004)
- M. Bellare, "Transitive signatures based on factoring and RSA", Advances in Cryptology, ASIACRYPT'02, pp.397~414 (2002)
- M. Bellare, "Transitive signatures: new schemes and proofs", IEEE Transactions on Information Theory, 51(6), pp.2133~2151 (2005)
- Z. Gong, "Transitive Signature Scheme from LFSR", Journal of Information Science and Engineering, 26(1), pp.131~143 (2010)
- C. Lin, "A New Transitive Signature Scheme", Proceedings of the International Conference on Network and System Security, NSS'16, pp.156~167 (2016)
- Geontae Noh, "Transitive Signature Schemes for Undirected Graphs from Lattices", KSII Transactions on Internet and Information Systems, 13(6), pp.3316~3332 (2019), 한국인터넷정보학회[DOI]
- D. Cash, "Bonsai Trees, or How to Delegate a Lattice Basis", Advances in Cryptology, EUROCRYPT'10, pp.523~552 (2010)
- O. Regev, "On Lattices, Learning with Errors, Random Linear Codes, and Cryptography", Journal of the ACM, 34:1(34:40) (2009)
- J. Alwen, "Generating Shorter Bases for Hard Random Lattice", Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, pp.75~86 (2009)
- C. Gentry, "Trapdoors for Hard Lattices and New Cryptographic Constructions", Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp.197~206 (2008)