{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T05:36:41Z","timestamp":1737178601615,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540002635"},{"type":"electronic","value":"9783540362319"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36231-2_29","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T15:21:45Z","timestamp":1183389705000},"page":"368-381","source":"Crossref","is-referenced-by-count":7,"title":["The Security of a Mix-Center Based on a Semantically Secure Cryptosystem"],"prefix":"10.1007","author":[{"given":"Douglas","family":"Wikstr\u00f6m","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"M. Abe, Universally Verifiable mix-net with Verification Work Independent of the Number of Mix-centers, Eurocrypt\u2019 98, pp. 437\u2013447.","DOI":"10.1007\/BFb0054144"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"R. Canetti, Universally Composable Security: A New Paradigm for Cryptographic Protocols, http:\/\/eprint.iacr.org\/2000\/067 and ECCC TR 01\u201324. Extended abstract appears in 42nd FOCS, 2001.","DOI":"10.1109\/SFCS.2001.959888"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"D. Chaum, Untraceable Electronic Mail, Return Addresses and Digital Pseudonyms, Communications of the ACM, ACM 81, pp. 84\u201388.","DOI":"10.1145\/358549.358563"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"R. Cramer, V. Shoup, A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack, Crypto\u2019 98, pp. 13\u201325.","DOI":"10.1007\/BFb0055717"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Y. Desmedt, K. Kurosawa, How to break a practical MIX and design a new one, Eurocrypt 2000, pp. 557\u2013572.","DOI":"10.1007\/3-540-45539-6_39"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"D. Dolev, C. Dwork, M. Naor, Non-Malleable Cryptography, In Proceedings of the 23rd Symposium on Theory of Computing, ACM STOC 1991.","DOI":"10.1145\/103418.103474"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"T. ElGamal, A Public Key Cryptosystem and a Signiture Scheme Based on Discrete Logarithms, IEEE Transactions on Information Theory 31, 1985, pp. 469\u2013472.","journal-title":"IEEE Transactions on Information Theory"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"A. Fujioka, T. Okamoto and K. Ohta, A practical secret voting scheme for large scale elections, Auscrypt\u2019 92, pp. 244\u2013251.","DOI":"10.1007\/3-540-57220-1_66"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser, S. Micali, Probabilistic Encryption, Journal of Computer Science 28, pp. 270\u2013299, 1984.","journal-title":"Journal of Computer Science"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"M. Hirt, K. Sako, Efficient Reciept-Free Voting Based on Homomorphic Encryption, Eurocrypt 2000, pp. 539\u2013556.","DOI":"10.1007\/3-540-45539-6_38"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"M. Jakobsson, A Practical Mix, Eurocrypt\u2019 98, pp. 448\u2013461.","DOI":"10.1007\/BFb0054145"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"M. Jakobsson, D. M\u2019Raihi, Mix-based Electronic Payments, SAC\u2019 98, pp. 157\u2013173.","DOI":"10.1007\/3-540-48892-8_13"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"M. Jakobsson, Flash Mixing, PODC\u201999, pp. 83\u201389.","DOI":"10.1145\/301308.301333"},{"key":"29_CR14","unstructured":"M. Jakobsson, A. Juels, Millimix: Mixing in small batches, DIMACS Techical report 99\u201333, June 1999."},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"S. Micali, C. Racko., B. Sloan, The Notion of Security for Probabilistic Cryptosystems, SIAM J. Computing 1988, pp. 412\u2013426. 371","DOI":"10.1137\/0217025"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"M. Mitomo, K. Kurosawa, Attack for Flash MIX, Asiacrypt 2000, pp. 192\u2013204.","DOI":"10.1007\/3-540-44448-3_15"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"M. Michels, P. Horster, Some remarks on a reciept-free and universally verifiable Mix-type voting scheme, Asiacrypt\u2019 96, pp. 125\u2013132.","DOI":"10.1007\/BFb0034841"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"V. Niemi, A. Renvall, Efficient voting with no selling of votes, Asiacrypt\u201994, pp. 105\u2013116.","DOI":"10.1016\/S0304-3975(99)00068-7"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"W. Ogata, K. Kurosawa, K. Sako, K. Takatani, Fault Tolerant Anonymous Channel, ICICS\u2019 97, pp. 440\u2013444.","DOI":"10.1007\/BFb0028500"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"P. Paillier, Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, Eurocrypt\u2019 99, pp. 223\u2013238.","DOI":"10.1007\/3-540-48910-X_16"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"C. Park, K. Itoh, K. Kurosawa, Efficient Anonymous Channel and All\/Nothing Election Scheme, Eurocrypt\u2019 93, pp. 248\u2013259.","DOI":"10.1007\/3-540-48285-7_21"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"B. Pfitzmann, M. Waidner, Composition and Integrity Preservation of Secure Reactive Systems, 7th Conference on Computer and Communications Security of the ACM, pp. 245\u2013254, 2000.","DOI":"10.1145\/352600.352639"},{"key":"29_CR23","doi-asserted-by":"crossref","unstructured":"B. Pfitzmann, Breaking an E.cient Anonymous Channel, Eurocrypt\u2019 94, pp. 332\u2013340.","DOI":"10.1007\/BFb0053448"},{"key":"29_CR24","doi-asserted-by":"crossref","unstructured":"K. Sako, J. Killian, Reciept-free Mix-Type Voting Scheme, Eurocrypt\u2019 95, pp. 393\u2013403.","DOI":"10.1007\/3-540-49264-X_32"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2014 INDOCRYPT 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36231-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T02:48:30Z","timestamp":1737168510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36231-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540002635","9783540362319"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-36231-2_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}