{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T02:10:19Z","timestamp":1736993419019,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001713"},{"type":"electronic","value":"9783540361787"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36178-2_28","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T17:30:14Z","timestamp":1178213414000},"page":"451-465","source":"Crossref","is-referenced-by-count":53,"title":["Optimistic Mixing for Exit-Polls"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Golle","sequence":"first","affiliation":[]},{"given":"Sheng","family":"Zhong","sequence":"additional","affiliation":[]},{"given":"Dan","family":"Boneh","sequence":"additional","affiliation":[]},{"given":"Markus","family":"Jakobsson","sequence":"additional","affiliation":[]},{"given":"Ari","family":"Juels","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"28_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BFb0054112","volume-title":"Proc. of Eurocrypt\u2019 98","author":"K. Nyberg","year":"1998","unstructured":"Universally verifiable mix-net with verification work independent of the number of mix-servers. In Proc. of Eurocrypt\u2019 98, pp. 437\u2013447. Springer-Verlag, 1998. LNCS 1403."},{"key":"28_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-3-540-48000-6_21","volume-title":"Proc. of Asiacrypt\u2019 99","author":"M. Abe","year":"1999","unstructured":"M. Abe. Mix-networks on permutation networks. In Proc. of Asiacrypt\u2019 99, pp. 258\u2013273, 1999. LNCS 1716."},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"M. Abe and F. Hoshino. Remarks on mix-networks based on permutation networks. In Proc. of PKC\u201901.","DOI":"10.1007\/3-540-44586-2_23"},{"key":"28_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"ANTS-III","author":"D. Boneh","year":"1998","unstructured":"D. Boneh. The Decision Diffie-Hellman Problem. In ANTS-III, pp. 48\u201363, 1998. LNCS 1423."},{"key":"28_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BFb0052253","volume-title":"Proc. of CRYPTO\u201997","author":"D. Boneh","year":"1997","unstructured":"D. Boneh and M. Franklin. Efficient generation of shared RSA keys. In Proc. of CRYPTO\u201997, pp. 425\u2013439. LNCS 1294."},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In Proc. of CCS\u201993, pp. 62\u201373.","DOI":"10.1145\/168588.168596"},{"issue":"2","key":"28_CR7","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. In Communications of the ACM, 24(2):84\u201388, 1981.","journal-title":"Communications of the ACM"},{"key":"28_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Proc. of Crypto\u201992","author":"D. Chaum","year":"1993","unstructured":"D. Chaum and T. Pedersen. Wallet databases with observers. In Proc. of Crypto\u201992, pp. 89\u2013105. Springer-Verlag, 1993. LNCS 740."},{"key":"28_CR9","series-title":"Lect Notes Comput Sci","first-page":"307","volume-title":"Proc. of Crypto\u201989","author":"Y. Desmedt","year":"1993","unstructured":"Y. Desmedt and Y. Frankel. Threshold cryptosystems. In Proc. of Crypto\u201989, pp. 307\u2013315. LNCS 435."},{"key":"28_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/3-540-45539-6_39","volume-title":"Proc. of Eurocrypt\u20192000","author":"Y. Desmedt","year":"2000","unstructured":"Y. Desmedt and K. Kurosawa. How to break a practical MIX and design a new one. In Proc. of Eurocrypt\u20192000, pp. 557\u2013572. LNCS 1807."},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"P. Feldman. A practical scheme for non-interactive verifiable secret sharing. In Proc. of the 28th IEEE Symposium on the Foundations of Computer Science, IEEE Press, 1987, pp. 427\u2013437.","DOI":"10.1109\/SFCS.1987.4"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"J. Furukawa, H. Miyauchi, K. Mori, S. Obana, K. Sako. An implementation of a universally verifiable electronic voting scheme based on shuffling. In Pre-proceedings of Financial Crypto\u201902.","DOI":"10.1007\/3-540-36504-4_2"},{"key":"28_CR13","unstructured":"A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. In Proc. of CRYPTO\u201986, 1987."},{"key":"28_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/3-540-44647-8_22","volume-title":"Proc. of Crypto\u2019 01","author":"J. Furukawa","year":"2001","unstructured":"J. Furukawa and K. Sako. An efficient scheme for proving a shuffle. In Proc. of Crypto\u2019 01, pp. 368\u2013387. Springer-Verlag, 2001. LNCS 2139."},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"E. Gabber, P. Gibbons, Y. Matias and A. Mayer. How to make personalized Web browsing simple, secure and anonymous. In Proc. of Financial Cryptography\u2019 97, pp. 17\u201331, 1997.","DOI":"10.1007\/3-540-63594-7_64"},{"key":"28_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/3-540-48910-X_21","volume-title":"Proc. of Eurocrypt\u2019 99","author":"R. Gennaro","year":"1999","unstructured":"R. Gennaro, S. Jarecki and H. Krawczyk and T. Rabin, Secure Distributed Key Generation for Discrete-Log Based Cryptosystems, In Proc. of Eurocrypt\u2019 99, pp. 295\u2013310, 1999. LNCS 1592."},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"R. Gennaro, M. Rabin and T. Rabin. Simplified VSS and fast-track multi-party computations with applications to threshold cryptography. In Proc. ACM PODC\u201998, pp. 101\u2013111.","DOI":"10.1145\/277697.277716"},{"key":"28_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/3-540-45539-6_38","volume-title":"Proc. of Eurocrypt\u201900","author":"M. Hirt","year":"2000","unstructured":"M. Hirt and K. Sako. Efficient receipt-free voting based on homomorphic encryption. In Proc. of Eurocrypt\u201900, pp. 539\u2013556. Springer-Verlag, 2000. LNCS 1807."},{"key":"28_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1007\/BFb0054145","volume-title":"Proc. of Eurocrypt\u2019 98","author":"M. Jakobsson","year":"1998","unstructured":"M. Jakobsson. A practical mix. In Proc. of Eurocrypt\u2019 98, pp. 448\u2013461. Springer-Verlag, 1998. LNCS 1403."},{"key":"28_CR20","series-title":"Lect Notes Comput Sci","first-page":"157","volume-title":"Proc. of SAC\u201998","author":"M. Jakobsson","year":"1998","unstructured":"M. Jakobsson and D. M\u2019Ra\u00efhi. Mix-based electronic payments. In Proc. of SAC\u201998, pp. 157\u2013173. Springer-Verlag, 1998. LNCS 1556."},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"M. Jakobsson. Flash mixing. In Proc. of PODC\u2019 99, pp. 83\u201389. ACM, 1999.","DOI":"10.1145\/301308.301333"},{"key":"28_CR22","unstructured":"M. Jakobsson and A. Juels. Millimix: mixing in small batches. DIMACS Technical Report 99-33."},{"key":"28_CR23","doi-asserted-by":"crossref","unstructured":"M. Jakobsson and A. Juels. An optimally robust hybrid mix network. In Proc. of PODC\u201901, pp. 284\u2013292. ACM Press. 2001.","DOI":"10.1145\/383962.384046"},{"key":"28_CR24","unstructured":"M. Jakobsson, A. Juels and R. Rivest. Making mix nets robust for electronic voting by randomized partial checking. To be presented at USENIX\u201902."},{"key":"28_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/3-540-45664-3_10","volume-title":"Proc. of PKC\u201902","author":"A. Kiayias","year":"2002","unstructured":"A. Kiayias and M. Yung. Self-tallying elections and perfect ballot secrecy. In Proc. of PKC\u201902, pp. 141\u2013158. LNCS 2274."},{"key":"28_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/3-540-44448-3_15","volume-title":"Proc. of Asi-acrypt\u201900","author":"M. Mitomo","year":"2000","unstructured":"M. Mitomo and K. Kurosawa. Attack for flash mix. In Proc. of Asi-acrypt\u201900, pp. 192\u2013204. LNCS 1976."},{"key":"28_CR27","doi-asserted-by":"crossref","unstructured":"A. Neff. A verifiable secret shuffle and its application to E-Voting. In Proc. of ACM CCS\u201901, pp. 116\u2013125. ACM Press, 2001.","DOI":"10.1145\/501983.502000"},{"key":"28_CR28","unstructured":"NIST. Secure hash standard. Federal Information Processing Standards Publication 180-1. 1995."},{"key":"28_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1007\/BFb0028500","volume-title":"Proc. of ICICS\u2019 97","author":"W. Ogata","year":"1997","unstructured":"W. Ogata, K. Kurosawa, K. Sako and K. Takatani. Fault tolerant anonymous channel. In Proc. of ICICS\u2019 97, pp. 440\u2013444, 1997. LNCS 1334."},{"key":"28_CR30","series-title":"Lect Notes Comput Sci","first-page":"223","volume-title":"Proc. of Eurocrypt\u201999","author":"P. Paillier","year":"1999","unstructured":"P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Proc. of Eurocrypt\u201999, pp. 223\u2013238. LNCS 1592."},{"key":"28_CR31","doi-asserted-by":"crossref","unstructured":"T. Pedersen. A Threshold cryptosystem without a trusted party. In Proc. of Eurocrypt\u201991, pp. 522\u2013526, 1991.","DOI":"10.1007\/3-540-46416-6_47"},{"key":"28_CR32","series-title":"Lect Notes Comput Sci","first-page":"248","volume-title":"Proc. of Eurocrypt\u2019 93","author":"C. Park","year":"1993","unstructured":"C. Park, K. Itoh and K. Kurosawa. Efficient anonymous channel and all\/nothing election Scheme. In Proc. of Eurocrypt\u2019 93, pp. 248\u2013259. Springer-Verlag, 1993. LNCS 765."},{"key":"28_CR33","series-title":"Lect Notes Comput Sci","first-page":"373","volume-title":"Proc. of Eurocrypt\u2019 89","author":"B. Pfitzmann","year":"1989","unstructured":"B. Pfitzmann and A. Pfitzmann. How to break the direct RSA-implementation of mixes. In Proc. of Eurocrypt\u2019 89, pp. 373\u2013381. Springer-Verlag, 1989. LNCS 434."},{"key":"28_CR34","unstructured":"B. Pfizmann. Breaking an efficient anonymous channel. In Proc. of Eurocrypt\u2019 94, pp. 339\u2013348."},{"key":"28_CR35","doi-asserted-by":"crossref","unstructured":"R. Rivest. The MD5 message-digest algorithm. IETF Network Working Group, RFC 1321, 1992.","DOI":"10.17487\/rfc1321"},{"key":"28_CR36","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of Eurocrypt\u2019 95.","author":"K. Sako","year":"1995","unstructured":"K. Sako and J. Kilian. Receipt-free mix-type voting scheme. In Proc. of Eurocrypt\u2019 95. Springer-Verlag, 1995. LNCS 921."},{"key":"28_CR37","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C. Schnorr","year":"1991","unstructured":"C. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4:161\u2013174, 1991.","journal-title":"Journal of Cryptology"},{"key":"28_CR38","doi-asserted-by":"crossref","unstructured":"Y. Tsiounis and M. Yung. On the security of ElGamal based encryption. In Proc. of PKC\u201998.","DOI":"10.1007\/BFb0054019"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36178-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T01:07:51Z","timestamp":1736989671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36178-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001713","9783540361787"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/3-540-36178-2_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}