{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T07:06:08Z","timestamp":1780643168401,"version":"3.54.1"},"publisher-location":"Singapore","reference-count":31,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819580330","type":"print"},{"value":"9789819580347","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-8034-7_28","type":"book-chapter","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T22:52:48Z","timestamp":1778107968000},"page":"533-555","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Witness Encryption for\u00a0Quadratic Arithmetic Programs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-0505-1269","authenticated-orcid":false,"given":"Tao-Hsiang","family":"Chang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-6134-4958","authenticated-orcid":false,"given":"Yu-Chen","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7164-088X","authenticated-orcid":false,"given":"Zi-Yuan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-7412-3870","authenticated-orcid":false,"given":"Jen-Chieh","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1485-0164","authenticated-orcid":false,"given":"Raylin","family":"Tso","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3462-0699","authenticated-orcid":false,"given":"Masahiro","family":"Mambo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,1]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Bellare, M., Hoang, V.T.: Adaptive witness encryption and asymmetric password-based cryptography. In: Public-Key Cryptography\u2013PKC 2015: 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, 30 March\u20131 April 2015, Proceedings 18, pp. 308\u2013331. Springer, Cham (2015)","DOI":"10.1007\/978-3-662-46447-2_14"},{"key":"28_CR2","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable, transparent, and post-quantum secure computational integrity. Cryptology ePrint Archive (2018)"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 326\u2013349 (2012)","DOI":"10.1145\/2090236.2090263"},{"issue":"6","key":"28_CR4","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/0220068","volume":"20","author":"M Blum","year":"1991","unstructured":"Blum, M., De Santis, A., Micali, S., Persiano, G.: Noninteractive zero-knowledge. SIAM J. Comput. 20(6), 1084\u20131118 (1991)","journal-title":"SIAM J. Comput."},{"key":"28_CR5","unstructured":"Bowe, S., Gabizon, A., Miers, I.: Scalable multi-party computation for zk-SNARK parameters in the random beacon model. Cryptology ePrint Archive, Paper 2017\/1050 (2017). https:\/\/eprint.iacr.org\/2017\/1050"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Campanelli, M., Fiore, D., Khoshakhlagh, H.: Witness encryption for succinct functional commitments and applications. In: Tang, Q., Teague, V. (eds.) Public-Key Cryptography \u2013 PKC 2024, pp. 132\u2013167. Springer, Cham (2024). ISBN 978-3-031-57722-2","DOI":"10.1007\/978-3-031-57722-2_5"},{"key":"28_CR7","doi-asserted-by":"publisher","unstructured":"Campanelli, M., Gennaro, R., Goldfeder, S., Nizzardo, L.: Zero-knowledge contingent payments revisited: attacks and payments for services. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, pp. 229\u2013243. Association for Computing Machinery, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3133956.3134060. ISBN 9781450349468","DOI":"10.1145\/3133956.3134060"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, N., Ward, N.: Marlin: preprocessing zksnarks with universal and updatable SRS. In: Advances in Cryptology\u2013EUROCRYPT 2020: 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, 10\u201314 May 2020, Proceedings, Part I 39, pp. 738\u2013768. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Choi, G., Vaudenay, S.: Towards witness encryption without multilinear maps: extractable witness encryption for multi-subset sum instances with no small solution to the homogeneous problem. In: International Conference on Information Security and Cryptology, pp. 28\u201347. Springer, Cham (2021)","DOI":"10.1007\/978-3-031-08896-4_2"},{"key":"28_CR10","unstructured":"arkworks contributors: arkworks zksnark ecosystem (2022). https:\/\/arkworks.rs"},{"key":"28_CR11","unstructured":"snarkjs contributors: snarkjs \u2013 javascript library for zksnark circuits (2023). https:\/\/github.com\/iden3\/snarkjs. Accessed 30 Oct 2025"},{"key":"28_CR12","unstructured":"Contributors, C.: Circom \u2013 circuit compiler for zksnarks (2022). https:\/\/github.com\/iden3\/circom. Accessed 30 Oct 2025"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Fleischhacker, N., Hall-Andersen, M., Simkin, M.: Extractable witness encryption for KZG commitments and efficient laconic OT. Cryptology ePrint Archive (2024)","DOI":"10.1007\/978-981-96-0888-1_14"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Freitag, C., Waters, B., Wu, D.J.: How to use (plain) witness encryption: registered ABE, flexible broadcast, and more. In: Annual International Cryptology Conference, pp. 498\u2013531. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-38551-3_16"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2018, pp. 33\u201362. Springer, Cham (2018). ISBN 978-3-319-96881-0","DOI":"10.1007\/978-3-319-96881-0_2"},{"key":"28_CR16","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: Plonk: permutations over Lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive (2019)"},{"issue":"3","key":"28_CR17","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1137\/14095772X","volume":"45","author":"S Garg","year":"2016","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. SIAM J. Comput. 45(3), 882\u2013929 (2016)","journal-title":"SIAM J. Comput."},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Sahai, A., Waters, B.: Witness encryption and its applications. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 467\u2013476 (2013)","DOI":"10.1145\/2488608.2488667"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In: Advances in Cryptology\u2013EUROCRYPT 2013: 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, 26\u201330 May 2013. Proceedings 32, pp. 626\u2013645. Springer, Cham (2013)","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Popa, R.A., Vaikuntanathan, V., Zeldovich, N.: How to run turing machines on encrypted data. In: Annual Cryptology Conference, pp. 536\u2013553. Springer, Cham (2013)","DOI":"10.1007\/978-3-642-40084-1_30"},{"key":"28_CR21","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, STOC 1985, pp. 291\u2013304. Association for Computing Machinery, New York, NY, USA (1985). https:\/\/doi.org\/10.1145\/22145.22178. ISBN 0897911512","DOI":"10.1145\/22145.22178"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Goyal, R., Goyal, V.: Overcoming cryptographic impossibility results using blockchains. In: Theory of Cryptography Conference, pp. 529\u2013561. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-70500-2_18"},{"key":"28_CR23","doi-asserted-by":"crossref","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Advances in Cryptology\u2013EUROCRYPT 2016: 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, 8\u201312 May 2016, Proceedings, Part II 35, pp. 305\u2013326. Springer, Cham (2016)","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography: Principles and Protocols. Chapman and Hall\/CRC (2007)","DOI":"10.1201\/9781420010756"},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pp. 723\u2013732 (1992)","DOI":"10.1145\/129712.129782"},{"issue":"11","key":"28_CR26","doi-asserted-by":"publisher","first-page":"2549","DOI":"10.1007\/s10623-018-0461-x","volume":"86","author":"J Liu","year":"2018","unstructured":"Liu, J., Jager, T., Kakvi, S.A., Warinschi, B.: How to build time-lock encryption. Des. Codes Crypt. 86(11), 2549\u20132586 (2018)","journal-title":"Des. Codes Crypt."},{"key":"28_CR27","doi-asserted-by":"crossref","unstructured":"Maller, M., Bowe, S., Kohlweiss, M., Meiklejohn, S.: Sonic: zero-knowledge snarks from linear-size universal and updatable structured reference strings. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp. 2111\u20132128 (2019)","DOI":"10.1145\/3319535.3339817"},{"key":"28_CR28","doi-asserted-by":"crossref","unstructured":"Micali, S.: CS proofs. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 436\u2013453. IEEE (1994)","DOI":"10.1109\/SFCS.1994.365746"},{"key":"28_CR29","doi-asserted-by":"crossref","unstructured":"Tsabary, R.: Candidate witness encryption from lattice techniques. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022, pp. 535\u2013559. Springer, Cham (2022). ISBN 978-3-031-15802-5","DOI":"10.1007\/978-3-031-15802-5_19"},{"key":"28_CR30","unstructured":"Uberti, G., Luo, K., Cheng, O., Goh, W.: Building usable witness encryption. arXiv preprint arXiv:2112.04581 (2021)"},{"key":"28_CR31","doi-asserted-by":"crossref","unstructured":"Vaikuntanathan, V., Wee, H., Wichs, D.: Witness encryption and null-io from evasive LWE. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2022, pp. 195\u2013221. Springer, Cham (2022). ISBN 978-3-031-22963-3","DOI":"10.1007\/978-3-031-22963-3_7"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-8034-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T06:52:18Z","timestamp":1780642338000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-8034-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819580330","9789819580347"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-8034-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seoul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icisc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.icisc.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}