{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:30:32Z","timestamp":1743147032587,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":15,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819785391"},{"type":"electronic","value":"9789819785407"}],"license":[{"start":{"date-parts":[[2024,10,18]],"date-time":"2024-10-18T00:00:00Z","timestamp":1729209600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,18]],"date-time":"2024-10-18T00:00:00Z","timestamp":1729209600000},"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":[[2025]]},"DOI":"10.1007\/978-981-97-8540-7_6","type":"book-chapter","created":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T10:01:56Z","timestamp":1729159316000},"page":"87-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Zero-Knowledge Argument for\u00a0Bilinear Matrix Relation over\u00a0the\u00a0Residue Ring"],"prefix":"10.1007","author":[{"given":"Yuan","family":"Tian","sequence":"first","affiliation":[]},{"given":"Yongda","family":"Pang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,18]]},"reference":[{"key":"6_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":"6_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":"6_CR3","doi-asserted-by":"crossref","unstructured":"Kosba, A., Papamanthou, C., Shi, E.: xJsnark: a framework for efficient verifiable computation. In: IEEE Symposium on Privacy & Security, pp. 128\u2013149 (2018)","DOI":"10.1109\/SP.2018.00018"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-662-49896-5_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Bootle","year":"2016","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"},{"key":"6_CR5","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":"6_CR6","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":"6_CR7","doi-asserted-by":"crossref","unstructured":"Attema, T., Cramer, R., Rambaud, M.: Compressed $$\\Sigma $$-Protocols for bilinear group arithmetic circuits and application to logarithmic transparent threshold signatures. In: Advances in Cryptology - ASIACRYPT 2021, pp. 526\u2013556 (2021)","DOI":"10.1007\/978-3-030-92068-5_18"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Russell, W., Lai, F., Malavolta, G., Ronge, V.: Succinct arguments for bilinear group arithmetic: practical structure-preserving cryptography. In: ACM Conference on Computer and Communications Security, pp. 2057\u20132074 (2019)","DOI":"10.1145\/3319535.3354262"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-030-84259-8_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"T Attema","year":"2021","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"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Attema, T., Cramer, M.: Compressed $$\\Sigma $$-protocol theory and practical application to plug and play secure algorithms. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, pp. 513\u2013543. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_18. Full-version available at IACR ePrint 2020\/152","DOI":"10.1007\/978-3-030-56877-1_18"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-030-84245-1_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"T Attema","year":"2021","unstructured":"Attema, T., Cramer, R., Kohl, L.: A compressed $$\\Sigma $$-protocol theory for\u00a0lattices. 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"},{"key":"6_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-031-22318-1_7","volume-title":"TCC 2022","author":"T Attema","year":"2022","unstructured":"Attema, T., Cascudo, I., Cramer, R., Damgard, I.: Vector commitments over rings and compressed $$\\Sigma $$-protocols. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022. LNCS, vol. 13747, pp. 173\u2013202. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_7"},{"key":"6_CR13","volume-title":"Lectures on Finite Fields and Galois Rings","author":"Z Wan","year":"2006","unstructured":"Wan, Z.: Lectures on Finite Fields and Galois Rings. Sciences Press, Beijing (2006)"},{"key":"6_CR14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-45513-1_1","volume-title":"ProvSec 2023","author":"T Yuan","year":"2023","unstructured":"Yuan, T., Xinke, T., Yongda, P.: Efficient zero-knowledge arguments for matrix relations over rings and non-malleable enhancement. In: Zhang, M., Au, M.H., Zhang, Y. (eds.) ProvSec 2023. LNCS, vol. 14217, pp. 3\u201327. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-45513-1_1"},{"key":"6_CR15","unstructured":"Tian, Y., Pang, Y.: Efficient Zero-Knowledge Arguments for Some Matrix Relations over Rings and Non-malleable Enhancement. eprint.iacr.org\/2022\/1689 (2022). Full version of this paper"}],"container-title":["Lecture Notes in Computer Science","Data Security and Privacy Protection"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-8540-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T20:21:17Z","timestamp":1732911677000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-8540-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,18]]},"ISBN":["9789819785391","9789819785407"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-8540-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,10,18]]},"assertion":[{"value":"18 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DSPP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Data Security and Privacy Protection","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dspp2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}