{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:50:04Z","timestamp":1765356604315},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030306243"},{"type":"electronic","value":"9783030306250"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30625-0_8","type":"book-chapter","created":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T23:03:37Z","timestamp":1569279817000},"page":"116-133","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Improvements in Everlasting Privacy: Efficient and Secure Zero Knowledge Proofs"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Haines","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clementine","family":"Gritti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,24]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-642-29011-4_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"M Abe","year":"2012","unstructured":"Abe, M., Haralambiev, K., Ohkubo, M.: Group to group commitments do not shrink. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 301\u2013317. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-29011-4_19"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-36830-1_2","volume-title":"Principles of Security and Trust","author":"M Arapinis","year":"2013","unstructured":"Arapinis, M., Cortier, V., Kremer, S., Ryan, M.: Practical everlasting privacy. In: Basin, D., Mitchell, J.C. (eds.) POST 2013. LNCS, vol. 7796, pp. 21\u201340. Springer, Heidelberg (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-36830-1_2"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-642-11799-2_33","volume-title":"Theory of Cryptography","author":"E Bangerter","year":"2010","unstructured":"Bangerter, E., Camenisch, J., Krenn, S.: Efficiency limitations for \n                    \n                      \n                    \n                    $$\\Sigma $$\n                  -protocols for group homomorphisms. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 553\u2013571. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-11799-2_33"},{"key":"8_CR4","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). \n                    https:\/\/doi.org\/10.1007\/978-3-642-29011-4_17"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-642-39884-1_16","volume-title":"Financial Cryptography and Data Security","author":"J Buchmann","year":"2013","unstructured":"Buchmann, J., Demirel, D., van de Graaf, J.: Towards a publicly-verifiable mix-net providing everlasting privacy. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 197\u2013204. Springer, Heidelberg (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-39884-1_16"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/3-540-46877-3_47","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201990","author":"M Burmester","year":"1991","unstructured":"Burmester, M.: A remark on the efficiency of identification schemes. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 493\u2013495. Springer, Heidelberg (1991). \n                    https:\/\/doi.org\/10.1007\/3-540-46877-3_47"},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D Chaum","year":"1981","unstructured":"Chaum, D.: Untraceable mail, return addresses and digital pseudonyms. Commun. ACM 24(2), 84\u201388 (1981)","journal-title":"Commun. ACM"},{"key":"8_CR8","unstructured":"Cramer, R.: Modular design of secure yet practical cryptographic protocols. Ph.D. thesis, Aula der Universiteit (1996)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-642-40203-6_27","volume-title":"Computer Security \u2013 ESORICS 2013","author":"\u00c9 Cuvelier","year":"2013","unstructured":"Cuvelier, \u00c9., Pereira, O., Peters, T.: Election verifiability or ballot privacy: do we need to choose? In: Crampton, J., Jajodia, S., Mayes, K. (eds.) ESORICS 2013. LNCS, vol. 8134, pp. 481\u2013498. Springer, Heidelberg (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-40203-6_27"},{"key":"8_CR10","unstructured":"Damg\u00e5rd, I.: On \n                    \n                      \n                    \n                    $$\\Sigma $$\n                  -protocols (2010). \n                    http:\/\/www.daimi.au.dk\/ivan\/Sigma.pdf"},{"issue":"6","key":"8_CR11","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10207-010-0119-9","volume":"9","author":"I Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Jurik, M., Nielsen, J.B.: A generalization of paillier\u2019s public-key system with applications to electronic voting. Int. J. Inf. Sec. 9(6), 371\u2013385 (2010)","journal-title":"Int. J. Inf. Sec."},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-39185-9_10","volume-title":"E-Voting and Identify","author":"D Demirel","year":"2013","unstructured":"Demirel, D., Henning, M., van de Graaf, J., Ryan, P.Y.A., Buchmann, J.: Pr\u00eat \u00e0 voter providing everlasting privacy. In: Heather, J., Schneider, S., Teague, V. (eds.) Vote-ID 2013. LNCS, vol. 7985, pp. 156\u2013175. Springer, Heidelberg (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-39185-9_10"},{"key":"8_CR13","unstructured":"Demirel, D., Van De Graaf, J., Ara\u00fajo, R.: Improving helios with everlasting privacy towards the public. In: Electronic Voting Technology\/Workshop on Trustworthy Elections, p. 8. USENIX Ass. (2012)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: Theory of Computing, pp. 291\u2013304. ACM (1985)","DOI":"10.1145\/22145.22178"},{"key":"8_CR15","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). \n                    https:\/\/doi.org\/10.1007\/3-540-36288-6_11"},{"issue":"2","key":"8_CR16","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s00145-017-9275-7","volume":"32","author":"C Hazay","year":"2019","unstructured":"Hazay, C., Mikkelsen, G.L., Rabin, T., Toft, T., Nicolosi, A.A.: Efficient RSA key generation and threshold paillier in the two-party setting. J. Cryptology 32(2), 265\u2013323 (2019)","journal-title":"J. Cryptology"},{"issue":"2","key":"8_CR17","doi-asserted-by":"publisher","first-page":"16:1","DOI":"10.1145\/1698750.1698756","volume":"13","author":"T Moran","year":"2010","unstructured":"Moran, T., Naor, M.: Split-ballot voting: everlasting privacy with distributed trust. ACM Trans. Inf. Syst. Secur. 13(2), 16:1\u201316:43 (2010)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). \n                    https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology \u2014 CRYPTO 1991","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992). \n                    https:\/\/doi.org\/10.1007\/3-540-46766-1_9"},{"issue":"4","key":"8_CR20","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s001459900056","volume":"12","author":"V Shoup","year":"1999","unstructured":"Shoup, V.: On the security of a practical identification scheme. J. Cryptology 12(4), 247\u2013260 (1999)","journal-title":"J. Cryptology"},{"key":"8_CR21","unstructured":"Terelius, B.: Some aspects of cryptographic protocols: with applications in electronic voting and digital watermarking. Ph.D. thesis, KTH Royal Institute of Technology (2015)"},{"key":"8_CR22","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). \n                    https:\/\/doi.org\/10.1007\/978-3-642-12678-9_7"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-642-32928-9_26","volume-title":"Security and Cryptography for Networks","author":"B Terelius","year":"2012","unstructured":"Terelius, B., Wikstr\u00f6m, D.: Efficiency limitations of \n                    \n                      \n                    \n                    $$\\Sigma $$\n                  -protocols for group homomorphisms revisited. In: Visconti, I., De Prisco, R. (eds.) SCN 2012. LNCS, vol. 7485, pp. 461\u2013476. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-32928-9_26"},{"key":"8_CR24","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). \n                    https:\/\/doi.org\/10.1007\/978-3-642-02620-1_28"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations (extended abstract). In: FOCS, pp. 160\u2013164. IEEE Computer Society (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Electronic Voting"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30625-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T23:15:47Z","timestamp":1569280547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30625-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030306243","9783030306250"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30625-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"E-Vote-ID","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Electronic Voting","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bregenz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoteid2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.e-vote-id.org\/","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","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":"13","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":"29% - 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-5","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":"3-5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}