Efficient mental card shuffling via optimised arbitrary-sized benes permutation network

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2433, Issue , 2002, Pages 446-458

  Soo, Wai Han ^a   Samsudin, Azman ^a   Goh, Alwyn ^b  

^a SCHOOL OF PHYSICS   (Malaysia)

^b OpenSys (M) Sdn Bhd KLCC Tower 2   (Malaysia)

Author keywords

Benes permutation network; Mental card game; Mix net; Shuffle

Indexed keywords

SECURITY OF DATA;

ASYMPTOTIC COMPLEXITY; CARD GAMES; MIX-NET; OPTIMISATIONS; PERMUTATION NETWORK; SHUFFLE; VERIFIABLE SECRET SHARING; ZERO KNOWLEDGE PROOF;

COMPLEX NETWORKS;

EID: 84945273372     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45811-5_35     Document Type: Conference Paper

References (20)

1. Crépeau, C.: A Secure Poker Protocol that Minimizes the Effect of Player Coalitions. Crypto 85, 73–86
2. Crépeau, C.: A zero-knowledge poker protocol that achieves confidentiality of the players’ strategy or How to achieve an electronic poker face. Crypto 86, 239–247
3. Schindelhauer, C.: A Toolbox for Mental Card Games. Medizinische Universität Lübeck, Germany (1998). Available at http://www.tcs.mu-luebeck.de/Forschung/A9814.ps
4. Kurosawa, K., Katayama, Y., Ogata, W.: Reshufflable and Laziness Tolerant Mental Card Game Protocol. IEICE Trans. Fundamentals, Vol. E00-A, No. 1 (1997)
5. Ogata, W., Kurosawa, K., Sako, K., Takatani, K.: Fault Tolerant Anonymous Channel. ICICS 97. LNCS Vol. 1334, 440–444
6. Benaloh, J.: Verifiable Secret-Ballot Elections. PhD thesis. Yale University, Department of Computer Science Department, New Haven, CT (1987)
7. Benaloh, J.: Dense Probabilistic Encryption. Selected Areas in Cryptography (SAC) 94, 120–128
8. Jakobsson, M., Juels, A.: Millimix: Mixing in Small Batches. DIMACS Technical Report 99–33 (1999)
9. Abe, M.: Mix-Networks on Permutation Networks. Asiacrypt 99. LNCS Vol. 1716, 258-273
10. Abe, M., Hoshino, F.: Remarks on Mix-Network Based on Permutation Networks. Public Key Cryptography (PKC) 2001. LNCS 1992, 317–324
11. Waksman, A.: A Permutation Network. Journal of the ACM Vol. 15, No. 1 (1968) 159-163
12. Chang, C., Melham, R.: Arbitrary Size Benes Networks. Parallel Processing Letters Vol. 7, No. 3 (1997) 279–284
13. Chaum, D. L.: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM. Vol. 24, No. 2 (1981) 84–88
14. ElGamal, T.: A Public-Key Cryptosystem and a Signature Scheme based on Discrete Logarithms. IEEE Trans. on Information Theory. IT Vol. 31 (1985) 469–472
15. Shamir, A.: How to Share a Secret. Communications of the ACM, Vol. 22, No. 11 (1979) 612–613
16. Pedersen, T. P.: A Threshold Cryptosystem Without a Trusted Party. Eurocrypt 91. LNCS Vol. 547, 522–526
17. Schnorr, C. P.: Efficient Signature Generation by Smart Cards. Journal of Cryptology Vol. 4, 161–174 (1991)
18. Chaum, D. L., Pedersen, T. P.: Wallet Databases with Observers. Crypto 92. LNCS Vol. 740, 89–105
19. Cramer, R., Damgård, I., Schoenmakers, B.: Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. Crypto 94. LNCS Vol. 839, 174–187
20. Opferman, D. C., Tsao-Wu, N. T.: On A Class of Rearrangeable Switching Networks. Bell Systems Technical Journal Vol. 50, No. 5 (1971) 1579–1618