{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T14:22:35Z","timestamp":1726323755281},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030343385"},{"type":"electronic","value":"9783030343392"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34339-2_22","type":"book-chapter","created":{"date-parts":[[2019,11,19]],"date-time":"2019-11-19T00:04:55Z","timestamp":1574121895000},"page":"401-412","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Using Freivalds\u2019 Algorithm to Accelerate Lattice-Based Signature Verifications"],"prefix":"10.1007","author":[{"given":"Arnaud","family":"Sipasseuth","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Plantard","sequence":"additional","affiliation":[]},{"given":"Willy","family":"Susilo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,6]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: STOC 1997, pp. 284\u2013293. ACM (1997)","DOI":"10.1145\/258533.258604"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Bajard, J.C., Eynard, J., Merkiche, N.: Multi-fault attack detection for RNS cryptographic architecture. IEEE 23rd Symposium on Computer Arithmetic, July 2016","DOI":"10.1109\/ARITH.2016.16"},{"issue":"6","key":"22_CR3","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/TC.2004.2","volume":"53","author":"JC Bajard","year":"2004","unstructured":"Bajard, J.C., Imbert, L.: A full RNS implementation of RSA. IEEE Trans. Comput. 53(6), 769\u2013774 (2004)","journal-title":"IEEE Trans. Comput."},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-319-69453-5_23","volume-title":"Selected Areas in Cryptography \u2013 SAC 2016","author":"J-C Bajard","year":"2017","unstructured":"Bajard, J.-C., Eynard, J., Hasan, M.A., Zucca, V.: A full RNS variant of FV like somewhat homomorphic encryption schemes. In: Avanzi, R., Heys, H. (eds.) SAC 2016. LNCS, vol. 10532, pp. 423\u2013442. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-69453-5_23"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Bajard, J.C., Plantard, T.: RNS bases and conversions. In: Optical Science and Technology, the SPIE 49th Annual Meeting, pp. 60\u201369 (2004)","DOI":"10.1117\/12.557891"},{"issue":"3\u20134","key":"22_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system I: the user language. J. Symbolic Comput. 24(3\u20134), 235\u2013265 (1997)","journal-title":"J. Symbolic Comput."},{"key":"22_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107325708","volume-title":"Combinatorial Matrix Theory","author":"RA Brualdi","year":"1991","unstructured":"Brualdi, R.A., Ryser, H.J.: Combinatorial Matrix Theory, vol. 39. Cambridge University Press, Cambridge (1991)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-99639-4_1","volume-title":"Computer Algebra in Scientific Computing","author":"J-G Dumas","year":"2018","unstructured":"Dumas, J.-G.: Proof-of-work certificates that can be efficiently computed in the cloud (Invited Talk). In: Gerdt, V.P., Koepf, W., Seiler, W.M., Vorozhtsov, E.V. (eds.) CASC 2018. LNCS, vol. 11077, pp. 1\u201317. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-99639-4_1"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-59870-3_7","volume-title":"Information Security and Privacy","author":"J-G Dumas","year":"2017","unstructured":"Dumas, J.-G., Zucca, V.: Prover efficient public verification of dense or sparse\/structured matrix-vector multiplication. In: Pieprzyk, J., Suriadi, S. (eds.) ACISP 2017. LNCS, vol. 10343, pp. 115\u2013134. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-59870-3_7"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-09526-8_5","volume-title":"Mathematical Foundations of Computer Science 1979","author":"R Freivalds","year":"1979","unstructured":"Freivalds, R.: Fast probabilistic algorithms. In: Be\u010dv\u00e1\u0159, J. (ed.) MFCS 1979. LNCS, vol. 74, pp. 57\u201369. Springer, Heidelberg (1979). \n                      https:\/\/doi.org\/10.1007\/3-540-09526-8_5"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-662-49896-5_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"N Gama","year":"2016","unstructured":"Gama, N., Izabach\u00e8ne, M., Nguyen, P.Q., Xie, X.: Structural lattice reduction: generalized worst-case to average-case reductions and homomorphic cryptosystems. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 528\u2013558. Springer, Heidelberg (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-662-49896-5_19"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Garner, H.L.: The residue number system. In: Papers Presented at the March 3-5, 1959, Western Joint Computer Conference, pp. 146\u2013153. ACM (1959)","DOI":"10.1145\/1457838.1457864"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. arXiv preprint: quant-ph\/9605043 (1996)","DOI":"10.1145\/237814.237866"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/11894063_13","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2006","author":"M Joye","year":"2006","unstructured":"Joye, M., Paillier, P.: Fast generation of prime numbers on portable devices: an update. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol. 4249, pp. 160\u2013173. Springer, Heidelberg (2006). \n                      https:\/\/doi.org\/10.1007\/11894063_13"},{"issue":"2","key":"22_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0020-0190(93)90224-W","volume":"45","author":"T Kimbrel","year":"1993","unstructured":"Kimbrel, T., Sinha, R.K.: A probabilistic algorithm for verifying matrix products using o(n2) time and log2(n) + o(1) random bits. Inf. Process. Lett. 45(2), 107\u2013110 (1993)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"22_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00202269","volume":"8","author":"UM Maurer","year":"1995","unstructured":"Maurer, U.M.: Fast generation of prime numbers and secure public-key cryptographic parameters. J. Cryptology 8(3), 123\u2013155 (1995)","journal-title":"J. Cryptology"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-44670-2_11","volume-title":"Cryptography and Lattices","author":"D Micciancio","year":"2001","unstructured":"Micciancio, D.: Improving lattice based cryptosystems using the Hermite normal form. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 126\u2013145. Springer, Heidelberg (2001). \n                      https:\/\/doi.org\/10.1007\/3-540-44670-2_11"},{"issue":"2","key":"22_CR18","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00145-008-9031-0","volume":"22","author":"PQ Nguyen","year":"2009","unstructured":"Nguyen, P.Q., Regev, O.: Learning a parallelepiped: cryptanalysis of GGH and NTRU signatures. J. Cryptology 22(2), 139\u2013160 (2009)","journal-title":"J. Cryptology"},{"key":"22_CR19","unstructured":"NIST: Post-quantum cryptography standardization (2018). \n                      https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography"},{"issue":"7","key":"22_CR20","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 Theory 130(7), 1675\u20131683 (2010)","journal-title":"J. Number Theory"},{"key":"22_CR21","unstructured":"Plantard, T., Sipasseuth, A., Dumondelle, C., Susilo, W.: DRS: diagonal dominant reduction for lattice-based signature. In: PQC Standardization Conference, Round 1 Submissions (2018). \n                      https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/round-1\/submissions\/DRS.zip"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-540-78440-1_17","volume-title":"Public Key Cryptography \u2013 PKC 2008","author":"T Plantard","year":"2008","unstructured":"Plantard, T., Susilo, W., Win, K.T.: A digital signature scheme based on CVP\n                      \n                        \n                      \n                      $$_{\\infty }$$\n                    . In: Cramer, R. (ed.) PKC 2008. LNCS, vol. 4939, pp. 288\u2013307. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-78440-1_17"},{"issue":"6","key":"22_CR23","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1145\/1039488.1039490","volume":"51","author":"O Regev","year":"2004","unstructured":"Regev, O.: New lattice-based cryptographic constructions. J. ACM (JACM) 51(6), 899\u2013942 (2004)","journal-title":"J. ACM (JACM)"},{"key":"22_CR24","unstructured":"Seiler, G.: Faster AVX2 optimized NTT multiplication for ring-LWE lattice cryptography. Cryptology ePrint Archive, Report 2018\/039 (2018)"},{"issue":"5","key":"22_CR25","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"22_CR26","unstructured":"e Silva, T.O.: Tables of values of pi(x) and of pi2(x) (2018). \n                      http:\/\/sweet.ua.pt\/tos\/primes.html"},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-030-21548-4_7","volume-title":"Information Security and Privacy","author":"A Sipasseuth","year":"2019","unstructured":"Sipasseuth, A., Plantard, T., Susilo, W.: Improving the security of the DRS scheme with uniformly chosen random noise. In: Jang-Jaccard, J., Guo, F. (eds.) ACISP 2019. LNCS, vol. 11547, pp. 119\u2013137. Springer, Cham (2019). \n                      https:\/\/doi.org\/10.1007\/978-3-030-21548-4_7"},{"key":"22_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-030-03329-3_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"Y Yu","year":"2018","unstructured":"Yu, Y., Ducas, L.: Learning strikes again: the case of the DRS signature scheme. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11273, pp. 525\u2013543. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-030-03329-3_18"}],"container-title":["Lecture Notes in Computer Science","Information Security Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34339-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,19]],"date-time":"2019-11-19T00:21:45Z","timestamp":1574122905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34339-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030343385","9783030343392"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34339-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISPEC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security Practice and Experience","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kuala Lumpur","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malaysia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ispec2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ccs.research.utar.edu.my\/ispec2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}