{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:59Z","timestamp":1759637759754,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":27,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811579837"},{"type":"electronic","value":"9789811579844"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-7984-4_10","type":"book-chapter","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T12:03:10Z","timestamp":1597924990000},"page":"129-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["New Lattice-Based Digital Multi-signature Scheme"],"prefix":"10.1007","author":[{"given":"Chunyan","family":"Peng","sequence":"first","affiliation":[]},{"given":"Xiujuan","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,20]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Kaur, R., Kaur, A.: Digital signature. In: 2012 International Conference on Computing Sciences (ICCS). IEEE (2012)","DOI":"10.1109\/ICCS.2012.25"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-48405-1_28","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 99","author":"M Bellare","year":"1999","unstructured":"Bellare, M., Miner, S.K.: A forward-secure digital signature scheme. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 431\u2013448. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_28"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/10718964_25","volume-title":"Information Security and Privacy","author":"S Mitomi","year":"2000","unstructured":"Mitomi, S., Miyaji, A.: A multisignature scheme with message flexibility, order flexibility and order verifiability. In: Dawson, E.P., Clark, A., Boyd, C. (eds.) ACISP 2000. LNCS, vol. 1841, pp. 298\u2013312. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10718964_25"},{"issue":"1","key":"10_CR4","first-page":"12","volume":"27","author":"L Harna","year":"2008","unstructured":"Harna, L., Jian, R.: Efficient identity-based RSA multisignatures. Comput. Secur. 27(1), 12\u201315 (2008)","journal-title":"Efficient identity-based RSA multisignatures. Comput. Secur."},{"key":"10_CR5","first-page":"569","volume":"29","author":"L-J Yi","year":"2001","unstructured":"Yi, L.-J., Bai, G.-Q., Xiao, G.-Z.: Proxy multi-signature: a new type of proxy signature schemes. Acta Electronica Sin. 29, 569\u2013570 (2001)","journal-title":"Acta Electronica Sin."},{"key":"10_CR6","unstructured":"Micciancio, D.: The shortest vector in a lattice is hard to approximate to within some constant. In: The 39th Annual Symposium on Foundations of Computer Science, Los Alamitos, pp. 92\u201398. IEEE Computer Society (1998)"},{"issue":"5","key":"10_CR7","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1145\/1089023.1089027","volume":"52","author":"S Khot","year":"2005","unstructured":"Khot, S.: Hardness of approximating the shortest vector problem in lattices. J. ACM 52(5), 789\u2013808 (2005)","journal-title":"J. ACM"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-46521-9_22","volume-title":"Algorithms and Complexity","author":"I Dinur","year":"2000","unstructured":"Dinur, I.: Approximating SVP\u221eto within almost-polynomial factors is NP-hard. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds.) CIAC 2000. LNCS, vol. 1767, pp. 263\u2013276. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46521-9_22"},{"key":"10_CR9","unstructured":"Boas, P.V.E.: Another NP-complete partition problem and the complexity of computing short vectors in lattices (1981)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: The shortest vector problem in L2 is NP-hard for randomized reductions. In: The 30th Annual ACM Symposium on Theory of Computing, pp. 10\u201319. ACM, New York (1998)","DOI":"10.1145\/276698.276705"},{"key":"10_CR11","first-page":"1","volume":"71","author":"K Itakura","year":"1983","unstructured":"Itakura, K., Nakamura, K.: A public-key cryptosystem suitable for digital multisignatures. NEC Res. Dev. 71, 1\u20138 (1983)","journal-title":"NEC Res. Dev."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Bellare, M., Neven, G.: Multi-signatures in the plain public-key model and a general forking lemma. In: 13th ACM Conference on Computer and Communications Security (CCS2006), Alexandria, USA, 30 October\u20133 November (2006)","DOI":"10.1145\/1180405.1180453"},{"issue":"6","key":"10_CR13","first-page":"533","volume":"20","author":"J Ji","year":"1997","unstructured":"Ji, J., Zhao, R.: New digital multi signature system. J. Comput. Sci. 20(6), 533\u2013538 (1997)","journal-title":"J. Comput. Sci."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"1518","DOI":"10.4028\/www.scientific.net\/AMM.198-199.1518","volume":"198\u2013199","author":"JF Wang","year":"2012","unstructured":"Wang, J.F., Wang, S., Liu, Y.H.: Chinese characters knapsack public key encryption algorithm research. Appl. Mech. Mater. 198\u2013199, 1518\u20131522 (2012)","journal-title":"Appl. Mech. Mater."},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/11792086_39","volume-title":"Algorithmic Number Theory","author":"M-D Huang","year":"2006","unstructured":"Huang, M.-D., Raskind, W.: Signature calculus and discrete logarithm problems. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 558\u2013572. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11792086_39"},{"issue":"4","key":"10_CR16","doi-asserted-by":"publisher","first-page":"R2493","DOI":"10.1103\/PhysRevA.52.R2493","volume":"52","author":"PW Shor","year":"1995","unstructured":"Shor, P.W.: Scheme for reducing decoherence in quantum computer memory. Phys. Rev. A 52(4), R2493 (1995)","journal-title":"Phys. Rev. A"},{"issue":"2","key":"10_CR17","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. Siam Rev. 41(2), 303\u2013332 (1999)","journal-title":"Siam Rev."},{"key":"10_CR18","first-page":"1","volume":"13","author":"M Ajtai","year":"2004","unstructured":"Ajtai, M.: Generation hard instances of lattice problems. Complex. Comput. Proofs Quad. di Mat. 13, 1\u201332 (2004)","journal-title":"Complex. Comput. Proofs Quad. di Mat."},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of STOC, Victoria, pp. 197\u2013206. ACM (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"10_CR20","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). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_27"},{"key":"10_CR21","unstructured":"Ljujic, Z.: Problems in additive number theory. Dissertations & Theses Gradworks (2011)"},{"issue":"1","key":"10_CR22","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007)","journal-title":"SIAM J. Comput."},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48523-6_1","volume-title":"Automata, Languages and Programming","author":"M Ajtai","year":"1999","unstructured":"Ajtai, M.: Generating hard instances of the short basis problem. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 1\u20139. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48523-6_1"},{"key":"10_CR24","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). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_17"},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.cpc.2018.11.005","volume":"237","author":"H De Raedt","year":"2018","unstructured":"De Raedt, H., Jin, F., Willsch, D.: Massively parallel quantum computer simulator, eleven years later. Comput. Phys. Commun. 237, 47\u201361 (2018)","journal-title":"Comput. Phys. Commun."},{"key":"10_CR26","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-319-91186-1_21","volume-title":"Software Engineering and Algorithms in Intelligent Systems","author":"V Potapov","year":"2019","unstructured":"Potapov, V., Gushanskiy, S., Guzik, V., Polenov, M.: The computational structure of the quantum computer simulator and its performance evaluation. In: Silhavy, R. (ed.) CSOC2018 2018. AISC, vol. 763, pp. 198\u2013207. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91186-1_21"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/11836810_10","volume-title":"Information Security","author":"D Tonien","year":"2006","unstructured":"Tonien, D., Susilo, W., Safavi-Naini, R.: Multi-party Concurrent Signatures. In: Katsikas, S.K., L\u00f3pez, J., Backes, M., Gritzalis, S., Preneel, B. (eds.) ISC 2006. LNCS, vol. 4176, pp. 131\u2013145. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11836810_10"}],"container-title":["Communications in Computer and Information Science","Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-7984-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T06:34:11Z","timestamp":1723444451000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-15-7984-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811579837","9789811579844"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-7984-4_10","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICPCSEE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of Pioneering Computer Scientists, Engineers and Educators","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiyuan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icpcsee2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2020.icpcsee.org","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":"392","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":"74","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":"24","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":"19% - 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","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":"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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}