Ideal lattice (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Ideal lattice" in English language version.

refsWebsite

Global rank English rank

15doi.org

2^nd place

6iacr.org

5,032^nd place

3,357^th place

4web.archive.org

1^st place

2ucsd.edu

1,933^rd place

1,342^nd place

2psu.edu

207^th place

136^th place

2tau.ac.il

4,464^th place

4,468^th place

1gatech.edu

4,448^th place

2,923^rd place

1semanticscholar.org

11^th place

8^th place

1arxiv.org

69^th place

59^th place

1ens.fr

6,325^th place

8,806^th place

1unibs.it

low place

1handle.net

102^nd place

76^th place

1acm.org

1,185^th place

840^th place

acm.org

portal.acm.org

Gentry, Craig (2009). "Fully homomorphic encryption using ideal lattices". Proceedings of the forty-first annual ACM symposium on Theory of computing. pp. 169–178. doi:10.1145/1536414.1536440. ISBN 978-1-60558-506-2.

arxiv.org

Regev, Oded (2009). "On lattices, learning with errors, random linear codes, and cryptography" (PDF). Journal of the ACM. 56 (6): 1–40. arXiv:2401.03703. doi:10.1145/1568318.1568324. Archived from the original (PDF) on 2010-12-06.

doi.org

Lyubashevsky, Vadim (2008). "Lattice-Based Identification Schemes Secure Under Active Attacks" (PDF). Public Key Cryptography – PKC 2008. Lecture Notes in Computer Science. Vol. 4939. pp. 162–179. doi:10.1007/978-3-540-78440-1_10. ISBN 978-3-540-78439-5.
Lyubashevsky, Vadim; Peikert, Chris; Regev, Oded (2010). "On Ideal Lattices and Learning with Errors over Rings". In Gilbert, Henri (ed.). Advances in Cryptology – EUROCRYPT 2010. Lecture Notes in Computer Science. Vol. 6110. pp. 1–23. CiteSeerX 10.1.1.297.6108. doi:10.1007/978-3-642-13190-5_1. ISBN 978-3-642-13189-9.
Lyubashevsky, Vadim; Peikert, Chris; Regev, Oded (2010). "On Ideal Lattices and Learning with Errors over Rings". Advances in Cryptology – EUROCRYPT 2010. Lecture Notes in Computer Science. Vol. 6110. pp. 1–23. doi:10.1007/978-3-642-13190-5_1. ISBN 978-3-642-13189-9.
Lyubashevsky, Vadim; Micciancio, Daniele (2006). "Generalized Compact Knapsacks Are Collision Resistant" (PDF). Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 4052. pp. 144–155. doi:10.1007/11787006_13. ISBN 978-3-540-35907-4.
Micciancio, Daniele (2007). "Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions". Computational Complexity. 16 (4): 365–411. doi:10.1007/s00037-007-0234-9.
Peikert, Chris; Rosen, Alon (2006). "Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices" (PDF). Theory of Cryptography. Lecture Notes in Computer Science. Vol. 3876. pp. 145–166. doi:10.1007/11681878_8. ISBN 978-3-540-32731-8. Archived from the original (PDF) on 2012-10-16.
Lyubashevsky, Vadim; Micciancio, Daniele (2008). "Asymptotically Efficient Lattice-Based Digital Signatures" (PDF). Theory of Cryptography. Lecture Notes in Computer Science. Vol. 4948. pp. 37–54. doi:10.1007/978-3-540-78524-8_3. ISBN 978-3-540-78523-1.
Peikert, Chris (2014-10-01). "Lattice Cryptography for the Internet". In Mosca, Michele (ed.). Post-Quantum Cryptography. Lecture Notes in Computer Science. Vol. 8772. Springer International Publishing. pp. 197–219. CiteSeerX 10.1.1.800.4743. doi:10.1007/978-3-319-11659-4_12. ISBN 978-3-319-11658-7. S2CID 8123895.
Lyubashevsky, Vadim (2012). "Lattice Signatures without Trapdoors" (PDF). Advances in Cryptology – EUROCRYPT 2012. Lecture Notes in Computer Science. Vol. 7237. pp. 738–755. doi:10.1007/978-3-642-29011-4_43. ISBN 978-3-642-29010-7.
Micciancio, Daniele; Regev, Oded (2009). "Lattice-based Cryptography" (PDF). Post-Quantum Cryptography. pp. 147–191. doi:10.1007/978-3-540-88702-7_5. ISBN 978-3-540-88701-0. Archived from the original (PDF) on 2011-07-23.
Regev, Oded (2009). "On lattices, learning with errors, random linear codes, and cryptography" (PDF). Journal of the ACM. 56 (6): 1–40. arXiv:2401.03703. doi:10.1145/1568318.1568324. Archived from the original (PDF) on 2010-12-06.
Güneysu, Tim; Lyubashevsky, Vadim; Pöppelmann, Thomas (2012). "Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems" (PDF). Cryptographic Hardware and Embedded Systems – CHES 2012. Lecture Notes in Computer Science. Vol. 7428. pp. 530–547. doi:10.1007/978-3-642-33027-8_31. ISBN 978-3-642-33026-1. Archived from the original (PDF) on 2014-05-18.
Stehlé, Damien; Steinfeld, Ron; Tanaka, Keisuke; Xagawa, Keita (2009). "Efficient Public Key Encryption Based on Ideal Lattices: (Extended Abstract)" (PDF). Advances in Cryptology – ASIACRYPT 2009. Lecture Notes in Computer Science. Vol. 5912. pp. 617–635. doi:10.1007/978-3-642-10366-7_36. ISBN 978-3-642-10365-0.
Rivest, R. L.; Shamir, A.; Adleman, L. (1978). "A method for obtaining digital signatures and public-key cryptosystems". Communications of the ACM. 21 (2): 120–126. doi:10.1145/359340.359342. hdl:1721.1/148910.
Gentry, Craig (2009). "Fully homomorphic encryption using ideal lattices". Proceedings of the forty-first annual ACM symposium on Theory of computing. pp. 169–178. doi:10.1145/1536414.1536440. ISBN 978-1-60558-506-2.

ens.fr

di.ens.fr

Güneysu, Tim; Lyubashevsky, Vadim; Pöppelmann, Thomas (2012). "Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems" (PDF). Cryptographic Hardware and Embedded Systems – CHES 2012. Lecture Notes in Computer Science. Vol. 7428. pp. 530–547. doi:10.1007/978-3-642-33027-8_31. ISBN 978-3-642-33026-1. Archived from the original (PDF) on 2014-05-18.

gatech.edu

cc.gatech.edu

Peikert, Chris; Rosen, Alon (2006). "Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices" (PDF). Theory of Cryptography. Lecture Notes in Computer Science. Vol. 3876. pp. 145–166. doi:10.1007/11681878_8. ISBN 978-3-540-32731-8. Archived from the original (PDF) on 2012-10-16.

handle.net

hdl.handle.net

Rivest, R. L.; Shamir, A.; Adleman, L. (1978). "A method for obtaining digital signatures and public-key cryptosystems". Communications of the ACM. 21 (2): 120–126. doi:10.1145/359340.359342. hdl:1721.1/148910.

iacr.org

eprint.iacr.org

Jintai Ding and Richard Lindner. Identifying Ideal Lattices. In Cryptology ePrint Archive, Report 2007/322, 2007.
Ding, Jintai; Xie, Xiang; Lin, Xiaodong (2012). A Simple Provably Secure Key Exchange Scheme Based on the Learning with Errors Problem (PDF).
Lyubashevsky, Vadim (2012). "Lattice Signatures without Trapdoors" (PDF). Advances in Cryptology – EUROCRYPT 2012. Lecture Notes in Computer Science. Vol. 7237. pp. 738–755. doi:10.1007/978-3-642-29011-4_43. ISBN 978-3-642-29010-7.
Singh, Vikram (2015). "A Practical Key Exchange for the Internet using Lattice Cryptography". Cryptology ePrint Archive.
Stehlé, Damien; Steinfeld, Ron; Tanaka, Keisuke; Xagawa, Keita (2009). "Efficient Public Key Encryption Based on Ideal Lattices: (Extended Abstract)" (PDF). Advances in Cryptology – ASIACRYPT 2009. Lecture Notes in Computer Science. Vol. 5912. pp. 617–635. doi:10.1007/978-3-642-10366-7_36. ISBN 978-3-642-10365-0.

iacr.org

Lyubashevsky, Vadim; Micciancio, Daniele (2008). "Asymptotically Efficient Lattice-Based Digital Signatures" (PDF). Theory of Cryptography. Lecture Notes in Computer Science. Vol. 4948. pp. 37–54. doi:10.1007/978-3-540-78524-8_3. ISBN 978-3-540-78523-1.

psu.edu

citeseerx.ist.psu.edu

Lyubashevsky, Vadim; Peikert, Chris; Regev, Oded (2010). "On Ideal Lattices and Learning with Errors over Rings". In Gilbert, Henri (ed.). Advances in Cryptology – EUROCRYPT 2010. Lecture Notes in Computer Science. Vol. 6110. pp. 1–23. CiteSeerX 10.1.1.297.6108. doi:10.1007/978-3-642-13190-5_1. ISBN 978-3-642-13189-9.
Peikert, Chris (2014-10-01). "Lattice Cryptography for the Internet". In Mosca, Michele (ed.). Post-Quantum Cryptography. Lecture Notes in Computer Science. Vol. 8772. Springer International Publishing. pp. 197–219. CiteSeerX 10.1.1.800.4743. doi:10.1007/978-3-319-11659-4_12. ISBN 978-3-319-11658-7. S2CID 8123895.

semanticscholar.org

api.semanticscholar.org

Peikert, Chris (2014-10-01). "Lattice Cryptography for the Internet". In Mosca, Michele (ed.). Post-Quantum Cryptography. Lecture Notes in Computer Science. Vol. 8772. Springer International Publishing. pp. 197–219. CiteSeerX 10.1.1.800.4743. doi:10.1007/978-3-319-11659-4_12. ISBN 978-3-319-11658-7. S2CID 8123895.

tau.ac.il

cs.tau.ac.il

Micciancio, Daniele; Regev, Oded (2009). "Lattice-based Cryptography" (PDF). Post-Quantum Cryptography. pp. 147–191. doi:10.1007/978-3-540-88702-7_5. ISBN 978-3-540-88701-0. Archived from the original (PDF) on 2011-07-23.
Regev, Oded (2009). "On lattices, learning with errors, random linear codes, and cryptography" (PDF). Journal of the ACM. 56 (6): 1–40. arXiv:2401.03703. doi:10.1145/1568318.1568324. Archived from the original (PDF) on 2010-12-06.

ucsd.edu

cseweb.ucsd.edu

Lyubashevsky, Vadim (2008). "Lattice-Based Identification Schemes Secure Under Active Attacks" (PDF). Public Key Cryptography – PKC 2008. Lecture Notes in Computer Science. Vol. 4939. pp. 162–179. doi:10.1007/978-3-540-78440-1_10. ISBN 978-3-540-78439-5.
Lyubashevsky, Vadim; Micciancio, Daniele (2006). "Generalized Compact Knapsacks Are Collision Resistant" (PDF). Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 4052. pp. 144–155. doi:10.1007/11787006_13. ISBN 978-3-540-35907-4.

unibs.it

luca-giuzzi.unibs.it

Rivest, R.; Adleman, L.; Dertouzos, M. (1978). "On data banks and privacy homomorphisms" (PDF). In Foundations of Secure Computation. Academic Press. pp. 169–180.

web.archive.org

Peikert, Chris; Rosen, Alon (2006). "Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices" (PDF). Theory of Cryptography. Lecture Notes in Computer Science. Vol. 3876. pp. 145–166. doi:10.1007/11681878_8. ISBN 978-3-540-32731-8. Archived from the original (PDF) on 2012-10-16.
Micciancio, Daniele; Regev, Oded (2009). "Lattice-based Cryptography" (PDF). Post-Quantum Cryptography. pp. 147–191. doi:10.1007/978-3-540-88702-7_5. ISBN 978-3-540-88701-0. Archived from the original (PDF) on 2011-07-23.
Regev, Oded (2009). "On lattices, learning with errors, random linear codes, and cryptography" (PDF). Journal of the ACM. 56 (6): 1–40. arXiv:2401.03703. doi:10.1145/1568318.1568324. Archived from the original (PDF) on 2010-12-06.
Güneysu, Tim; Lyubashevsky, Vadim; Pöppelmann, Thomas (2012). "Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems" (PDF). Cryptographic Hardware and Embedded Systems – CHES 2012. Lecture Notes in Computer Science. Vol. 7428. pp. 530–547. doi:10.1007/978-3-642-33027-8_31. ISBN 978-3-642-33026-1. Archived from the original (PDF) on 2014-05-18.