연산을 검증하기 위한 영지식 증명 프로토콜의 기법 및 응용 사례 분석
Analysis of Zero-Knowledge Protocols for Verifiable Computation and Its Applications
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
최근 개인정보 보호법이 개정되고 개인정보에 대한 이목이 더해짐에 따라 각 기업들은 고객의 신원정보를 확인해야하는 의무(Know Your Costomer, 이하 KYC)와 동시에 이 정보를 개인정보보호법에 위반되지 않도록 처리 및 관리(개인정보보호법)를 해야 하는 의무를 가진다. 이러한 문제점을 해결할 수 있는 기술 중 하나는 영지식 증명(Zero-Knowledge Proof, 이하 ZKP)이다. ZKP를 사용하면 직접적으로 신원정보를 노출시키지 않으면서 해당 신원에 대한 검증이 가능하여 기업의 입장에서 신원정보 확인의 의무를 다함과 동시에 개인정보 관리에 대한 부담을 덜 수 있다. ZKP는 이 이외에도 많은 응용에 적용될 수 있는 기술로 본 논문에서는 현재 활발하게 연구되고 있는 ZKP기법 및 그 응용 사례를 분석하고 현실적인 모델에서의 ZKP의 적용을 위한 연구 방향을 제시한다.
Abstract
According to the recent revision of Privacy Policy and the emerging importance of personal information, cooperations must verify customer identity (Know Your Costomer, KYC) while processing and managing this information so that it does not violate the Privacy Policy. One of the solution of this problem is zero-knowledge proof (ZKP). The use of the ZKP enables to verify the identity without exposing the identity information directly, thereby reducing the burden on the management of personal information while fulfilling the obligation of the cooperations to verify the identity. The ZKP could be employed to many other applications. In this paper, we analyze the ZKP technique and its applications currently being actively studied.
참고문헌 (24)
- A. Gabizon, "PlonK: permutations over Lagrange-bases for oecumenical noninteractive arguments of knowledge", IACR Cryptol (2019)
- A. Kate, "Constant-size commitments to polynomials and their applications", Proceedings of the ASIACRYPT 2010, 6477, pp.177~194 (2010)
- B. Bünz, "Transparent SNARKs from DARK compilers", Proceedings of the EUROCRYPT 2020, 12105, pp.677~706 (2020)
- B. Bünz, "Bulletproofs: short proofs for confidential transactions and more", Proceedings of the IEEE Symposium on Security and Privacy 2018, pp.315~334 (2018)
- B. Libert, "Lattice-based zero-knowledge arguments for integer relations", Proceedings of the CRYPTO 2018, 10992, pp.700~732 (2018)
- E. Ben-Sasson, "Fast Reed-Solomon interactive oracle proofs of proximity", International Colloquium on Automata, Languages, and Programming 2018, 107, pp.14:1~14:17 (2018)
- E. Ben-sasson, "Scalable zero knowledge with no trusted setup", Proceedings of the CRYPTO 2019, 11694, pp.701~732 (2019)
- H. Chung, "Bulletproofs+ : shorter proofs for privacy-enhanced distributed ledger", IACR Cryptol, 735 (2020)
- J. Camenisch, "Signature schemes and anonymous credentials from bilinear maps", Proceedings of the CRYPTO 2004, 3152, pp.56~72 (2004)
- J. Camenisch, "Anonymous attestation using the strong diffie hellman assumption revisited", Proceedings of the International Conference on Trust and Trustworthy Computing 2016, 9824, pp.1~20 (2016)
- J. Groth, "On the size of pairing-based non-interactive arguments", Proceedings of the Eurocrypt 2016, 9666, pp.305~326 (2016)
- J. Groth, "Updatable and universal common reference strings with applications to zk-SNARKs", Proceedings of the CRYPTO 2018, 10993, pp.698~728 (2018)
- J. Thaler, "Time-optimal interactive proofs for circuit evaluation", Proceedings of the CRYPTO 2013, 8043, pp.71~89 (2013)
- J. Zhang, "Transparent polynomial delegation and its applications to zero knowledge proof", Proceedings of the IEEE Symposium on Security and Privacy 2020, pp.859~876 (2020)
- M.H. Au, "Constant-size dynamic k-TAA", Proceedings of the International Conference on Security and Cryptography for Networks 2006, 4116, pp.111~125 (2006)
- M. Maller, "Sonic:zero-knowledge SNARKs from linear-size universal and updatable structured reference strings", Proceedings of the ACM SIGSAC Conference on Computer and Communications Security Association for Computing Machinery 2019, pp.2111~2128 (2019)
- R. Gilad-Bachrach, "Cryptonets:applying neural networks to encrypted data with high throughput and accuracy", Proceedings of the International Conference on Machine Learning 2016, 48, pp.201~210 (2016)
- R.S. Wahby, "Doubly-efficient zkSNARKs without trusted setup", Proceedings of the IEEE Symposium on Security and Privacy 2018, pp.926~943 (2018)
- S. Bowe, "Scalable multi-party computation for zk-SNARK parameters in the random beacon model", IACR Cryptol, 1050 (2017)
- S. Goldwasser, "The knowledge complexity of interactive proof systems", Proceddings of the ACM Symposium on Theory of Computing, pp.291~304 (1985)
- "Decentralized Identifiers(DIDs)" (2021)[URL]
- Y. Oren, "On the cunning power of cheating verifiers: some observations about zero knowledge proofs", Proceedings of the Symposium on Foundations of Computer Science 1987, pp.462~471 (1987)
- Z. Ghodsi, "Safetynets: verifiable execution of deep neural networks on an untrusted cloud", Proceedings of the Advances in Neural Information Processing Systems 2017, pp.4672~4681 (2017)
- (2020)[URL]