한국통신학회논문지 (The Journal of Korean Institute of Communications and Information Sciences)

  • 제40권5호
  • /
  • Pages.833-840
  • /
  • 2015
  • /
  • 1226-4717(pISSN)
  • /
  • 2287-3880(eISSN)
한국통신학회 (The Korean Institute of Commucations and Information Sciences)
권호 표지
DOI QR코드

DOI QR Code

다항식 상등성 영지식 증명의 일반화

Generalization of Zero-Knowledge Proof of Polynomial Equality

  • Kim, Myungsun (The Univ. of Suwon, Dept. of Infomation Security) ;
  • Kang, Bolam (The Univ. of Suwon, Dept. of Infomation Security)
  • 투고 : 2014.03.23
  • 심사 : 2015.04.24
  • 발행 : 2015.05.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 논문에서는 미리 알려진 임의의 다항식과 암호화된 다항식의 곱셈을 수행한 후, 해당 곱셈이 정당하게 수행되었음을 보이기 위해 증명자 (Prover)와 검증자 (Verifier)간의 다항식 상등성 영지식증명 (Zero-knowledge Proof) 프로토콜을 일반화할 수 있는 방법을 다룬다. 이를 위하여 다항식의 상등성을 증명하는 일반화된 프로토콜을 제시하고 랜덤오라클 (Random Oracle) 모델에서 안전성을 증명한다. 이러한 기법은 안전한 집합연산 기법을 포함하여 다항식에 기반한 다자간 연산기법 (Secure Multi-party Computation)에 적용될 수 있다.

In this paper, we are interested in a generalization of zero-knowledge interactive protocols between prover and verifier, especially to show that the product of an encrypted polynomial and a random polynomial, but published by a secure commitment scheme was correctly computed by the prover. To this end, we provide a generalized protocol for proving that the resulting polynomial is correctly computed by an encrypted polynomial and another committed polynomial. Further we show that the protocol is also secure in the random oracle model. We expect that our generalized protocol can play a role of building blocks in implementing secure multi-party computation including private set operations.

키워드

참고문헌

  1. R. Cramer, M. Franklin, B. Scheonmakers, and M. Yung, "Multi-authority secret-ballot elections with linear work," Advances in Cryptology-Eurocrypt LNCS, vol. 1070, pp. 72-83, 1996.
  2. T. ElGamal, "A public-key cryptosystem and a signature scheme based on discrete logarithms," Advances in Cryptology-Crypto LNCS, pp. 10-18, 1985.
  3. S. Goldwasser, S. Micali, and C. Rackoff, "The knowledge complexity of interactive proof systems," SIAM J. Comput., vol. 18, no. 1, pp. 186-208, 1989. https://doi.org/10.1137/0218012
  4. O. Goldreich, S. Micali, and A. Wigderson, "Proofs that yield nothing but their vality," J. ACM, vol. 38, no. 3, pp. 690-728, 1991. https://doi.org/10.1145/116825.116852
  5. O. Goldreich, Foundations of cryptography vol. 1, Cambridge Press, 2004.
  6. L. Kissner and D. Song, "Privacy-preserving set operation," Advances in cryptology-Crypto LNCS, vol. 3621, pp. 241-157, 2005.
  7. P. Paillier, "Public-key crytpsystems based on composite degree residuosity classes," Advances in cryptology-Eurocrypt LNCS, vol. 1592, pp. 223-238, Apr. 1999.

피인용 문헌

  1. 비대면 시대의 신 융합보안 위협과 대응 방안에 대한 고찰 vol.12, pp.1, 2015, https://doi.org/10.15207/jkcs.2021.12.1.001