{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:09:57Z","timestamp":1725484197290},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440796"},{"type":"electronic","value":"9783540460886"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46088-8_12","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T07:08:39Z","timestamp":1179731319000},"page":"117-135","source":"Crossref","is-referenced-by-count":4,"title":["Anonymity without \u2018Cryptography\u2019"],"prefix":"10.1007","author":[{"given":"Dahlia","family":"Malkhi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elan","family":"Pavlov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,31]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"J. Benaloh and M. Yung. \u201cDistributing the power of a government to enhance the privacy of voters\u201d. In Proceedings of the 5th ACM Symposium on Principles of Distributed Computing (PODC), pp. 52\u201362, 1986.","DOI":"10.1145\/10590.10595"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. \u201cCompleteness theorems for fault-tolerant distributed computing\u201d. In ACM Symposium Theory of Computing (STOC), pp. 1\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"12_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/3-540-46885-4_33","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201997","author":"J. Bos","year":"1990","unstructured":"J. Bos, B. den Boer. \u201cDetection of disrupters in the DC protocol\u201d. LNCS 434, Advances in Cryptology \u2014 EUROCRYPT\u201997, pp. 320\u2013327, 1990."},{"key":"12_CR4","series-title":"Lect Notes Comput Sci","first-page":"234","volume-title":"Advances in cryptology \u2014 CRYPTO\u201986","author":"G. Brassard","year":"1986","unstructured":"G. Brassard and C. Crepeau. \u201cAll-or-nothing disclosure of secrets\u201d. LNCS 263, Advances in cryptology \u2014 CRYPTO\u201986, pp. 234\u2013238, 1986."},{"issue":"2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"D. Chaum. \u201cUntraceable electronic mail, return addresses and digital pseudonyms\u201d. Communications of the ACM 24(2):84\u201388, 1981.","journal-title":"Communications of the ACM"},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1145\/4372.4373","volume":"28","author":"D. Chaum","year":"1985","unstructured":"D. Chaum. \u201cSecurity without identification: Transaction systems to make big brother obsolete\u201d. Communication of the ACM 28(1):1030\u20131044, 1985.","journal-title":"Communication of the ACM"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D. Chaum","year":"1988","unstructured":"D. Chaum. \u201cThe dining cryptographers problem: Unconditional sender and recipient untraceability\u201d. Journal of Cryptology 1(1):65\u201375, 1988.","journal-title":"Journal of Cryptology"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Crepau, and I. Damgard. \u201cMultiparty unconditionally secure protocols\u201d. In Proceedings of the 20th Annual ACM Symposium on the Theory of Computing (STOC), pp. 11\u201319, 1988.","DOI":"10.1145\/62212.62214"},{"key":"12_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/3-540-38424-3_15","volume-title":"Advances in cryptology \u2014 CRYPTO\u201990","author":"D. Chaum","year":"1991","unstructured":"D. Chaum, S. Roijakkers. \u201cUnconditionally secure digital signatures\u201d. LNCS 537, Advances in cryptology \u2014 CRYPTO\u201990, pp. 206\u2013214, 1991."},{"key":"12_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-68339-9_7","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201996","author":"R. Cramer","year":"1996","unstructured":"R. Cramer, M. Franklin, B. Schoenmakers, and M. Yung. \u201cMulti-authority secret-ballot elections with linear work\u201d. LNCS 1070, Advances in Cryptology \u2014 EUROCRYPT\u201996, pp. 72\u201383, 1996."},{"key":"12_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-69053-0_9","volume-title":"Advances in Cryptology-EUROCRYPT\u201997","author":"R. Cramer","year":"1997","unstructured":"R. Cramer, R. Gennaro, and B. Schoenmakers. \u201cA secure and optimally efficient multi-authority election scheme\u201d. LNCS 1233, Advances in Cryptology-EUROCRYPT\u201997, pp. 103\u2013118, 1997."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"L. F. Cranor and R. K. Cytron. \u201cSensus: A security-conscious electronic polling system for the Internet\u201d. Proceedings of the Hawai\u2018i International Conference on System Sciences, 1997, Wailea, Hawaii.","DOI":"10.1109\/HICSS.1997.661700"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"R. DeMillo, N. Lynch, and M. Merritt. \u201cCryptographic protocols\u201d. Proceedings of the 14th Annual Symposium on the Theory of Computing, pp. 383\u2013400, 1982.","DOI":"10.1145\/800070.802214"},{"key":"12_CR14","series-title":"Lect Notes Comput Sci","first-page":"244","volume-title":"Advances in Cryptology \u2014 AUSCRYPT\u201992","author":"B. Fujioka","year":"1992","unstructured":"B. Fujioka, T. Okamoto, and K. Ohta. \u201cA Practical Secret Voting Scheme for Large Scale Elections\u201d. LNCS 718, Advances in Cryptology \u2014 AUSCRYPT\u201992, pp. 244\u2013251, 1992."},{"key":"12_CR15","unstructured":"O. Goldreich. \u201cSecure Multi-party Computation\u201d. Working draft. Available at http:\/\/www.wisdom.weizmann.ac.il\/~oded\/pp.html ."},{"key":"12_CR16","unstructured":"Q. He and Z. Su. \u201cA new practical secure e-voting scheme\u201d. IFIP\/SEC\u201998 14th International Information Security Conference, 1998."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"M. Jakobsson. \u201cFlash mixing\u201d. In Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 83\u201389, 1999.","DOI":"10.1145\/301308.301333"},{"key":"12_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/3-540-48405-1_36","volume-title":"Advances in Cryptology \u2014 CRYPTO\u201999","author":"M. Naor","year":"1999","unstructured":"M. Naor and B. Pinkas, \u201cOblivious transfer with adaptive queries\u201d. LNCS 1666, Advances in Cryptology \u2014 CRYPTO\u201999, pp. 573\u2013590, 1999."},{"issue":"10","key":"12_CR19","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/0167-4048(91)90081-N","volume":"36","author":"H. Nurmi","year":"1991","unstructured":"H. Nurmi, A. Salomaa, and L. Santean. \u201cSecret ballot elections in computer networks\u201d. Computers & Security, 36(10):553\u2013560, 1991.","journal-title":"Computers & Security"},{"key":"12_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in cryptology \u2014 CRYPTO\u201991","author":"T. Pedersen","year":"1992","unstructured":"T. Pedersen. \u201cNon-interactive and information secure verifiable secret sharing\u201d. LNCS 576, Advances in cryptology \u2014 CRYPTO\u201991, pp. 129\u2013140, 1992."},{"issue":"2","key":"12_CR21","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/0167-4048(87)90087-3","volume":"6","author":"A. Pfitzmann","year":"1987","unstructured":"A. Pfitzmann and M. Waidner. Networks without user observability. Computers & Security 6(2):158\u2013166, 1987.","journal-title":"Computers & Security"},{"key":"12_CR22","unstructured":"M. Rabin. \u201cHow to exchange secrets by Oblivious transfer\u201d. TR-81 Aileen computation laboratory 1981."},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"T. Rabin and M. Ben-Or. \u201cVerifiable secret sharing and multiparty protocols with honest majority\u201d. In Proceedings of the 21st ACM Symposium on Theory of Computing (STOC), pp. 73\u201385, 1989.","DOI":"10.1145\/73007.73014"},{"issue":"1","key":"12_CR24","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/290163.290168","volume":"1","author":"M. Reiter","year":"1998","unstructured":"M. Reiter and A. Rubin. \u201cCrowds: Anonymity for Web Transactions\u201d. ACM Transactions on Information and System Security, 1(1):66\u201392, November 1998.","journal-title":"ACM Transactions on Information and System Security"},{"key":"12_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/BFb0023811","volume-title":"Advances in Cryptology-CRYPTO\u201991","author":"D. Simon","year":"1992","unstructured":"D. Simon and C. Rackoff, \u201dNon-interactive zero-knowledge proof of knowledge and chosen ciphertext attack\u201d. LNCS 576, Advances in Cryptology-CRYPTO\u201991, pp. 433\u2013444, 1992."},{"key":"12_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/3-540-48658-5_37","volume-title":"Advances in Cryptology \u2014 CRYPTO\u201994","author":"K. Sako","year":"1994","unstructured":"K. Sako and J. Killian. \u201cSecure voting using partially compatible homomorphisms\u201d. LNCS 839, Advances in Cryptology \u2014 CRYPTO\u201994, pp. 411\u2013424, 1994."},{"key":"12_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BFb0038196","volume-title":"New Results and New Trends in Computer Science","author":"A. Salomaa","year":"1991","unstructured":"A. Salomaa. \u201cVerifying and recasting secret ballots in computer networks\u201d. LNCS 555, New Results and New Trends in Computer Science, pp. 283\u2013289, 1991."},{"key":"12_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-48405-1_10","volume-title":"Advances in Cryptology \u2014 CRYPTO\u201999","author":"B. Schoenmakers","year":"1999","unstructured":"B. Schoenmakers. \u201cA Simple publicly verifiable secret sharing scheme and its application to electronic voting\u201d. LNCS 1666, Advances in Cryptology \u2014 CRYPTO\u201999, pp. 148\u2013164, 1999."},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"P. Syverson, D. Goldschlag, and M. Reed. \u201cAnonymous connections and onion routing\u201d. In Proceeding of the IEEE Symposium on security and privacy, 1997.","DOI":"10.1109\/SECPRI.1997.601314"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46088-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T02:24:47Z","timestamp":1556418287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46088-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440796","9783540460886"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-46088-8_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}