{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T22:28:54Z","timestamp":1780352934929,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662639573","type":"print"},{"value":"9783662639580","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-662-63958-0_27","type":"book-chapter","created":{"date-parts":[[2021,9,16]],"date-time":"2021-09-16T14:04:04Z","timestamp":1631801044000},"page":"315-329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Shorter Lattice-Based Zero-Knowledge Proofs for the Correctness of a Shuffle"],"prefix":"10.1007","author":[{"given":"Javier","family":"Herranz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ramiro","family":"Mart\u00ednez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manuel","family":"S\u00e1nchez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,9,17]]},"reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BFb0054144","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"M Abe","year":"1998","unstructured":"Abe, M.: Universally verifiable mix-net with verification work independent of the number of mix-servers. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 437\u2013447. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054144"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-48000-6_21","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"M Abe","year":"1999","unstructured":"Abe, M.: Mix-networks on permutation networks. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 258\u2013273. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-48000-6_21"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/3-540-44586-2_23","volume-title":"Public Key Cryptography","author":"M Abe","year":"2001","unstructured":"Abe, M., Hoshino, F.: Remarks on mix-network based on permutation networks. In: Kim, K. (ed.) PKC 2001. LNCS, vol. 1992, pp. 317\u2013324. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44586-2_23"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-642-03356-8_35","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"B Applebaum","year":"2009","unstructured":"Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 595\u2013618. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_35"},{"key":"27_CR5","doi-asserted-by":"publisher","unstructured":"Aranha, D.F., Baum, C., Gj\u00f8steen, K., Silde, T., Tunge, T.: Lattice-based proof of shuffle and applications to electronic voting. In: Paterson K.G. (eds) Topics in Cryptology \u2013 CT-RSA 2021. CT-RSA 2021. LNCS, vol. 12704. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75539-3_10","DOI":"10.1007\/978-3-030-75539-3_10"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/978-3-319-96881-0_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"C Baum","year":"2018","unstructured":"Baum, C., Bootle, J., Cerulli, A., del Pino, R., Groth, J., Lyubashevsky, V.: Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 669\u2013699. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_23"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-29011-4_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"S Bayer","year":"2012","unstructured":"Bayer, S., Groth, J.: Efficient zero-knowledge argument for correctness of a shuffle. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 263\u2013280. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_17"},{"key":"27_CR8","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":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-030-56880-1_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"J Bootle","year":"2020","unstructured":"Bootle, J., Lyubashevsky, V., Nguyen, N.K., Seiler, G.: A non-PCP approach to succinct quantum-safe zero-knowledge. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 441\u2013469. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_16"},{"key":"27_CR10","unstructured":"Boyen, X., Haines, T., Mueller, J.: Epoque: practical end-to-end verifiable post-quantum-secure e-voting. To appear in the Proceedings of IEEE EuroS&P 2021 Cryptology ePrint Archive, Report 2021\/304 (2021). https:\/\/eprint.iacr.org\/2021\/304"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-030-59013-0_17","volume-title":"Computer Security \u2013 ESORICS 2020","author":"X Boyen","year":"2020","unstructured":"Boyen, X., Haines, T., M\u00fcller, J.: A verifiable and practical lattice-based decryption mix net with external auditing. In: Chen, L., Li, N., Liang, K., Schneider, S. (eds.) ESORICS 2020. LNCS, vol. 12309, pp. 336\u2013356. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59013-0_17"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-319-98113-0_15","volume-title":"Security and Cryptography for Networks","author":"E Boyle","year":"2018","unstructured":"Boyle, E., Klein, S., Rosen, A., Segev, G.: Securing Abe\u2019s mix-net against malicious verifiers via witness indistinguishability. In: Catalano, D., De Prisco, R. (eds.) SCN 2018. LNCS, vol. 11035, pp. 274\u2013291. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_15"},{"key":"27_CR13","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: 2018 IEEE Symposium on Security and Privacy, San Francisco, CA, USA, 21\u201323 May 2018, pp. 315\u2013334. IEEE Computer Society Press (2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Chakrabarty, A., Collier, M., Mukhopadhyay, S.: Matrix-based nonblocking routing algorithm for Bene$$\\check{\\text{s}}$$ networks. In: 2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns, pp. 551\u2013556 (2009)","DOI":"10.1109\/ComputationWorld.2009.72"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"05","DOI":"10.1142\/S0129626497000292","volume":"07","author":"C Chang","year":"1997","unstructured":"Chang, C., Melhem, R.: Arbitrary size Benes networks. Parallel Process. Lett. 07, 05 (1997)","journal-title":"Parallel Process. Lett."},{"issue":"2","key":"27_CR16","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"DL Chaum","year":"1981","unstructured":"Chaum, D.L.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24(2), 84\u201390 (1981)","journal-title":"Commun. ACM"},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-319-70290-2_17","volume-title":"Secure IT Systems","author":"N Costa","year":"2017","unstructured":"Costa, N., Mart\u00ednez, R., Morillo, P.: Proof of a shuffle for lattice-based cryptography. In: Lipmaa, H., Mitrokotsa, A., Matulevi\u010dius, R. (eds.) NordSec 2017. LNCS, vol. 10674, pp. 280\u2013296. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70290-2_17"},{"key":"27_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-030-43725-1_23","volume-title":"Financial Cryptography and Data Security","author":"N Costa","year":"2020","unstructured":"Costa, N., Mart\u00ednez, R., Morillo, P.: Lattice-based proof of a shuffle. In: Bracciali, A., Clark, J., Pintore, F., R\u00f8nne, P.B., Sala, M. (eds.) FC 2019. LNCS, vol. 11599, pp. 330\u2013346. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43725-1_23"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"del Pino, R., Lyubashevsky, V., Neven, G., Seiler, G.: Practical quantum-safe voting from lattices. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, Dallas, TX, USA, 31 October\u20132 November 2017, pp. 1565\u20131581. ACM Press (2017)","DOI":"10.1145\/3133956.3134101"},{"key":"27_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/978-3-030-56877-1_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"J Don","year":"2020","unstructured":"Don, J., Fehr, S., Majenz, C.: The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 602\u2013631. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_21"},{"issue":"1","key":"27_CR21","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1093\/ietfec\/E88-A.1.172","volume":"88","author":"J Furukawa","year":"2005","unstructured":"Furukawa, J.: Efficient and verifiable shuffling and shuffle-decryption. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88(1), 172\u2013188 (2005)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"27_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/3-540-44647-8_22","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"J Furukawa","year":"2001","unstructured":"Furukawa, J., Sako, K.: An efficient scheme for proving a shuffle. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 368\u2013387. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_22"},{"key":"27_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-319-70278-0_25","volume-title":"Financial Cryptography and Data Security","author":"K Gj\u00f8steen","year":"2017","unstructured":"Gj\u00f8steen, K., Strand, M.: A roadmap to fully homomorphic elections: stronger security, better verifiability. In: Brenner, M., et al. (eds.) FC 2017. LNCS, vol. 10323, pp. 404\u2013418. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70278-0_25"},{"key":"27_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36288-6_11","volume-title":"Public Key Cryptography \u2014 PKC 2003","author":"J Groth","year":"2003","unstructured":"Groth, J.: A verifiable secret shuffe of homomorphic encryptions. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 145\u2013160. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_11"},{"key":"27_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-78967-3_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J Groth","year":"2008","unstructured":"Groth, J., Ishai, Y.: Sub-linear zero-knowledge argument for correctness of a shuffle. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 379\u2013396. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_22"},{"key":"27_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-540-71677-8_25","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"J Groth","year":"2007","unstructured":"Groth, J., Lu, S.: Verifiable shuffle of large size ciphertexts. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 377\u2013392. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71677-8_25"},{"key":"27_CR27","doi-asserted-by":"crossref","unstructured":"Haines, T., M\u00fcller, J.: SoK: techniques for verifiable mix nets. In: 2020 IEEE 33rd Computer Security Foundations Symposium (CSF), pp. 49\u201364 (2020)","DOI":"10.1109\/CSF49147.2020.00012"},{"key":"27_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-642-29011-4_43","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"V Lyubashevsky","year":"2012","unstructured":"Lyubashevsky, V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 738\u2013755. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_43"},{"issue":"6","key":"27_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2535925","volume":"60","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. J. ACM 60(6), 1\u201335 (2013)","journal-title":"J. ACM"},{"key":"27_CR30","unstructured":"Markus, J., Ari, J.: Millimix: Mixing in small batches. Technical report (1999)"},{"key":"27_CR31","doi-asserted-by":"crossref","unstructured":"Andrew Neff, C.: A verifiable secret shuffle and its application to e-voting. In: Reiter, M.K., Samarati, P. (eds.) ACM CCS 2001, Philadelphia, PA, USA, 5\u20138 November 2001, pp. 116\u2013125. ACM Press (2001)","DOI":"10.1145\/501983.502000"},{"key":"27_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/3-540-49264-X_32","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201995","author":"K Sako","year":"1995","unstructured":"Sako, K., Kilian, J.: Receipt-free mix-type voting scheme. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 393\u2013403. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-49264-X_32"},{"issue":"5","key":"27_CR33","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":"27_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-662-58820-8_12","volume-title":"Financial Cryptography and Data Security","author":"M Strand","year":"2019","unstructured":"Strand, M.: A verifiable shuffle for the GSW cryptosystem. In: Zohar, A., et al. (eds.) FC 2018. LNCS, vol. 10958, pp. 165\u2013180. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-662-58820-8_12"},{"key":"27_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-642-12678-9_7","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2010","author":"B Terelius","year":"2010","unstructured":"Terelius, B., Wikstr\u00f6m, D.: Proofs of restricted shuffles. In: Bernstein, D.J., Lange, T. (eds.) AFRICACRYPT 2010. LNCS, vol. 6055, pp. 100\u2013113. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12678-9_7"},{"issue":"1","key":"27_CR36","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1145\/321439.321449","volume":"15","author":"A Waksman","year":"1968","unstructured":"Waksman, A.: A permutation network. J. ACM 15(1), 159\u2013163 (1968)","journal-title":"J. ACM"},{"key":"27_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-642-02620-1_28","volume-title":"Information Security and Privacy","author":"D Wikstr\u00f6m","year":"2009","unstructured":"Wikstr\u00f6m, D.: A commitment-consistent proof of a shuffle. In: Boyd, C., Gonz\u00e1lez Nieto, J. (eds.) ACISP 2009. LNCS, vol. 5594, pp. 407\u2013421. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02620-1_28"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security. FC 2021 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-63958-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,16]],"date-time":"2021-09-16T14:10:59Z","timestamp":1631801459000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-63958-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783662639573","9783662639580"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-63958-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc21.ifca.ai\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}