Abstract
The presumption of player distrust and untrustworthiness in mental card gaming results in the formulation of complex and compute-intensive protocols, particularly for shuffling. We present a robust, verifiable and efficient card shuffling protocol based on an optimisation of Chang-Melham arbitrary-sized (AS) Benes permutation network (PN), which can flexibly accommodates variable pack sizes, achieving optimal shuffling performance. We also outline the use of these PNs in a distributed (among η players) construction, which combines the best attributes of Abe and Jakobsson-Juels mix-net formalisms. Card shuffling can therefore be executed on a structurally simple mix-net - with only t + 1 PNs required for operational robustness against collusion by t cheating players, and efficient zero knowledge proofs (ZKP) to verify correct shuffling by each player. Shuffling efficiency is also enhanced by our limited application of verifiable secret sharing (VSS) on the ElGamal keys. The resultant protocol achieves an asymptotic complexity of O(tN lg N) for N inputs; which is comparable or superior to previous schemes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Crépeau, C.: A Secure Poker Protocol that Minimizes the Effect of Player Coalitions. Crypto 85, 73–86
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
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
Kurosawa, K., Katayama, Y., Ogata, W.: Reshufflable and Laziness Tolerant Mental Card Game Protocol. IEICE Trans. Fundamentals, Vol. E00-A, No. 1 (1997)
Ogata, W., Kurosawa, K., Sako, K., Takatani, K.: Fault Tolerant Anonymous Channel. ICICS 97. LNCS Vol. 1334, 440–444
Benaloh, J.: Verifiable Secret-Ballot Elections. PhD thesis. Yale University, Department of Computer Science Department, New Haven, CT (1987)
Benaloh, J.: Dense Probabilistic Encryption. Selected Areas in Cryptography (SAC) 94, 120–128
Jakobsson, M., Juels, A.: Millimix: Mixing in Small Batches. DIMACS Technical Report 99-33 (1999)
Abe, M.: Mix-Networks on Permutation Networks. Asiacrypt 99. LNCS Vol. 1716, 258–273
Abe, M., Hoshino, F.: Remarks on Mix-Network Based on Permutation Networks. Public Key Cryptography (PKC) 2001. LNCS 1992, 317–324
Waksman, A.: A Permutation Network. Journal of the ACM Vol. 15, No. 1 (1968) 159–163
Chang, C., Melham, R.: Arbitrary Size Benes Networks. Parallel Processing Letters Vol. 7, No. 3 (1997) 279–284
Chaum, D.L.: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM. Vol. 24, No. 2 (1981) 84–88
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
Shamir, A.: How to Share a Secret. Communications of the ACM, Vol. 22, No. 11 (1979) 612–613
Pedersen, T.P.: A Threshold Cryptosystem Without a Trusted Party. Eurocrypt 91. LNCS Vol. 547, 522–526
Schnorr, C.P.: Efficient Signature Generation by Smart Cards. Journal of Cryptology Vol. 4, 161–174 (1991)
Chaum, D.L., Pedersen, T.P.: Wallet Databases with Observers. Crypto 92. LNCS Vol. 740, 89–105
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
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Soo, W.H., Samsudin, A., Goh, A. (2002). Efficient Mental Card Shuffling via Optimised Arbitrary-Sized Benes Permutation Network. In: Chan, A.H., Gligor, V. (eds) Information Security. ISC 2002. Lecture Notes in Computer Science, vol 2433. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45811-5_35
Download citation
DOI: https://doi.org/10.1007/3-540-45811-5_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44270-7
Online ISBN: 978-3-540-45811-1
eBook Packages: Springer Book Archive