Browse > Article
http://dx.doi.org/10.13089/JKIISC.2012.22.6.1265

Closest Vector Problem Based Interactive Proof  

Lee, Kyunghee (University of Suwon)
Nyang, DaeHun (Inha University)
Publication Information
Journal of the Korea Institute of Information Security & Cryptology / v.22, no.6, 2012 , pp. 1265-1270 More about this Journal
Abstract
In this paper, we propose a new closest vector problem based interactive proof that is useful for authentication. Contribution of this paper is that the proposed protocol does not use a special form of a lattice, but a general lattice, which makes the protocol design very simple and easy to be proved. We prove its security in terms of completeness, soundness, simulatability.
Keywords
Closest Vector Problem; Interactive Proof; Authentication Protocol;
Citations & Related Records
연도 인용수 순위
  • Reference
1 M. Ajtai and C. Dwork, "A public-key cryptosystem with worst-case/average-case equivalence," In Proc. 29th Annual ACM Symp. on Theory of Computing (STOC), pp. 284-293, May 1997.
2 A. Fiat and A. Shamir, "How to prove to yourself: practical solutions to identification and signature problems," Advances in Cryptology-Crypto 1986, pp. 186-194, Aug. 1987.
3 C. Gentry, "Fully homomorphic encryption using ideal lattices," In STOC 2009, pp. 169-178, May 2009.
4 O. Goldreich, S. Goldwasser, and S. Halevi, "Public-key cryptosystems from lattice reduction problems," Advances in cryptology-Crypto 1997, pp. 112-131. Aug. 1997.
5 L. Guillou and J. J. Quisquater, "A paradoxical identity-based signature scheme resulting from zero-knowledge," Advances in Cryptology-Crypto 1988, pp. 216-231, Aug. 1988.
6 V. Lyubashevsky, "Lattice-based identification schemes secure under active attacks," PKC 2008, pp. 162-179, March 2008.
7 D. Micciancio and S. Vadhan, "Statistical zero-knowledge proofs with efficient provers: lattice problems and more," Advances in cryptology - Crypto 2002, pp. 282-298, Aug. 2003.
8 P. Q. Nguyen, "Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97," Advances in Cryptology Crypto 1999, pp. 288-304, Aug. 1999.
9 C. P. Schnorr, "Efficient Identification and Signatures for Smart cards," Advances in Cryptology-Crypto 1989, pp. 239-251. Aug. 1989.
10 양대헌, "Chosen Message Attack Against Goldreich-Goldwasser-Halevis Lattice Based Signature Scheme," 한국정보보호학회 논문지, 14(1), pp. 47-57, 2004년 2월.
11 A. K. Lenstra, H. W. Lenstra, and L. Lovasz, "Factoring polynomials with rational coefficients," Mathematische Annalen Vol. 261, No. 4, pp. 515-534, April 1982.
12 C. Gentry and M. Szydlo, "Cryptanalysis of the Revised NTRU signature scheme," Advances in Cryptology-Eurocrypt'02, pp. 299-320, April 2002.
13 A. Scholten and F. Vercauteren, "An Introduction to Elliptic and Hyperelliptic Curve Cryptography and the NTRU Cryptosystem," http://www.math.unibonn.de/-saxena/courses/WS2010-ref4.pdf
14 I. Dinur et al., "Approximating CVP to Within Almost-Polynomial Factors is NP-Hard," Combinatorica, vol. 23, no. 2, pp. 205-243, April 2003.   DOI   ScienceOn