{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T18:18:16Z","timestamp":1757701096904},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734192"},{"type":"electronic","value":"9783540734208"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73420-8_43","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T14:58:43Z","timestamp":1188053923000},"page":"484-495","source":"Crossref","is-referenced-by-count":11,"title":["Offline\/Online Mixing"],"prefix":"10.1007","author":[{"given":"Ben","family":"Adida","sequence":"first","affiliation":[]},{"given":"Douglas","family":"Wikstr\u00f6m","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-45067-X_4","volume-title":"Information Security and Privacy","author":"M. Abe","year":"2003","unstructured":"Abe, M., Imai, H.: Flaws in some robust optimistic mix-nets. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol.\u00a02727, pp. 39\u201350. Springer, Heidelberg (2003)"},{"key":"43_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-540-70936-7_30","volume-title":"Theory of Cryptography","author":"B. Adida","year":"2007","unstructured":"Adida, B., Wikstr\u00f6m, D.: How to shuffle in public (Accepted for publication at Theory of Cryptography Conference 2007 (full version [2])). In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 555\u2013574. Springer, Heidelberg (2007)"},{"unstructured":"Adida, B., Wikstr\u00f6m, D.: Offline\/online-mixing. Cryptology ePrint Archive, Report 2007\/143 (2007), http:\/\/eprint.iacr.org\/","key":"43_CR3"},{"key":"43_CR4","first-page":"544","volume-title":"STOC","author":"J. Benaloh","year":"1994","unstructured":"Benaloh, J., Tuinstra, D.: Receipt-free secret-ballot elections. In: STOC. 26th ACM Symposium on the Theory of Computing, pp. 544\u2013553. ACM Press, New York (1994)"},{"key":"43_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","volume-title":"Theory of Cryptography","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 325\u2013342. Springer, Heidelberg (2005)"},{"key":"43_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-45539-6_31","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"F. Boudot","year":"2000","unstructured":"Boudot, F.: Efficient proofs that a committed number lies in an interval. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 431\u2013444. Springer, Heidelberg (2000)"},{"key":"43_CR7","first-page":"136","volume-title":"FOCS","author":"R. Canetti","year":"2001","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols (Full version at Cryptology ePrint Archive, Report 2000\/067). In: FOCS. 42nd IEEE Symposium on Foundations of Computer Science, October, pp. 136\u2013145. IEEE Computer Society Press, Los Alamitos (2001), http:\/\/eprint.iacr.org"},{"issue":"2","key":"43_CR8","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 pseudo-nyms. Communications of the ACM\u00a024(2), 84\u201388 (1981)","journal-title":"Communications of the ACM"},{"key":"43_CR9","first-page":"372","volume-title":"FOCS","author":"J. Cohen","year":"1985","unstructured":"Cohen, J., Fischer, M.: A robust and verifiable cryptographically secure election scheme. In: FOCS. 28th IEEE Symposium on Foundations of Computer Science, pp. 372\u2013382. IEEE Computer Society Press, Los Alamitos (1985)"},{"key":"43_CR10","series-title":"Lecture Notes in Computer Science","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":"Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 103\u2013118. Springer, Heidelberg (1997)"},{"key":"43_CR11","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":"43_CR12","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 signiture scheme based on discrete logarithms. IEEE Transactions on Information Theory\u00a031(4), 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"43_CR13","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences\u00a028(2), 270\u2013299 (1984)","journal-title":"Journal of Computer and System Sciences"},{"key":"43_CR14","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":"43_CR15","volume-title":"Handbook of Applied Cryptography","author":"A. Menezes","year":"1997","unstructured":"Menezes, A., Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)"},{"key":"43_CR16","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1145\/100216.100273","volume-title":"STOC","author":"M. Naor","year":"1990","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attack. In: STOC. 22th ACM Symposium on the Theory of Computing, pp. 427\u2013437. ACM Press, New York (1990)"},{"key":"43_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/BFb0054135","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"T. Okamoto","year":"1998","unstructured":"Okamoto, T., Uchiyama, S.: A new public-key cryptosystem as secure as factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 308\u2013318. Springer, Heidelberg (1998)"},{"key":"43_CR18","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":"43_CR19","series-title":"Lecture Notes in Computer Science","first-page":"315","volume-title":"Theory of Cryptography","author":"D. Wikstr\u00f6m","year":"2004","unstructured":"Wikstr\u00f6m, D.: A universally composable mix-net. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 315\u2013335. Springer, Heidelberg (2004)"},{"key":"43_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/11593447_15","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"D. Wikstr\u00f6m","year":"2005","unstructured":"Wikstr\u00f6m, D.: A sender verifiable mix-net and a new proof of a shuffle (Full version [22]). In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 273\u2013292. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Wikstr\u00f6m, D.: A sender verifiable mix-net and a new proof of a shuffle. Cryptology ePrint Archive, Report 2004\/137 (2005), http:\/\/eprint.iacr.org\/","key":"43_CR21","DOI":"10.1007\/11593447_15"},{"key":"43_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/11787006_24","volume-title":"Automata, Languages and Programming","author":"D. Wikstr\u00f6m","year":"2006","unstructured":"Wikstr\u00f6m, D., Groth, J.: An adaptively secure mix-net without erasures. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 276\u2013287. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73420-8_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:11:11Z","timestamp":1619518271000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73420-8_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734192","9783540734208"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73420-8_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}