{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:14:47Z","timestamp":1743120887149,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030755386"},{"type":"electronic","value":"9783030755393"}],"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-030-75539-3_11","type":"book-chapter","created":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T23:36:24Z","timestamp":1620689784000},"page":"252-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["More Efficient Shuffle Argument from Unique Factorization"],"prefix":"10.1007","author":[{"given":"Toomas","family":"Krips","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helger","family":"Lipmaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,11]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Bayer, S., Groth, J.: Efficient zero-knowledge argument for correctness of a shuffle. In: EUROCRYPT 2012. LNCS, vol. 7237, pp. 263\u2013280 (2012)","DOI":"10.1007\/978-3-642-29011-4_17"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Garay, J.A., Rabin, T.: Batch verification with applications to cryptography and checking. In: LATIN 1998. LNCS, vol. 1380, pp. 170\u2013191 (1998)","DOI":"10.1007\/BFb0054320"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Goldreich, O.: On defining proofs of knowledge. In: CRYPTO\u201992. LNCS, vol. 740, pp. 390\u2013420 (1992)","DOI":"10.1007\/3-540-48071-4_28"},{"key":"11_CR4","first-page":"62","volume":"93","author":"M Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. ACM CCS 93, 62\u201373 (1993)","journal-title":"ACM CCS"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Minimizing the use of random oracles in authenticated encryption schemes. In: ICICS 97. LNCS, vol. 1334, pp. 1\u201316 (1997)","DOI":"10.1007\/BFb0028457"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications (extended abstract). In: 20th ACM STOC, pp. 103\u2013112 (1986)","DOI":"10.1145\/62212.62222"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Brands, S.: Rapid demonstration of linear relations connected by Boolean operators. In: EUROCRYPT\u201997. LNCS, vol. 1233, pp. 318\u2013333 (1997)","DOI":"10.1007\/3-540-69053-0_22"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited (preliminary version). In: 30th ACM STOC, pp. 209\u2013218 (1988)","DOI":"10.1145\/276698.276741"},{"issue":"2","key":"11_CR9","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D Chaum","year":"1981","unstructured":"Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24(2), 84\u201388 (1981)","journal-title":"Commun. ACM"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: CRYPTO\u201994. LNCS, vol. 839, pp. 174\u2013187 (1994)","DOI":"10.1007\/3-540-48658-5_19"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: CRYPTO\u201984. LNCS, vol. 196, pp. 10\u201318 (1984)","DOI":"10.1007\/3-540-39568-7_2"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Fauzi, P., Lipmaa, H.: Efficient culpably sound NIZK shuffle argument without random oracles. In: CT-RSA 2016. LNCS, vol. 9610, pp. 200\u2013216 (2016)","DOI":"10.1007\/978-3-319-29485-8_12"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Fauzi, P., Lipmaa, H., Siim, J., Zajac, M.: An efficient pairing-based shuffle argument. In: ASIACRYPT 2017, Part II. LNCS, vol. 10625, pp. 97\u2013127 (2017)","DOI":"10.1007\/978-3-319-70697-9_4"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Fauzi, P., Lipmaa, H., Zajac, M.: A shuffle argument secure in the generic model. In: ASIACRYPT 2016, Part II. LNCS, vol. 10032, pp. 841\u2013872 (2016)","DOI":"10.1007\/978-3-662-53890-6_28"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Fauzi, P., Meiklejohn, S., Mercer, R., Orlandi, C.: Quisquis: A new design for anonymous cryptocurrencies. In: ASIACRYPT 2019, Part I. LNCS, vol. 11921, pp. 649\u2013678 (2019)","DOI":"10.1007\/978-3-030-34578-5_23"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: CRYPTO\u201986. LNCS, vol. 263, pp. 186\u2013194 (1986)","DOI":"10.1007\/3-540-47721-7_12"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Furukawa, J.: Efficient and verifiable shuffling and shuffle-decryption. IEICE Trans. 88-A(1), 172\u2013188 (2005)","DOI":"10.1093\/ietfec\/E88-A.1.172"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Furukawa, J., Sako, K.: An efficient scheme for proving a shuffle. In: CRYPTO 2001. LNCS, vol. 2139, pp. 368\u2013387 (2001)","DOI":"10.1007\/3-540-44647-8_22"},{"key":"11_CR19","unstructured":"Goldwasser, S., Kalai, Y.T.: On the (in)security of the Fiat-Shamir paradigm. In: 44th FOCS, pp. 102\u2013115 (2003)"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems (extended abstract). In: 17th ACM STOC, pp. 291\u2013304 (1983)","DOI":"10.1145\/22145.22178"},{"issue":"4","key":"11_CR21","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/s00145-010-9067-9","volume":"23","author":"J Groth","year":"2010","unstructured":"Groth, J.: A verifiable secret shuffle of homomorphic encryptions. J. Cryptol. 23(4), 546\u2013579 (2010)","journal-title":"J. Cryptol."},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Groth, J., Kohlweiss, M.: One-out-of-many proofs: Or how to leak a secret and spend a coin. In: EUROCRYPT 2015, Part II. LNCS, vol. 9057, pp. 253\u2013280 (2015)","DOI":"10.1007\/978-3-662-46803-6_9"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Groth, J., Lu, S.: A non-interactive shuffle with pairing based verifiability. In: ASIACRYPT 2007. LNCS, vol. 4833, pp. 51\u201367 (2007)","DOI":"10.1007\/978-3-540-76900-2_4"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Hungerford, T.W.: Algebra. 8 edn. Graduate Texts in Mathematics, vol. 73. Springer, New York (1980)","DOI":"10.1007\/978-1-4612-6101-8"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Khazaei, S., Moran, T., Wikstr\u00f6m, D.: A mix-net from any CCA2 secure cryptosystem. In: ASIACRYPT 2012. LNCS, vol. 7658, pp. 607\u2013625 (2012)","DOI":"10.1007\/978-3-642-34961-4_37"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: Parallel coin-tossing and constant-round secure two-party computation. In: CRYPTO 2001. LNCS, vol. 2139, pp. 171\u2013189 (2001)","DOI":"10.1007\/3-540-44647-8_10"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Lipmaa, H., Zhang, B.: A more efficient computationally sound non-interactive zero-knowledge shuffle argument. In: SCN 12. LNCS, vol. 7485, pp. 477\u2013502 (2012)","DOI":"10.1007\/978-3-642-32928-9_27"},{"key":"11_CR28","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/501983.502000","volume":"2001","author":"CA Neff","year":"2001","unstructured":"Neff, C.A.: A verifiable secret shuffle and its application to e-voting. ACM CCS 2001, 116\u2013125 (2001)","journal-title":"ACM CCS"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: CRYPTO\u201991. LNCS, vol. 576, pp. 129\u2013140 (1991)","DOI":"10.1007\/3-540-46766-1_9"},{"issue":"4","key":"11_CR30","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"JT Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27(4), 701\u2013717 (1980)","journal-title":"J. ACM"},{"key":"11_CR31","first-page":"806","volume":"70","author":"EG Straus","year":"1964","unstructured":"Straus, E.G.: Addition chains of vectors. Amer. Math. Monthly 70, 806\u2013808 (1964)","journal-title":"Amer. Math. Monthly"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Terelius, B., Wikstr\u00f6m, D.: Proofs of restricted shuffles. In: AFRICACRYPT 10. LNCS, vol. 6055, pp. 100\u2013113 (2010)","DOI":"10.1007\/978-3-642-12678-9_7"},{"key":"11_CR33","unstructured":"Wikstr\u00f6m, D.: A commitment-consistent proof of a shuffle. In: ACISP 2009. LNCS, vol. 5594, pp. 4007\u2013421 (2009)"},{"key":"11_CR34","unstructured":"Wikstr\u00f6m, D.: How to Implement a Stand-alone Verifier for the Verificatum Mix-Net. Version 1.4.1 (2015). http:\/\/www.verificatum.org"},{"key":"11_CR35","doi-asserted-by":"crossref","unstructured":"Zippel, R.: Probabilistic Algorithms for Sparse Polynomials. In: EUROSM 1979. LNCS, vol. 72, pp. 216\u2013226 (1979)","DOI":"10.1007\/3-540-09519-5_73"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75539-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T15:56:23Z","timestamp":1725033383000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75539-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030755386","9783030755393"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75539-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CT-RSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cryptographers\u2019 Track at the RSA Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Francisco, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ctrsa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/site\/ctrsa2021\/","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":"websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","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":"27","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":"0","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":"27% - 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.25","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":"8","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)"}},{"value":"The conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}