{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T00:33:17Z","timestamp":1725841997326},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319272382"},{"type":"electronic","value":"9783319272399"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27239-9_9","type":"book-chapter","created":{"date-parts":[[2015,12,8]],"date-time":"2015-12-08T12:19:50Z","timestamp":1449577190000},"page":"152-169","source":"Crossref","is-referenced-by-count":1,"title":["Zero-Knowledge Interactive Proof Systems for New Lattice Problems"],"prefix":"10.1007","author":[{"given":"Claude","family":"Cr\u00e9peau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raza Ali","family":"Kazmi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,8]]},"reference":[{"key":"9_CR1","series-title":"Springer International Series in Engineering and ComputerScience","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0897-7","volume-title":"Complexity of Lattice Problems: A Cryptographic Perspective","author":"D Micciancio","year":"2002","unstructured":"Micciancio, D., Goldwasser, S.: Complexity of Lattice Problems: A Cryptographic Perspective. Springer International Series in Engineering and ComputerScience, vol. 671. Springer, USA (2002)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikertm, C., Vaikuntanathan, V.: How to use a short basis: trapdoors for hard lattices and new cryptographic constructions. In: STOC, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-642-13190-5_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"D Cash","year":"2010","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 523\u2013552. Springer, Heidelberg (2010)"},{"key":"9_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Company, New York (1990)"},{"key":"9_CR5","unstructured":"Kazmi, R.A.: Cryptography from Post-Quantum Assumptions. Ph.D. Thesis, School of Computer Science, McGill University, 2015. Supervised by Claude Cr\u00e9peau. \n                      https:\/\/eprint.iacr.org\/2015\/376"},{"issue":"1","key":"9_CR6","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-38616-9_14","volume-title":"Post-Quantum Cryptography","author":"N Sendrier","year":"2013","unstructured":"Sendrier, N., Simos, D.E.: The hardness of code equivalence over \n                      \n                        \n                      \n                      $$\\mathbb{F}_q$$\n                     and its application to code-based cryptography. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol. 7932, pp. 203\u2013216. Springer, Heidelberg (2013)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography, vol. I & II. Cambridge University Press (2001\u20132004)","DOI":"10.1017\/CBO9780511546891"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-540-45146-4_17","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"D Micciancio","year":"2003","unstructured":"Micciancio, D., Vadhan, S.P.: Statistical zero-knowledge proofs with efficient provers: lattice problems and more. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 282\u2013298. Springer, Heidelberg (2003)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/978-3-540-85174-5_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C Peikert","year":"2008","unstructured":"Peikert, C., Vaikuntanathan, V.: Noninteractive statistical zero-knowledge proofs for lattice problems. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 536\u2013553. Springer, Heidelberg (2008)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC, pp. 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S.: On the limits of non-approximability of lattice problems. In: STOC, pp. 23\u201326 (1998)","DOI":"10.1145\/276698.276704"},{"issue":"3","key":"9_CR14","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/0717034","volume":"17","author":"GW Stewart","year":"1980","unstructured":"Stewart, G.W.: The efficient generation of random orthogonal matrices with an application to condition estimators. SIAM J. Numer. Anal. 17(3), 403\u2013409 (1980)","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1214\/aoms\/1177692644","volume":"43","author":"G Marsaglia","year":"1972","unstructured":"Marsaglia, G.: Choosing a point from the surface of a sphere. Ann. Math. Stat. 43(2), 645\u2013647 (1972)","journal-title":"Ann. Math. Stat."},{"issue":"3","key":"9_CR16","doi-asserted-by":"publisher","first-page":"482","DOI":"10.2478\/s11533-008-0038-4","volume":"6","author":"E Schmutz","year":"2008","unstructured":"Schmutz, E.: Rational points on the unit sphere. Cent. Eur. J. Math. 6(3), 482\u2013487 (2008)","journal-title":"Cent. Eur. J. Math."},{"issue":"7","key":"9_CR17","doi-asserted-by":"publisher","first-page":"1675","DOI":"10.1016\/j.jnt.2010.01.017","volume":"130","author":"C Pernet","year":"2010","unstructured":"Pernet, C., Stein, W.: Fast computation of hermite normal forms of random integer matrices. J. Number Theor. 130(7), 1675\u20131683 (2010)","journal-title":"J. Number Theor."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Sipser, M.: Private coins versus public coins in interactive proof systems. In: STOC, pp. 59\u201368 (1986)","DOI":"10.1145\/12130.12137"},{"issue":"2","key":"9_CR19","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","volume":"25","author":"RB Boppana","year":"1987","unstructured":"Boppana, R.B., H\u00e5astad, J., Zachos, S.: Does co-NP have short interactive proofs? J. Inf. Process. Lett. 25(2), 127\u2013132 (1987)","journal-title":"J. Inf. Process. Lett."},{"issue":"5","key":"9_CR20","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1109\/18.623157","volume":"43","author":"E Petrank","year":"1997","unstructured":"Petrank, E., Roth, R.M.: Is code equivalence easy to decide? IEEE Trans. Inf. Theor. 43(5), 1602\u20131604 (1997)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012)"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Sahai, A., Vadhan, S.: Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge. In: STOC, pp. 399\u2013408 (1998)","DOI":"10.1145\/276698.276852"},{"key":"9_CR23","unstructured":"Tanner, M.A., Thisted, R.A.: Appl. Stat. 31, 199\u2013206 (1982)"},{"issue":"2","key":"9_CR24","doi-asserted-by":"publisher","first-page":"131","DOI":"10.2307\/2323943","volume":"98","author":"H Liebeck","year":"1991","unstructured":"Liebeck, H.: Osborne, anthony: the generation of all rational orthogonal matrices. Am. Math. Monthly 98(2), 131\u2013133 (1991)","journal-title":"Am. Math. Monthly"},{"key":"9_CR25","series-title":"Number Theory and Discrete Mathematics","volume-title":"Post-Quantum Cryptography","author":"DJ Bernstein","year":"2008","unstructured":"Bernstein, D.J., Buchmann, J.A., Dahmen, E.: Post-Quantum Cryptography. Number Theory and Discrete Mathematics. Springer, Heidelberg (2008). ISBN 978-3-540-88701-0"},{"key":"9_CR26","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1990","unstructured":"Garey, M., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990). ISBN 0-7167-1045-5"},{"key":"9_CR27","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Technical memo, California Institute of Technology (1978)"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27239-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T16:23:24Z","timestamp":1559319804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27239-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319272382","9783319272399"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27239-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}