양자 컴퓨팅 환경에서 안전한 다중 서명 기법
A Post-Quantum Multi-Signature Scheme
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
최근 양자 컴퓨터의 개발이 가속화되면서 기존 인터넷 환경에서 사용되고 있는 인수분해 및 이산대수 기반의 전자서명 기법들의 안전성에 대한 문제가 제기되고 있다. 이에 대응하기 위해 미국 국립표준기술연구원(NIST)의 표준화 작업을 비롯하여 양자 컴퓨팅 환경에서 안전한 여러 가지 전자서명 기법들이 제시되고 있다. 본 논문에서는 2018년 Behnia 등이 CCS 컨퍼런스에서 발표한 TACHYON 전자서명 기법을 이용한 다중 서명 기법을 설계하여 제시하고, 안전성을 증명하고자 한다. 다중 서명 기법은 최근 많은 관심을 받고 있는 암호화폐 분야에서 전자지갑의 개인키 의존도를 분산하여 보다 안전한 전자지갑 시스템을 구성할 수 있는 핵심 기술로, 최근 많은 연구자들과 개발자들이 관심을 갖고 있는 전자서명 응용 분야이다. 본 논문에서 제시하는 다중 서명 기법은 일반 공개키 모델(plain public key model)에서 공개키 결합(public key aggregation)이 가능한 기법으로, 부가적인 영지식 증명(zero-knowledge proof) 기법이 필요하지 않으며, 결합 된 단일 공개키만으로 효율적인 시스템을 구성할 수 있는 기법이다.
Abstract
Recently, the acceleration of the development of quantum computers has raised the issue of the safety of factorization and discrete logarithm based digital signature schemes used in existing Internet environments. To solve the issue, several digital signature schemes are presented that are safe in post-quantum computing environments, including standardization work by the National Institute of Standards and Technology(NIST). In this paper, we design and present a multi-signature scheme based on the TACHYON announced by Behnia et al. in 2018 CCS conference, and prove the security. Multi-signature schemes are key techniques that can distribute the dependence of cryptocurrency-wallet on private keys in the cryptocurrency field, which has recently received much attention as an digital signature application, and many researchers and developers have recently been interested. The multi-signature scheme presented in this paper enables public key aggregation in a plain public key model, which does not require additional zero-knowledge proof, and can construct an effective scheme with only an aggregated public key.
참고문헌 (14)
- D. Boneh, "Compact multi-signatures for smaller blockchains", International Conference on the Theory and Application of Cryptology and Information Security, pp.435~464 (2018), Springer
- D. Micciancio, "Generalized compact knapsacks, cyclic lattices, and efficient one-way functions", computational complexity, 16(4), pp.365~411 (2007)
- D. Pointcheval, "Security arguments for digital signatures and blind signatures", Journal of Cryptology, 13(3), pp.361~396 (2000)
- G. Maxwell, "Simple schnorr multi-signatures with applications to bitcoin", Designs, Codes and Cryptography, 87(4), pp.2139~2164 (2019)
- Two-round n-out-of-n and multi-signatures and trapdoor commitment from lattices, "I. Damg˚ard", Cryptology ePrint Archive, ~ (2020)
- I. Dinur, "Multi-Target Attacks on the Picnic Signature Scheme and Related Protocols", Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp.699~727 (2019), Springer
- L. Ducas, "CRYSTALS – Dilithium : A Lattice-Based Digital Signatures Scheme", IACR Transactions on Cryptographic Hardware and Embedded Systems, 2018(1), pp.238~268 (2018)
- M. Bellare, "Multi-signatures in the plain public-key model and a general forking lemma", A Proceedings of the 13th ACM conference on Computer and communications security, pp.390~399 (2006)
- M. Fukumitsu, "A tightly-secure lattice-based multisignature", Proceedings of the 6th on ASIA Public-Key Cryptography Workshop, pp.3~11 (2019)
- N. Bindel, "Submission to NIST’s post-quantum project: Lattice-based digital signature scheme qTESLA" (2018)
- P. W. Shor, "Algorithms for quantum computation : Discrete logarithms and factoring", Proceedings 35th annual symposium on foundations of computer science, pp.124~134 (1994)
- R. Behnia, "ACM SIGSAC Conference on Computer and Communications Security, pp", Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp.1855~1867 (2018)
- R. E. Bansarkhani, "An efficient lattice-based multisignature scheme with applications to bitcoins", International Conference on Cryptology and Network Security, pp.140~155 (2016), Springer
- Cryptanalysis of a round optimal lattice-based multisignature scheme, "Z. Y. Liu", Cryptology ePrint Archive, ~ (2020)