{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:36:35Z","timestamp":1761708995825,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,3]],"date-time":"2014-06-03T00:00:00Z","timestamp":1401753600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,3]]},"DOI":"10.1145\/2600694.2600695","type":"proceedings-article","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T18:18:31Z","timestamp":1401473911000},"page":"33-42","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Provably secure LWE encryption with smallish uniform noise and secret"],"prefix":"10.1145","author":[{"given":"Daniel","family":"Cabarcas","sequence":"first","affiliation":[{"name":"Universidad Nacional de Colombia, sede Medell\u00edn, Medell\u00edn, Colombia"}]},{"given":"Florian","family":"G\u00f6pfert","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt, Darmstadt, Germany"}]},{"given":"Patrick","family":"Weiden","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt, Darmstadt, Germany"}]}],"member":"320","published-online":{"date-parts":[[2014,6,3]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology -- CRYPTO","author":"Alperin-Sheriff Jacob","year":"2013","unstructured":"Jacob Alperin-Sheriff and Chris Peikert . Practical bootstrapping in quasilinear time . In Ran Canetti and Juan A. Garay, editors, Advances in Cryptology -- CRYPTO 2013 , volume 8042 of Lecture Notes in Computer Science , pages 1 -- 20 . Springer Berlin Heidelberg , 2013. Jacob Alperin-Sheriff and Chris Peikert. Practical bootstrapping in quasilinear time. In Ran Canetti and Juan A. Garay, editors, Advances in Cryptology -- CRYPTO 2013, volume 8042 of Lecture Notes in Computer Science, pages 1--20. Springer Berlin Heidelberg, 2013."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_35"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_15"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.12"},{"key":"e_1_3_2_1_5_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/978-3-642-22792-9_29","volume-title":"Advances in Cryptology -- CRYPTO","author":"Brakerski Zvika","year":"2011","unstructured":"Zvika Brakerski and Vinod Vaikuntanathan . Fully homomorphic encryption from ring-LWE and security for key dependent messages . In Phillip Rogaway, editor, Advances in Cryptology -- CRYPTO 2011 , volume 6841 of Lecture Notes in Computer Science , pages 505 -- 524 . Springer Berlin Heidelberg , 2011. Zvika Brakerski and Vinod Vaikuntanathan. Fully homomorphic encryption from ring-LWE and security for key dependent messages. In Phillip Rogaway, editor, Advances in Cryptology -- CRYPTO 2011, volume 6841 of Lecture Notes in Computer Science, pages 505--524. Springer Berlin Heidelberg, 2011."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"e_1_3_2_1_9_1","volume-title":"Efficient sampling from discrete Gaussians for lattice-based cryptography on a constrained device","author":"Galbraith Steven D.","year":"2012","unstructured":"Steven D. Galbraith and Nagarjun C. Dwarakanath . Efficient sampling from discrete Gaussians for lattice-based cryptography on a constrained device , 2012 . Preprint , available at http:\/\/www.math.auckland.ac.nz\/ sgal018\/gen-gaussians.pdf. Steven D. Galbraith and Nagarjun C. Dwarakanath. Efficient sampling from discrete Gaussians for lattice-based cryptography on a constrained device, 2012. Preprint, available at http:\/\/www.math.auckland.ac.nz\/ sgal018\/gen-gaussians.pdf."},{"key":"e_1_3_2_1_10_1","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology -- EUROCRYPT","author":"Garg Sanjam","year":"2013","unstructured":"Sanjam Garg , Craig Gentry , and Shai Halevi . Candidate multilinear maps from ideal lattices . In Thomas Johansson and Phong Q. Nguyen, editors, Advances in Cryptology -- EUROCRYPT 2013 , volume 7881 of Lecture Notes in Computer Science , pages 1 -- 17 . Springer Berlin Heidelberg , 2013. Sanjam Garg, Craig Gentry, and Shai Halevi. Candidate multilinear maps from ideal lattices. In Thomas Johansson and Phong Q. Nguyen, editors, Advances in Cryptology -- EUROCRYPT 2013, volume 7881 of Lecture Notes in Computer Science, pages 1--17. Springer Berlin Heidelberg, 2013."},{"key":"e_1_3_2_1_11_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/978-3-642-40084-1_27","volume-title":"Advances in Cryptology -- CRYPTO","author":"Garg Sanjam","year":"2013","unstructured":"Sanjam Garg , Craig Gentry , Shai Halevi , Amit Sahai , and Brent Waters . Attribute-based encryption for circuits from multilinear maps . In Ran Canetti and Juan A. Garay, editors, Advances in Cryptology -- CRYPTO 2013 , volume 8043 of Lecture Notes in Computer Science , pages 479 -- 499 . Springer Berlin Heidelberg , 2013. Sanjam Garg, Craig Gentry, Shai Halevi, Amit Sahai, and Brent Waters. Attribute-based encryption for circuits from multilinear maps. In Ran Canetti and Juan A. Garay, editors, Advances in Cryptology -- CRYPTO 2013, volume 8043 of Lecture Notes in Computer Science, pages 479--499. Springer Berlin Heidelberg, 2013."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374407"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the 21st USENIX Security Symposium","author":"Heninger Nadia","year":"2012","unstructured":"Nadia Heninger , Zakir Durumeric , Eric Wustrow , and J. Alex Halderman . Mining your Ps and Qs: Detection of widespread weak keys in network devices . In Proceedings of the 21st USENIX Security Symposium , August 2012 . Nadia Heninger, Zakir Durumeric, Eric Wustrow, and J. Alex Halderman. Mining your Ps and Qs: Detection of widespread weak keys in network devices. In Proceedings of the 21st USENIX Security Symposium, August 2012."},{"key":"e_1_3_2_1_14_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1007\/978-3-642-32009-5_37","volume-title":"Advances in Cryptology -- CRYPTO","author":"Lenstra Arjen K.","year":"2012","unstructured":"Arjen K. Lenstra , James P. Hughes , Maxime Augier , Joppe W. Bos , Thorsten Kleinjung , and Christophe Wachter . Public keys . In Reihaneh Safavi-Naini and Ran Canetti, editors, Advances in Cryptology -- CRYPTO 2012 , volume 7417 of Lecture Notes in Computer Science , pages 626 -- 642 . Springer Berlin Heidelberg , 2012. Arjen K. Lenstra, James P. Hughes, Maxime Augier, Joppe W. Bos, Thorsten Kleinjung, and Christophe Wachter. Public keys. In Reihaneh Safavi-Naini and Ran Canetti, editors, Advances in Cryptology -- CRYPTO 2012, volume 7417 of Lecture Notes in Computer Science, pages 626--642. Springer Berlin Heidelberg, 2012."},{"key":"e_1_3_2_1_15_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/978-3-642-19074-2_21","volume-title":"Topics in Cryptology -- CT-RSA","author":"Lindner Richard","year":"2011","unstructured":"Richard Lindner and Chris Peikert . Better key sizes (and attacks) for LWE-based encryption . In Aggelos Kiayias, editor, Topics in Cryptology -- CT-RSA 2011 , volume 6558 of Lecture Notes in Computer Science , pages 319 -- 339 . Springer Berlin Heidelberg , 2011. Richard Lindner and Chris Peikert. Better key sizes (and attacks) for LWE-based encryption. In Aggelos Kiayias, editor, Topics in Cryptology -- CT-RSA 2011, volume 6558 of Lecture Notes in Computer Science, pages 319--339. Springer Berlin Heidelberg, 2011."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"e_1_3_2_1_18_1","volume-title":"Public Key Cryptography","author":"Micciancio Daniele","year":"2010","unstructured":"Daniele Micciancio . Duality in lattice cryptography , Public Key Cryptography , 2010 . Invited talk. Daniele Micciancio. Duality in lattice cryptography, Public Key Cryptography, 2010. Invited talk."},{"key":"e_1_3_2_1_19_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-3-642-40041-4_2","volume-title":"Advances in Cryptology - CRYPTO","author":"Micciancio Daniele","year":"2013","unstructured":"Daniele Micciancio and Chris Peikert . Hardness of SIS and LWE with small parameters . In Ran Canetti and Juan A. Garay, editors, Advances in Cryptology - CRYPTO 2013 , volume 8042 of Lecture Notes in Computer Science , pages 21 -- 39 . Springer Berlin Heidelberg , 2013. Daniele Micciancio and Chris Peikert. Hardness of SIS and LWE with small parameters. In Ran Canetti and Juan A. Garay, editors, Advances in Cryptology - CRYPTO 2013, volume 8042 of Lecture Notes in Computer Science, pages 21--39. Springer Berlin Heidelberg, 2013."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447360"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536461"},{"key":"e_1_3_2_1_22_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/978-3-642-14623-7_5","volume-title":"Advances in Cryptology -- CRYPTO","author":"Peikert Chris","year":"2010","unstructured":"Chris Peikert . An efficient and parallel Gaussian sampler for lattices . In Tal Rabin, editor, Advances in Cryptology -- CRYPTO 2010 , volume 6223 of Lecture Notes in Computer Science , pages 80 -- 97 . Springer Berlin Heidelberg , 2010. Chris Peikert. An efficient and parallel Gaussian sampler for lattices. In Tal Rabin, editor, Advances in Cryptology -- CRYPTO 2010, volume 6223 of Lecture Notes in Computer Science, pages 80--97. Springer Berlin Heidelberg, 2010."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568324"},{"key":"e_1_3_2_1_24_1","unstructured":"Victor Shoup. Number theory library (NTL) for C+.  Victor Shoup. Number theory library (NTL) for C+."}],"event":{"name":"ASIA CCS '14: 9th ACM Symposium on Information, Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Kyoto Japan","acronym":"ASIA CCS '14"},"container-title":["Proceedings of the 2nd ACM workshop on ASIA public-key cryptography"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2600694.2600695","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2600694.2600695","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:55:52Z","timestamp":1750229752000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2600694.2600695"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,3]]},"references-count":22,"alternative-id":["10.1145\/2600694.2600695","10.1145\/2600694"],"URL":"https:\/\/doi.org\/10.1145\/2600694.2600695","relation":{},"subject":[],"published":{"date-parts":[[2014,6,3]]},"assertion":[{"value":"2014-06-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}