메뉴 건너뛰기




Volumn 56, Issue 6, 2009, Pages

On lattices, learning with errors, random linear codes, and cryptography

Author keywords

Average case hardness; Cryptography; Lattice; Public key encryption; Quantum computation

Indexed keywords

AVERAGE-CASE HARDNESS; BIT-STRINGS; CRYPTOSYSTEMS; ERROR PROBLEMS; LATTICE; LATTICE PROBLEMS; LEARNING PROBLEM; NATURAL EXTENSION; PUBLIC KEY CRYPTOSYSTEMS; PUBLIC KEY ENCRYPTION; PUBLIC KEYS; QUANTUM ALGORITHMS; QUANTUM COMPUTATION; RANDOM LINEAR CODES;

EID: 70349309809     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1568318.1568324     Document Type: Article
Times cited : (1589)

References (37)
  • 1
    • 27344461174 scopus 로고    scopus 로고
    • Lattice problems in NP intersect coNP
    • (Preliminary version in FOCS'04.)
    • Aharonov, D. and Regev, O. 2005. Lattice problems in NP intersect coNP. J. ACM 52, 5, 749-765. (Preliminary version in FOCS'04.)
    • (2005) J. ACM , vol.52 , Issue.5
    • Aharonov, D.1    Regev, O.2
  • 2
    • 38749147177 scopus 로고    scopus 로고
    • Generating hard instances of lattice problems
    • Dept. Math., Seconda Univ. Napoli, Caserta, (Preliminary version in STOC 1996.)
    • Ajtai, M. 2004. Generating hard instances of lattice problems. In Complexity of Computations and Proofs. Quad. Mat., vol. 13. Dept. Math., Seconda Univ. Napoli, Caserta, 1-32. (Preliminary version in STOC 1996.)
    • (2004) Complexity of Computations and Proofs. Quad. Mat. , vol.13
    • Ajtai, M.1
  • 8
    • 51249173801 scopus 로고
    • On Lovasz' lattice reduction and the nearest lattice point problem
    • Babai, L. 1986. On Lovasz' lattice reduction and the nearest lattice point problem. Combinatorica 6, 1, 1-13.
    • (1986) Combinatorica , vol.6 , Issue.1
    • Babai, L.1
  • 9
    • 0000303291 scopus 로고
    • New bounds in some transference theorems in the geometry of numbers
    • Banaszczyk, W. 1993. New bounds in some transference theorems in the geometry of numbers. Math. Ann. 296, 4, 625-635.
    • (1993) Math. Ann. , vol.296 , Issue.4
    • Banaszczyk, W.1
  • 10
    • 84877639283 scopus 로고
    • Cryptographic primitives based on hard learning problems
    • In Advances in cryptologyCRYPTO '93. Springer-Verlag, Berlin, Germany
    • Blum, A., Furst, M., Kearns, M., and Lipton, R. J. 1994. Cryptographic primitives based on hard learning problems. In Advances in cryptologyCRYPTO '93. Lecture Notes in Computer Science, vol. 773. Springer-Verlag, Berlin, Germany, 278-291.
    • (1994) Lecture Notes in Computer Science , vol.773
    • Blum, A.1    Furst, M.2    Kearns, M.3    Lipton, R.J.4
  • 11
    • 24144453496 scopus 로고    scopus 로고
    • Noise-tolerant learning, the parity problem, and the statistical query model
    • Blum, A., Kalai, A., and Wasserman, H. 2003. Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM 50, 4, 506-519.
    • (2003) J. ACM , vol.50 , Issue.4
    • Blum, A.1    Kalai, A.2    Wasserman, H.3
  • 17
    • 0032613321 scopus 로고    scopus 로고
    • Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
    • Goldreich, O., Micciancio, D., Safra, S., and Seifert, J.-P. 1999. Approximating shortest lattice vectors is not harder than approximating closest lattice vectors. Inf. Proc. Lett. 71, 2, 55-61.
    • (1999) Inf. Proc. Lett. , vol.71 , Issue.2
    • Goldreich, O.1    Micciancio, D.2    Safra, S.3    Seifert, J.-P.4
  • 21
    • 38049064421 scopus 로고    scopus 로고
    • Multi-bit cryptosystems based on lattice problems
    • In Public Key Cryptography - PKC 2007. Springer, Berlin
    • Kawachi, A., Tanaka, K., and Xagawa, K. 2007. Multi-bit cryptosystems based on lattice problems. In Public Key Cryptography - PKC 2007. Lecture Notes in Comput. Sci., vol. 4450. Springer, Berlin, 315-329.
    • (2007) Lecture Notes in Comput. Sci. , vol.4450
    • Kawachi, A.1    Tanaka, K.2    Xagawa, K.3
  • 22
    • 56249100680 scopus 로고    scopus 로고
    • Cryptographic hardness for learning intersections of halfspaces
    • (Preliminary version in FOCS'06.)
    • Klivans, A. R., and Sherstov, A. A. 2009. Cryptographic hardness for learning intersections of halfspaces. J. Comput. System Sci. 75, 1, 2-12. (Preliminary version in FOCS'06.)
    • (2009) J. Comput. System Sci. , vol.75 , Issue.1
    • Klivans, A.R.1    Sherstov, A.A.2
  • 24
    • 34250244723 scopus 로고
    • Factoring polynomials with rational coefficients
    • Lenstra, A. K., Lenstra, Jr., H. W., and Lovsz, L. 1982. Factoring polynomials with rational coefficients. Math. Ann. 261, 4, 515-534.
    • (1982) Math. Ann. , vol.261 , Issue.4
    • Lenstra, A.K.1    Lenstra Jr., H.W.2    Lovsz, L.3
  • 25
    • 33750038259 scopus 로고    scopus 로고
    • On bounded distance decoding for general lattices
    • In International Workshop on Randomization and Computation - Proceedings of RANDOM 2006. Springer-Verlag, Berlin, Germany
    • Liu, Y.-K., Lyubashevsky, V., and Micciancio, D. 2006. On bounded distance decoding for general lattices. In International Workshop on Randomization and Computation - Proceedings of RANDOM 2006. Lecture Notes in Computer Science, vol. 4110. Springer-Verlag, Berlin, Germany, 450-461.
    • (2006) Lecture Notes in Computer Science , vol.4110
    • Liu, Y.-K.1    Lyubashevsky, V.2    Micciancio, D.3
  • 26
    • 16244401113 scopus 로고    scopus 로고
    • On bounded distance decoding, unique shortest vectors, and the minimum distance problem. Manuscript. Micciancio, D. 2004. Almost perfect lattices, the covering radius problem, and applications to Ajtai's connection factor
    • (Preliminary version in STOC 2002.)
    • Lyubashevsky, V., and Micciancio, D. 2009. On bounded distance decoding, unique shortest vectors, and the minimum distance problem. Manuscript. Micciancio, D. 2004. Almost perfect lattices, the covering radius problem, and applications to Ajtai's connection factor. SIAM Journal on Computing 34, 1, 118-169. (Preliminary version in STOC 2002.)
    • (2009) SIAM Journal on Computing , vol.34 , Issue.1
    • Lyubashevsky, V.1    Micciancio, D.2
  • 28
    • 38749097694 scopus 로고    scopus 로고
    • Worst-case to average-case reductions based on Gaussian measures
    • Micciancio, D., and Regev, O. 2007. Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput. 37, 1, 267-302.
    • (2007) SIAM J. Comput. , vol.37 , Issue.1
    • Micciancio, D.1    Regev, O.2
  • 32
    • 70350642078 scopus 로고    scopus 로고
    • Public-key cryptosystems from the worst-case shortest vector problem
    • ACM, New York
    • Peikert, C. 2009. Public-key cryptosystems from the worst-case shortest vector problem. In Proc. 41st ACM Symp. on Theory of Computing (STOC). ACM, New York, 333-342.
    • (2009) Proc. 41st ACM Symp. on Theory of Computing (STOC).
    • Peikert, C.1
  • 33
    • 51849126892 scopus 로고    scopus 로고
    • A framSework for efficient and composable oblivious transfer
    • In Advances in cryptologyCRYPTO '08. Springer-Verlag, Berlin, Germany
    • Peikert, C., Vaikuntanathan, V., and Waters, B. 2008. A framSework for efficient and composable oblivious transfer. In Advances in cryptologyCRYPTO '08. Lecture Notes in Computer Science, vol. 5157. Springer-Verlag, Berlin, Germany, 554-571.
    • (2008) Lecture Notes in Computer Science , vol.5157
    • Peikert, C.1    Vaikuntanathan, V.2    Waters, B.3
  • 35
    • 20444451186 scopus 로고    scopus 로고
    • New lattice based cryptographic constructions
    • (Preliminary version in STOC'03.)
    • Regev, O. 2004. New lattice based cryptographic constructions. J. ACM 51, 6, 899-942. (Preliminary version in STOC'03.)
    • (2004) J. ACM , vol.51 , Issue.6
    • Regev, O.1
  • 37
    • 0023532388 scopus 로고
    • A hierarchy of polynomial time lattice basis reduction algorithms
    • Schnorr, C.-P. 1987. A hierarchy of polynomial time lattice basis reduction algorithms. Theoret. Comput. Sci. 53, 2-3, 201-224.
    • (1987) Theoret. Comput. Sci. , vol.53 , Issue.2-3
    • Schnorr, C.-P.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.