{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:07:57Z","timestamp":1758265677628},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003243"},{"type":"electronic","value":"9783540362883"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36288-6_11","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T20:45:01Z","timestamp":1180903501000},"page":"145-160","source":"Crossref","is-referenced-by-count":84,"title":["A Verifiable Secret Shuffe of Homomorphic Encryptions"],"prefix":"10.1007","author":[{"given":"Jens","family":"Groth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"key":"11_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"CRYPTO\u2019 94","author":"R. Cramer","year":"1994","unstructured":"R. Cramer, I. Damg\u00e5rd and B. Schoenmakers, \u201cProofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols\u201d, CRYPTO\u2019 94, LNCS series, volume 893: p. 174\u2013187, 1994146"},{"key":"11_CR2","unstructured":"I. Damg\u00e5rd and E. Fujisaki, \u201cAn Integer Commitment Scheme based on Groups with Hidden Order\u201d, Cryptology ePrint Archive, Report 2001\/064, 2001 148"},{"key":"11_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"PKC 2001","author":"I. Damg\u00e5rd","year":"2001","unstructured":"I. Damg\u00e5rd and M. J. Jurik, \u201cA Generalisation, a Simplification and Some Applications of Paillier\u2019s Probabilistic Public-Key System\u201d, PKC 2001, LNCS series, volume 1992: p. 119\u2013136, 2001 150, 151"},{"key":"11_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/3-540-44647-8_22","volume-title":"CRYPTO\u2019 01","author":"J. Furukawa","year":"2001","unstructured":"J. Furukawa and K. Sako, \u201cAn Efficient Scheme for Proving a Shuffle\u201d, CRYPTO\u2019 01, LNCS series, volume 2139: p. 368\u2013387, 2001 145, 146, 159"},{"key":"11_CR5","unstructured":"M. Jakobson, A. Juels and R. L. Rivest, \u201cMaking Mix Nets Robust for Electronic Voting by Randomized Partial Checking\u201d, USENIX Security\u2019 02, 2002 146"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"A. Neff, \u201cA Verifiable Secret Shuffle and its Application to E-Voting\u201d, ACM CCS\u2019 01: p. 116\u2013125, 2001 145, 146, 147, 151","DOI":"10.1145\/501983.502000"},{"key":"11_CR7","series-title":"Lect Notes Comput Sci","first-page":"223","volume-title":"EUROCRYPT\u2019 99","author":"P. Paillier","year":"1999","unstructured":"P. Paillier, \u201cPublic-key cryptosystems based on composite residuosity classes\u201d, EUROCRYPT\u2019 99, LNCS series, volume 1592: p. 223\u2013239, 1999 150"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2014 PKC 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36288-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T16:56:13Z","timestamp":1556470573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36288-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12,18]]},"ISBN":["9783540003243","9783540362883"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-36288-6_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002,12,18]]}}}