{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:27:36Z","timestamp":1778128056505,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,5,30]],"date-time":"2016-05-30T00:00:00Z","timestamp":1464566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SFB 1119"],"award-info":[{"award-number":["SFB 1119"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,5,30]]},"DOI":"10.1145\/2898420.2898422","type":"proceedings-article","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T22:58:31Z","timestamp":1464130711000},"page":"11-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Creating Cryptographic Challenges Using Multi-Party Computation"],"prefix":"10.1145","author":[{"given":"Johannes","family":"Buchmann","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt, Darmstadt, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Niklas","family":"B\u00fcscher","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt, Darmstadt, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"G\u00f6pfert","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt, Darmstadt, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Katzenbeisser","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt, Darmstadt, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juliane","family":"Kr\u00e4mer","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt, Darmstadt, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Micciancio","sequence":"additional","affiliation":[{"name":"University of California, San Diego, USA, San Diego, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sander","family":"Siim","sequence":"additional","affiliation":[{"name":"University of Tartu, Estonia & Cybernetica AS, Estonia, Tartu, Estonia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine","family":"van Vredendaal","sequence":"additional","affiliation":[{"name":"Technische Universiteit Eindhoven, Netherlands, Eindhoven, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Walter","sequence":"additional","affiliation":[{"name":"University of California, San Diego, USA, San Diego, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,5,30]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Certicom ECC challenge. https:\/\/www.certicom.com\/images\/pdfs\/challenge-2009.pdf. Accessed: 2015-12-21.  Certicom ECC challenge. https:\/\/www.certicom.com\/images\/pdfs\/challenge-2009.pdf. Accessed: 2015-12-21."},{"key":"e_1_3_2_1_2_1","unstructured":"NTRU challenge. https:\/\/www.securityinnovation.com\/uploads\/ntru-challenge-parameter-sets-and-public-keys-new.pdf. Accessed: 2015-12-21.  NTRU challenge. https:\/\/www.securityinnovation.com\/uploads\/ntru-challenge-parameter-sets-and-public-keys-new.pdf. Accessed: 2015-12-21."},{"key":"e_1_3_2_1_3_1","unstructured":"The RSA factoring challenge. http:\/\/www.emc.com\/emc-plus\/rsa-labs\/historical\/the-rsa-factoring-challenge.htm. Accessed: 2015-12-18.  The RSA factoring challenge. http:\/\/www.emc.com\/emc-plus\/rsa-labs\/historical\/the-rsa-factoring-challenge.htm. Accessed: 2015-12-18."},{"key":"e_1_3_2_1_4_1","volume-title":"Algebraic algorithms for LWE problems. IACR Cryptology ePrint Archive","author":"Albrecht M. R.","year":"2014","unstructured":"M. R. Albrecht , C. Cid , J. Faug\u00e8re , R. Fitzpatrick , and L. Perret . Algebraic algorithms for LWE problems. IACR Cryptology ePrint Archive , 2014 :1018, 2014. M. R. Albrecht, C. Cid, J. Faug\u00e8re, R. Fitzpatrick, and L. Perret. Algebraic algorithms for LWE problems. IACR Cryptology ePrint Archive, 2014:1018, 2014."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-013-9864-x"},{"key":"e_1_3_2_1_6_1","series-title":"Lecture Notes in Computer Science","first-page":"293","volume-title":"Information Security and Cryptology - ICISC 2013 - 16th International Conference","author":"Albrecht M. R.","year":"2013","unstructured":"M. R. Albrecht , R. Fitzpatrick , and F. G\u00f6pfert . On the efficacy of solving LWE by reduction to unique-svp . In H. Lee and D. Han, editors, Information Security and Cryptology - ICISC 2013 - 16th International Conference , Seoul, Korea, November 27-29, 2013 , Revised Selected Papers, volume 8565 of Lecture Notes in Computer Science , pages 293 -- 310 . Springer , 2013. M. R. Albrecht, R. Fitzpatrick, and F. G\u00f6pfert. On the efficacy of solving LWE by reduction to unique-svp. In H. Lee and D. Han, editors, Information Security and Cryptology - ICISC 2013 - 16th International Conference, Seoul, Korea, November 27-29, 2013, Revised Selected Papers, volume 8565 of Lecture Notes in Computer Science, pages 293--310. Springer, 2013."},{"key":"e_1_3_2_1_8_1","unstructured":"S.\n      Arora\n     and \n      R.\n      Ge\n  . \n  New algorithms for learning in presence of errors\n  . In L. Aceto M. Henzinger and J. Sgall editors Automata Languages\n   and Programming - 38th International Colloquium ICALP \n  2011 Zurich Switzerland July 4--8 2011 Proceedings Part I volume \n  6755\n   of \n  Lecture Notes in Computer Science pages \n  403\n  --\n  415\n  . \n  Springer 2011.   S. Arora and R. Ge. New algorithms for learning in presence of errors. In L. Aceto M. Henzinger and J. Sgall editors Automata Languages and Programming - 38th International Colloquium ICALP 2011 Zurich Switzerland July 4--8 2011 Proceedings Part I volume 6755 of Lecture Notes in Computer Science pages 403--415. Springer 2011."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-009-9040-7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579403"},{"key":"e_1_3_2_1_11_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/978-3-319-04852-9_2","volume-title":"Topics in Cryptology - CT-RSA 2014 - The Cryptographer's Track at the RSA Conference","author":"Bai S.","year":"2014","unstructured":"S. Bai and S. D. Galbraith . An improved compression technique for signatures based on learning with errors . In J. Benaloh, editor, Topics in Cryptology - CT-RSA 2014 - The Cryptographer's Track at the RSA Conference 2014 , San Francisco, CA , USA, February 25--28, 2014. Proceedings, volume 8366 of Lecture Notes in Computer Science , pages 28 -- 47 . Springer , 2014. S. Bai and S. D. Galbraith. An improved compression technique for signatures based on learning with errors. In J. Benaloh, editor, Topics in Cryptology - CT-RSA 2014 - The Cryptographer's Track at the RSA Conference 2014, San Francisco, CA, USA, February 25--28, 2014. Proceedings, volume 8366 of Lecture Notes in Computer Science, pages 28--47. Springer, 2014."},{"key":"e_1_3_2_1_12_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1007\/978-3-319-08344-5_21","volume-title":"W. Susilo and Y. Mu","author":"Bai S.","year":"2014","unstructured":"S. Bai and S. D. Galbraith . Lattice decoding attacks on binary LWE . In W. Susilo and Y. Mu , editors, Information Security and Privacy - 19th Australasian Conference, ACISP 2014 , Wollongong, NSW, Australia, July 7--9, 2014. Proceedings, volume 8544 of Lecture Notes in Computer Science , pages 322 -- 337 . Springer , 2014. S. Bai and S. D. Galbraith. Lattice decoding attacks on binary LWE. In W. Susilo and Y. Mu, editors, Information Security and Privacy - 19th Australasian Conference, ACISP 2014, Wollongong, NSW, Australia, July 7--9, 2014. Proceedings, volume 8544 of Lecture Notes in Computer Science, pages 322--337. Springer, 2014."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-88702-7","volume-title":"Post-quantum cryptography. Mathematics and Statistics","author":"Bernstein D. J.","year":"2009","unstructured":"D. J. Bernstein , J. Buchmann , and E. Dahmen , editors . Post-quantum cryptography. Mathematics and Statistics . 2009 . D. J. Bernstein, J. Buchmann, and E. Dahmen, editors. Post-quantum cryptography. Mathematics and Statistics. 2009."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/792538.792543"},{"key":"e_1_3_2_1_15_1","first-page":"227","volume-title":"FC 2015, San Juan, Puerto Rico","volume":"8975","author":"Bogdanov D.","year":"2015","unstructured":"D. Bogdanov , M. J\u00f5emets , S. Siim , and M. Vaht . How the estonian tax and customs board evaluated a tax fraud detection system based on secure multi-party computation. In Financial Cryptography and Data Security - 19th International Conference , FC 2015, San Juan, Puerto Rico , January 26-30, 2015 , Revised Selected Papers , volume 8975 of LNCS, pages 227 -- 234 . Springer, 2015. D. Bogdanov, M. J\u00f5emets, S. Siim, and M. Vaht. How the estonian tax and customs board evaluated a tax fraud detection system based on secure multi-party computation. In Financial Cryptography and Data Security - 19th International Conference, FC 2015, San Juan, Puerto Rico, January 26-30, 2015, Revised Selected Papers, volume 8975 of LNCS, pages 227--234. Springer, 2015."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2014.21"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88313-5_13"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488680"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.12"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88403-3_6"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538462"},{"key":"e_1_3_2_1_22_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/978-3-662-46800-5_8","volume-title":"Advances in Cryptology - EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"Duc A.","year":"2015","unstructured":"A. Duc , F. Tram\u00e8r , and S. Vaudenay . Better algorithms for LWE and LWR . In E. Oswald and M. Fischlin, editors, Advances in Cryptology - EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques , Sofia, Bulgaria, April 26-30, 2015 , Proceedings, Part I, volume 9056 of Lecture Notes in Computer Science , pages 173 -- 202 . Springer , 2015. A. Duc, F. Tram\u00e8r, and S. Vaudenay. Better algorithms for LWE and LWR. In E. Oswald and M. Fischlin, editors, Advances in Cryptology - EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part I, volume 9056 of Lecture Notes in Computer Science, pages 173--202. Springer, 2015."},{"key":"e_1_3_2_1_23_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/978-3-642-40041-4_3","volume-title":"Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference","author":"Ducas L.","year":"2013","unstructured":"L. Ducas , A. Durmus , T. Lepoint , and V. Lyubashevsky . Lattice signatures and bimodal gaussians . In R. Canetti and J. A. Garay, editors, Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference , Santa Barbara, CA, USA , August 18-22, 2013 . Proceedings, Part I, volume 8042 of Lecture Notes in Computer Science , pages 40 -- 56 . Springer , 2013. L. Ducas, A. Durmus, T. Lepoint, and V. Lyubashevsky. Lattice signatures and bimodal gaussians. In R. Canetti and J. A. Garay, editors, Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part I, volume 8042 of Lecture Notes in Computer Science, pages 40--56. Springer, 2013."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54631-0_20"},{"key":"e_1_3_2_1_26_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 2011 - The Cryptographers' Track at the RSA Conference","author":"Lindner R.","year":"2011","unstructured":"R. Lindner and C. Peikert . Better key sizes (and attacks) for LWE-based encryption . In A. Kiayias, editor, Topics in Cryptology - CT-RSA 2011 - The Cryptographers' Track at the RSA Conference 2011 , San Francisco, CA , USA, February 14-18, 2011. Proceedings, volume 6558 of Lecture Notes in Computer Science , pages 319 -- 339 . Springer , 2011. R. Lindner and C. Peikert. Better key sizes (and attacks) for LWE-based encryption. In A. Kiayias, editor, Topics in Cryptology - CT-RSA 2011 - The Cryptographers' Track at the RSA Conference 2011, San Francisco, CA, USA, February 14-18, 2011. Proceedings, volume 6558 of Lecture Notes in Computer Science, pages 319--339. Springer, 2011."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36095-4_19"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538462_32"},{"key":"e_1_3_2_1_29_1","volume-title":"Creating a challenge for ideal lattices. IACR Cryptology ePrint Archive","author":"Plantard T.","year":"2013","unstructured":"T. Plantard and M. Schneider . Creating a challenge for ideal lattices. IACR Cryptology ePrint Archive , 2013 :39, 2013. T. Plantard and M. Schneider. Creating a challenge for ideal lattices. IACR Cryptology ePrint Archive, 2013:39, 2013."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568324"},{"key":"e_1_3_2_1_32_1","volume-title":"MQ challenge: Hardness evaluation of solving multivariate quadratic problems. IACR Cryptology ePrint Archive","author":"Yasuda T.","year":"2015","unstructured":"T. Yasuda , X. Dahan , Y. Huang , T. Takagi , and K. Sakurai . MQ challenge: Hardness evaluation of solving multivariate quadratic problems. IACR Cryptology ePrint Archive , 2015 :275, 2015. T. Yasuda, X. Dahan, Y. Huang, T. Takagi, and K. Sakurai. MQ challenge: Hardness evaluation of solving multivariate quadratic problems. IACR Cryptology ePrint Archive, 2015:275, 2015."}],"event":{"name":"ASIA CCS '16: ACM Asia Conference on Computer and Communications Security","location":"Xi'an China","acronym":"ASIA CCS '16","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 3rd ACM International Workshop on ASIA Public-Key Cryptography"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2898420.2898422","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2898420.2898422","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:30Z","timestamp":1750222590000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2898420.2898422"}},"subtitle":["The LWE Challenge"],"short-title":[],"issued":{"date-parts":[[2016,5,30]]},"references-count":30,"alternative-id":["10.1145\/2898420.2898422","10.1145\/2898420"],"URL":"https:\/\/doi.org\/10.1145\/2898420.2898422","relation":{},"subject":[],"published":{"date-parts":[[2016,5,30]]},"assertion":[{"value":"2016-05-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}