{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:53:32Z","timestamp":1742997212389,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442707"},{"type":"electronic","value":"9783540458111"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45811-5_35","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T05:43:51Z","timestamp":1192772631000},"page":"446-458","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Efficient Mental Card Shuffling via Optimised Arbitrary-Sized Benes Permutation Network"],"prefix":"10.1007","author":[{"given":"Wai Han","family":"Soo","sequence":"first","affiliation":[]},{"given":"Azman","family":"Samsudin","sequence":"additional","affiliation":[]},{"given":"Alwyn","family":"Goh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,5]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C.: A Secure Poker Protocol that Minimizes the Effect of Player Coalitions. Crypto 85, 73\u201386","DOI":"10.1007\/3-540-39799-X_8"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C.: A zero-knowledge poker protocol that achieves confidentiality of the players\u2019 strategy or How to achieve an electronic poker face. Crypto 86, 239\u2013247","DOI":"10.1007\/3-540-47721-7_18"},{"key":"35_CR3","unstructured":"Schindelhauer, C.: A Toolbox for Mental Card Games. Medizinische Universit\u00e4t L\u00fcbeck, Germany (1998). Available at \nhttp:\/\/www.tcs.mu-luebeck.de\/Forschung\/A9814.ps"},{"key":"35_CR4","unstructured":"Kurosawa, K., Katayama, Y., Ogata, W.: Reshufflable and Laziness Tolerant Mental Card Game Protocol. IEICE Trans. Fundamentals, Vol. E00-A, No. 1 (1997)"},{"key":"35_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1007\/BFb0028500","volume-title":"ICICS 97","author":"W. Ogata","year":"1997","unstructured":"Ogata, W., Kurosawa, K., Sako, K., Takatani, K.: Fault Tolerant Anonymous Channel. ICICS 97. LNCS Vol. 1334, 440\u2013444"},{"key":"35_CR6","unstructured":"Benaloh, J.: Verifiable Secret-Ballot Elections. PhD thesis. Yale University, Department of Computer Science Department, New Haven, CT (1987)"},{"key":"35_CR7","unstructured":"Benaloh, J.: Dense Probabilistic Encryption. Selected Areas in Cryptography (SAC) 94, 120\u2013128"},{"key":"35_CR8","unstructured":"Jakobsson, M., Juels, A.: Millimix: Mixing in Small Batches. DIMACS Technical Report 99-33 (1999)"},{"key":"35_CR9","series-title":"Lect Notes Comput Sci","first-page":"258","volume-title":"Asiacrypt 99","author":"M. Abe","year":"2004","unstructured":"Abe, M.: Mix-Networks on Permutation Networks. Asiacrypt 99. LNCS Vol. 1716, 258\u2013273"},{"key":"35_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/3-540-44586-2_23","volume-title":"Public Key Cryptography (PKC)","author":"M. Abe","year":"2001","unstructured":"Abe, M., Hoshino, F.: Remarks on Mix-Network Based on Permutation Networks. Public Key Cryptography (PKC) 2001. LNCS 1992, 317\u2013324"},{"issue":"1","key":"35_CR11","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1145\/321439.321449","volume":"15","author":"A. Waksman","year":"1968","unstructured":"Waksman, A.: A Permutation Network. Journal of the ACM Vol. 15, No. 1 (1968) 159\u2013163","journal-title":"Journal of the ACM"},{"issue":"3","key":"35_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1142\/S0129626497000292","volume":"7","author":"C. Chang","year":"1997","unstructured":"Chang, C., Melham, R.: Arbitrary Size Benes Networks. Parallel Processing Letters Vol. 7, No. 3 (1997) 279\u2013284","journal-title":"Parallel Processing Letters"},{"key":"35_CR13","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D.L. Chaum","year":"1981","unstructured":"Chaum, D.L.: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM. Vol. 24, No. 2 (1981) 84\u201388","journal-title":"Communications of the ACM"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"ElGamal, T.: A Public-Key Cryptosystem and a Signature Scheme based on Discrete Logarithms. IEEE Trans. on Information Theory. IT Vol. 31 (1985) 469\u2013472","journal-title":"IEEE Trans. on Information Theory"},{"issue":"11","key":"35_CR15","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to Share a Secret. Communications of the ACM, Vol. 22, No. 11 (1979) 612\u2013613","journal-title":"Communications of the ACM"},{"key":"35_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"Eurocrypt 91","author":"T.P. Pedersen","year":"1991","unstructured":"Pedersen, T.P.: A Threshold Cryptosystem Without a Trusted Party. Eurocrypt 91. LNCS Vol. 547, 522\u2013526"},{"key":"35_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient Signature Generation by Smart Cards. Journal of Cryptology Vol. 4, 161\u2013174 (1991)","journal-title":"Journal of Cryptology"},{"key":"35_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Crypto 92","author":"D.L. Chaum","year":"1993","unstructured":"Chaum, D.L., Pedersen, T.P.: Wallet Databases with Observers. Crypto 92. LNCS Vol. 740, 89\u2013105"},{"key":"35_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Crypto 94","author":"R. Cramer","year":"1994","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. Crypto 94. LNCS Vol. 839, 174\u2013187"},{"issue":"5","key":"35_CR20","doi-asserted-by":"publisher","first-page":"1579","DOI":"10.1002\/j.1538-7305.1971.tb02569.x","volume":"50","author":"D.C. Opferman","year":"1971","unstructured":"Opferman, D.C., Tsao-Wu, N.T.: On A Class of Rearrangeable Switching Networks. Bell Systems Technical Journal Vol. 50, No. 5 (1971) 1579\u20131618","journal-title":"Bell Systems Technical Journal"}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45811-5_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T18:02:59Z","timestamp":1580148179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45811-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442707","9783540458111"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45811-5_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"5 September 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}