{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:36:19Z","timestamp":1743154579760,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031455124"},{"type":"electronic","value":"9783031455131"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-45513-1_1","type":"book-chapter","created":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T22:01:53Z","timestamp":1696975313000},"page":"3-26","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Zero-Knowledge Arguments for\u00a0Matrix Relations over\u00a0Rings and\u00a0Non-malleable Enhancement"],"prefix":"10.1007","author":[{"given":"Yuan","family":"Tian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinke","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongda","family":"Pang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,11]]},"reference":[{"key":"1_CR1","volume-title":"Secure Multiparty Computation and Secret Sharing","author":"I Damagard","year":"2015","unstructured":"Damagard, I., Cramer, R., Nielsen, J.B.: Secure Multiparty Computation and Secret Sharing. Cambridge University Press, Cambridge (2015)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Furukawa, J., Lindell, Y.: Two-thirds honest-majority MPC for malicious adversaries at Almost the Cost of Semi-Honest. In: 26th ACM CCS, pp. 1557\u20131571 (2019)","DOI":"10.1145\/3319535.3339811"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Kosba, A., Papamanthou, C., Shi, E.: xJsnark: a framework for efficient verifiable computation. IEEE Symposium on Privacy and Security, pp. 128\u2013149 (2018)","DOI":"10.1109\/SP.2018.00018"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Cecchetti, E., Zhang, F., Ji, Y., Kosba, A., Juels, A., Shi, E.: Solidus: Confidential Distributed Ledger Transactions via PVORM, pp. 701\u2013718. ACM Computer and Communication Security, Dalas (2017)","DOI":"10.1145\/3133956.3134010"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent SNARKs from DARK compilers. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 677\u2013706. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_24","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Bootle, J., Cerulli, A., Chaidos, P., Groth, J., Petit, C.: Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 327\u2013357. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_12","DOI":"10.1007\/978-3-662-49896-5_12"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: IEEE Symposium on Security and Privacy, pp. 315\u2013334. IEEE Computer Society Press (2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Hoffmann, M., Kloo\u00df, M., Rupp, A.: Efficient zero-knowledge arguments in discrete log setting, revisited. In: ACM Conference on Computer and Communication Security (2019)","DOI":"10.1145\/3319535.3354251"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Attema, T., Cramer, R., Rambaud, M.: Compressed $$\\rm {\\Sigma }$$-protocols for bilinear group arithmetic circuits and application to logarithmic transparent threshold signatures. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13093, pp. 526\u2013556. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_18","DOI":"10.1007\/978-3-030-92068-5_18"},{"key":"1_CR10","unstructured":"Russell, W., Lai, F., Malavolta, G., Ronge, V.: Succinct arguments for bilinear group arithmetic: practical structure -preserving cryptography. ACM Conference on Computer and Communications Security, pp. 2057\u20132074 (2019)"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Attema, T., Cramer, R., Fehr, S.: Compressing proofs of k-out-of-n partial knowledge. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 65\u201391. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_3","DOI":"10.1007\/978-3-030-84259-8_3"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Attema, T., Cramer, M.: Compressed $$\\rm \\Sigma $$-protocol theory and practical application to plug and play secure algorithms. In: CRYPTO, LNCS, pp. 513\u2013543. Springer, Heidelberg (2020). Full-version available at IACR ePrint 2020\/152","DOI":"10.1007\/978-3-030-56877-1_18"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Attema, T., Cramer, R., Kohl, L.: A compressed $$\\rm {\\Sigma }$$-protocol theory for lattices. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 549\u2013579. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_19","DOI":"10.1007\/978-3-030-84245-1_19"},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Couteau, G., Peters, T., Pointcheval, D.: Removing the Strong RSA Assumption from Arguments over the Integers. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 321\u2013350. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_11","DOI":"10.1007\/978-3-319-56614-6_11"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Fujisaki, E.: A statistically-hiding integer commitment scheme based on groups with hidden order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 125\u2013142. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_8","DOI":"10.1007\/3-540-36178-2_8"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Attema, T., Cascudo, I., Cramer, R., Damgard, I., Escudero, D.: Vector commitments over rings and compressed Sigma-protocols. In: Theory of Cryptography Conference, pp. 173\u2013202 (2022)","DOI":"10.1007\/978-3-031-22318-1_7"},{"key":"1_CR17","volume-title":"Lectures on Finite Fields and Galois Rings","author":"Z Wan","year":"2006","unstructured":"Wan, Z.: Lectures on Finite Fields and Galois Rings. Academy of Sciences Press, Beijing (2006)"},{"key":"1_CR18","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Techniques, vol. 1. Cambridge University Press, Cambridge (2005)"},{"key":"1_CR19","unstructured":"Katz, J., Lindell, Y.: Modern Cryptography. Chapman Hall\/CRC Press (2020)"},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"MacKenzie, P., Yang, K.: On simulation-sound trapdoor commitments. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 382\u2013400. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_23","DOI":"10.1007\/978-3-540-24676-3_23"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Garay, J.A., MacKenzie, P., Yang, K.: Strengthening zero-knowledge protocols using signatures. J. Cryptol. 19(2), 169\u2013209 (2006). https:\/\/doi.org\/10.1007\/s00145-005-0307-3","DOI":"10.1007\/s00145-005-0307-3"},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Gennaro, R.: Multi-trapdoor commitments and their applications to proofs of knowledge secure under concurrent man-in-the-middle attacks. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 220\u2013236. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_14","DOI":"10.1007\/978-3-540-28628-8_14"},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Bleichenbacher, D., Maurer, U.: On the efficiency of one-time digital signatures. In: Kim, K., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol. 1163, pp. 145\u2013158. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0034843","DOI":"10.1007\/BFb0034843"},{"key":"1_CR24","unstructured":"Yuan, T.: Efficient zero-knowledge arguments for some matrix relations over rings and non-malleable enhancement. IACR eprint.iacr.org 2022\/1689"}],"container-title":["Lecture Notes in Computer Science","Provable and Practical Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45513-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,11]],"date-time":"2023-10-11T00:02:36Z","timestamp":1696982556000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45513-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031455124","9783031455131"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45513-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"11 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ProvSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Provable Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuhan","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"provsec2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/provsec2023.github.io\/ProvSec2023\/#","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":"71","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":"20","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":"3","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":"28% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}