{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:01:58Z","timestamp":1725559318825},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540266563"},{"type":"electronic","value":"9783540316800"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11507840_27","type":"book-chapter","created":{"date-parts":[[2010,7,15]],"date-time":"2010-07-15T08:35:59Z","timestamp":1279182959000},"page":"313-327","source":"Crossref","is-referenced-by-count":5,"title":["Event Driven Private Counters"],"prefix":"10.1007","author":[{"given":"Eu-Jin","family":"Goh","sequence":"first","affiliation":[]},{"given":"Philippe","family":"Golle","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/10929179_44","volume-title":"Electronic Government","author":"R. Aditya","year":"2003","unstructured":"Aditya, R., Boyd, C., Dawson, E., Viswanathan, K.: Secure e-voting for preferential elections. In: Traunm\u00fcller, R. (ed.) EGOV 2003. LNCS, vol.\u00a02739, pp. 246\u2013249. Springer, Heidelberg (2003)"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Baudron, O., Fouque, P.-A., Pointcheval, D., Stern, J., Poupard, G.: Practical multi-candidate election system. In: Shavit, N. (ed.) Proceedings of the ACM Symposium on the Principles of Distributed Systems 2001, pp. 274\u2013283 (2001)","DOI":"10.1145\/383962.384044"},{"key":"27_CR3","unstructured":"Benaloh, J.: Verifiable Secret-Ballot Elections. PhD thesis, Yale University (1987)"},{"key":"27_CR4","unstructured":"Benaloh, J.: Dense probabilistic encryption. In: Proceedings of the Workshop on Selected Areas in Cryptography 1994, pp. 120\u2013128 (May 1994)"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Benaloh, J., Tuinstra, D.: Receipt-free secret-ballot elections. In: Proceedings of the 26th ACM Symposium on Theory of Computing, pp. 544\u2013553 (1994)","DOI":"10.1145\/195058.195407"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Benaloh, J., Yung, M.: Distributing the power of a government to enhance to privacy of voters. In: Proceedings of the 5th Symposium on Principles of Distributed Computing, pp. 52\u201362 (1986)","DOI":"10.1145\/10590.10595"},{"issue":"2","key":"27_CR7","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. Communications of the ACM\u00a024(2), 84\u201388 (1981)","journal-title":"Communications of the ACM"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Cohen, J., Fischer, M.: A robust and verifiable cryptographically secure election scheme. In: Proceedings of 26th IEEE Symposium on Foundations of Computer Science, pp. 372\u2013382 (1985)","DOI":"10.1109\/SFCS.1985.2"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","first-page":"174","volume-title":"Database Theory - ICDT \u201995","author":"R. Cramer","year":"1995","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Y. Vardi, M., Gottlob, G. (eds.) ICDT 1995. LNCS, vol.\u00a0893, pp. 174\u2013187. Springer, Heidelberg (1995)"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-68339-9_7","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"R. Cramer","year":"1996","unstructured":"Cramer, R., Franklin, M., Schoenmakers, B., Yung, M.: Multi-authority secret-ballot elections with linear work. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 72\u201383. Springer, Heidelberg (1996)"},{"issue":"5","key":"27_CR11","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1002\/ett.4460080506","volume":"8","author":"R. Cramer","year":"1997","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. European Transactions on Telecommunications\u00a08(5), 481\u2013490 (1997)","journal-title":"European Transactions on Telecommunications"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I. Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Jurik, M.: A generalisation, a simplification and some applications of Paillier\u2019s probabilistic public-key system. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"issue":"4","key":"27_CR13","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. Gamal El","year":"1985","unstructured":"El Gamal, T.: A public key cryptosystem and a signature scheme based on disc rete logarithms. IEEE Transactions on Information Theory\u00a031(4), 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-45472-1_7","volume-title":"Financial Cryptography","author":"P.-A. Fouque","year":"2001","unstructured":"Fouque, P.-A., Poupard, G., Stern, J.: Sharing decryption in the context of voting or lotteries. In: Frankel, Y. (ed.) FC 2000. LNCS, vol.\u00a01962, pp. 90\u2013104. Springer, Heidelberg (2001)"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Furukawa, J., Miyauchi, H., Mori, K., Obana, S., Sako, K.: An implementation of a universally verifiable electronic voting scheme based on shuffling. In: Proceedings of Financial Cryptography 2002, pp. 16\u201330 (2002)","DOI":"10.1007\/3-540-36504-4_2"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption & how to play mental poker keeping secret all partial information. In: Proceedings of the 14th ACM Symposium on Theory of computing, pp. 365\u2013377 (1982)","DOI":"10.1145\/800070.802212"},{"key":"27_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/3-540-45539-6_38","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"M. Hirt","year":"2000","unstructured":"Hirt, M., Sako, K.: Efficient receipt-free voting based on homomorphic encryption. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 539\u2013556. Springer, Heidelberg (2000)"},{"key":"27_CR19","unstructured":"Jakobsson, M., Juels, A., Rivest, R.: Making mix nets robust for electronic voting by randomized partial checking. In: Boneh, D. (ed.) Proceedings of USENIX Security Symposium 2002, pp. 339\u2013353 (2002)"},{"key":"27_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/3-540-44987-6_6","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"J. Katz","year":"2001","unstructured":"Katz, J., Myers, S., Ostrovsky, R.: Cryptographic counters and applications to electronic voting. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 78\u201392. Springer, Heidelberg (2001)"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Naccache, D., Stern, J.: A new public key cryptosystem based on higher residues. In: Proceedings of the 5th ACM Symposium on Computer and Communications Security, pp. 59\u201366 (1998)","DOI":"10.1145\/288090.288106"},{"key":"27_CR22","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","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.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"27_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/3-540-68339-9_33","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"D. Pointcheval","year":"1996","unstructured":"Pointcheval, D., Stern, J.: Security proofs for signature schemes. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 387\u2013398. Springer, Heidelberg (1996)"},{"issue":"2","key":"27_CR24","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/0022-0000(83)90042-9","volume":"27","author":"M. Rabin","year":"1983","unstructured":"Rabin, M.: Transaction protection by beacons. Journal of Computer and System Science\u00a027(2), 256\u2013267 (1983)","journal-title":"Journal of Computer and System Science"},{"key":"27_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/3-540-49264-X_32","volume-title":"Advances in Cryptology - 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.\u00a0921, pp. 393\u2013403. Springer, Heidelberg (1995)"},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"Santis, A.D., Crescenzo, G.D., Persiano, G., Yung, M.: On monotone formula closure of SZK. In: Proceedings of the IEEE Symposium on Foundations of Computer Science 1994, pp. 454\u2013465 (1994)","DOI":"10.1109\/SFCS.1994.365745"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11507840_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:03:42Z","timestamp":1605625422000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11507840_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540266563","9783540316800"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11507840_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}