-
1
-
-
27344461174
-
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
-
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
-
5
-
-
0034826416
-
A sieve algorithm for the shortest lattice vector problem
-
ACM, New York
-
Ajtai, M., Kumar, R., and Sivakumar, D. 2001. A sieve algorithm for the shortest lattice vector problem. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC). ACM, New York, 601-610.
-
(2001)
Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC).
-
-
Ajtai, M.1
Kumar, R.2
Sivakumar, D.3
-
6
-
-
70350627587
-
Simultaneous hardcore bits and cryptography against memory attacks
-
Springer-Verlag, Berlin, Germany
-
Akavia, A., Goldwasser, S., and Vaikuntanathan, V. 2009. Simultaneous hardcore bits and cryptography against memory attacks. In Proceedings of the 6th IACR Theory of Cryptography Conference (TCC). Springer-Verlag, Berlin, Germany, 474-495.
-
(2009)
Proceedings of the 6th IACR Theory of Cryptography Conference (TCC).
-
-
Akavia, A.1
Goldwasser, S.2
Vaikuntanathan, V.3
-
8
-
-
51249173801
-
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
-
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
-
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
-
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
-
12
-
-
0031377422
-
An improved worst-case to average-case connection for lattice problems
-
IEEE Computer Society Press, Los Alamitos, CA
-
Cai, J.-Y., and Nerurkar, A. 1997. An improved worst-case to average-case connection for lattice problems. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, CA, 468-477.
-
(1997)
Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS).
-
-
Cai, J.-Y.1
Nerurkar, A.2
-
16
-
-
51849137205
-
Trapdoors for hard lattices and new cryptographic constructions
-
ACM, New York
-
Gentry, C., Peikert, C., and Vaikuntanathan, V. 2008. Trapdoors for hard lattices and new cryptographic constructions. In Proceedings of the 40th ACM Symposium on Theory of Computing (STOC). ACM, New York, 197-206.
-
(2008)
Proceedings of the 40th ACM Symposium on Theory of Computing (STOC).
-
-
Gentry, C.1
Peikert, C.2
Vaikuntanathan, V.3
-
17
-
-
0032613321
-
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
-
19
-
-
0024771884
-
How to recycle random bits
-
IEEE Computer Society Press, Los Alamitos, CA
-
Impagliazzo, R., and Zuckerman, D. 1989. How to recycle random bits. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, CA, 248-253.
-
(1989)
Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS).
-
-
Impagliazzo, R.1
Zuckerman, D.2
-
21
-
-
38049064421
-
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
-
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
-
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
-
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
-
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
-
27
-
-
0009554539
-
Complexity of Lattice Problems: A Cryptographic Perspective
-
Kluwer Academic Publishers, Boston, MA.
-
Micciancio, D., and Goldwasser, S. 2002. Complexity of Lattice Problems: A Cryptographic Perspective. The Kluwer International Series in Engineering and Computer Science, vol. 671. Kluwer Academic Publishers, Boston, MA.
-
(2002)
The Kluwer International Series in Engineering and Computer Science
, vol.671
-
-
Micciancio, D.1
Goldwasser, S.2
-
28
-
-
38749097694
-
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
-
29
-
-
38549101839
-
-
In quant-ph/0701115, http://xxx.lanl.gov.
-
Moore, C., Russell, A., and Vazirani, U. 2007. A classical one-way function to confound quantum adversaries. In quant-ph/0701115, http://xxx.lanl.gov.
-
(2007)
A Classical One-way Function to Confound Quantum Adversaries.
-
-
Moore, C.1
Russell, A.2
Vazirani, U.3
-
32
-
-
70350642078
-
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
-
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
-
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
-
36
-
-
33745571012
-
On lattices, learning with errors, random linear codes, andcryptography
-
ACM, New York
-
Regev, O. 2005. On lattices, learning with errors, random linear codes, andcryptography. In Proceedings of the 37th ACM Symposium on Theory of Computing (STOC). ACM, New York, 84-93.
-
(2005)
Proceedings of the 37th ACM Symposium on Theory of Computing (STOC).
-
-
Regev, O.1
-
37
-
-
0023532388
-
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
|