%% Copyright (C) 2007 Heiko Stamer %% %% Permission is granted to copy, distribute and/or modify this document %% under the terms of the GNU Free Documentation License, Version 1.2 %% or any later version published by the Free Software Foundation; %% with no Invariant Sections, no Front-Cover Texts, and no Back-Cover %% Texts. A copy of the license is included in the section entitled "GNU %% Free Documentation License". %% %%% BibTeX-file{ %%% filename = "MentalPoker.bib", %%% version = "1.5", %%% url = "http://www.nongnu.org/libtmcg/MentalPoker.bib", %%% date = "12 June 2007", %%% time = "10:00:00 CEST", %%% author = "Heiko Stamer", %%% address = "Universitaet Kassel, %%% Fachbereich Mathematik/Informatik, %%% Wilhelmshoeher Allee 71-73, Raum 2607 EIT, %%% D-34121 Kassel, %%% Germany", %%% email = "stamer AT gaos.org", %%% codetable = "ISO/ASCII", %%% keywords = "Mental Poker, Cryptography, E-Gambling", %%% supported = "yes", %%% abstract = "This bibliography contain references to papers which %%% consider cryptographic protocols or implementations to solve %%% the so-called Mental Poker problem. This problem asks %%% whether it is possible to play a fair game of poker without %%% cards and without a trusted dealer, e.g. by phone or over %%% the Internet. This question had a large impact in the early %%% days of public research in cryptography and led to important %%% considerations like semantic security.", %%% } @string{o-GI = {Gesellschaft f{\"u}r Informatik e.V.}} @string{o-SPRINGER = {Springer Verlag}} @string{o-ACADEMIC = {Academic Press Professional}} @string{o-ACM = {ACM Press}} @string{o-IEEE = {IEEE Computer Society}} @string{o-ACS = {Australian Computer Society}} @string{s-LNCS = {Lecture Notes in Computer Science}} @string{s-LNI = {Lecture Notes in Informatics}} @string{s-CRPIT = {Conferences in Research and Practice in Information Technology}} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 2007 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % url = {http://etd1.library.duq.edu/theses/available/etd-03192007-133602/} @mastersthesis{Tetikoglu:2007, author = {Ipek Tetikoglu}, title = {{The Elgamal Cryptosystem is better than the RSA Cryptosystem for Mental Poker}}, school = {Department of Computational Mathematics, Duquesne University}, year = 2007, abstract = {Cryptosystems are one of the most important parts of secure online poker card games. However, there is no research comparing the RSA Cryptosystem (RC) and Elgamal Cryptosystem (EC) for mental poker card games. This paper compares the RSA Cryptosystem and Elgamal Cryptosystem implementations of mental poker card games using distributed key generation schemes. Each implementation is based on a joint encryption/decryption of individual cards. Both implementations use shared private key encryption/decryption schemes and neither uses a trusted third party (TTP). The comparison criteria will be concentrated on the security and computational complexity of the game, collusions among the players and the debate between the discrete logarithm problem (DLP) and the factoring problem (FP) for the encryption/decryption schemes. Under these criteria, the comparison results demonstrate that the Elgamal Cryptosystem has better efficiency and effectiveness than RSA for mental poker card games.}, keywords = {Elgamal, RSA, Mental Poker} } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 2006 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % filename = {IEEEhomomorphisms.pdf} @inproceedings{Castella-RocaDazaDomingo-FerrerSebe:2006, author = {Jordi Castell{\`a}-Roca and Vanesa Daza and Josep Domingo-Ferrer and Francesc Seb{\'e}}, title = {{Privacy Homomorphisms for E-Gambling and Mental Poker}}, booktitle = {Proceedings of the IEEE International Conference on Granular Computing}, year = 2006, pages = {788--791}, ISBN = {1-4244-0134-8}, abstract = {With the development of computer networks, situations where a set of players remotely play a game (e-gaming) have become usual. Often players play for money (e-gambling), which requires standards of security similar to those in physical gambling. Cryptographic tools have been commonly used so far to provide security to e-gambling. Homomorphic encryption is an example of such tools. In this paper we review the mental poker protocols, where players are assumed to remotely play poker. We focus on the key advantage of using cryptosystems with homomorphic properties (privacy homomorphisms) because they offer the possibility of manipulating cards in encrypted form.} } % url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?tp=&arnumber=1611680&isnumber=33849} @inproceedings{Castella-RocaDomingo-FerrerSebe:2006, author = {Jordi Castell{\`a}-Roca and Josep Domingo-Ferrer and Francesc Seb{\'e}}, title = {{On the Security of a Repaired Mental Poker Protocol}}, booktitle = {Information Technology: New Generations, Proceedings of the Third International Conference (ITNG 2006)}, year = 2006, pages = {664--668}, ISBN = {0-7695-2497-4}, abstract = {In 2003, Zhao, Varadharajan and Mu proposed a mental poker protocol whose security was shown to be flawed in 2004: any player (or any outsider knowing the deck coding) is able to decrypt encrypted cards without knowing the encryption key. In 2005, the first two authors published a repaired version of this TTP-free mental poker protocol. We show here that this second version is also flawed: the first player can find all cleartexts of the final encrypted shuffled deck of cards. Both protocols are similar to Shamir-Rivest-Adleman's mental poker, but they replace an exponential commutative cipher with an ElGamal-like commutative cipher. We conclude that changing the underlying commutative cipher is the reason of their weakness.} } % url = {http://vneumann.etse.urv.es/publications/sci/lncs3928mentalPoker.pdf} % springerlink = {http://www.springerlink.com/content/h13204w8u6751krm/} @inproceedings{Castella-RocaDomingo-FerrerSebe:2006:CARDIS, author = {Jordi Castell{\`a}-Roca and Josep Domingo-Ferrer and Francesc Seb{\'e}}, title = {{A Smart Card-Based Mental Poker System}}, booktitle = {Smart Card Research and Advanced Applications, Proceedings of 7th IFIP WG 8.8/11.2 International Conference (CARDIS 2006)}, editor = {Josep Domingo-Ferrer and Joachim Posegga and Daniel Schreckling}, year = 2006, pages = {48--61}, series = s-LNCS, volume = 3928, publisher = o-SPRINGER, ISSN = {0302-9743}, ISBN = {3-540-33311-8}, abstract = {On-line casinos have experienced a great expansion since the generalized use of Internet started. There exist in the literature several proposals of systems allowing secure remote gaming. Nevertheless, the security requirements of some game families lead to the use of complex and costly cryptographic protocols. A particularly challenging game family is mental poker. In this paper we present a smart card-based e-gaming system for mental poker with a low computational cost.}, keywords = {smart cards and applications in the Internet, cryptographic protocols for smart cards, e-gambling, Mental Poker} } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 2005 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % filename = {WEWoRC2005_proc.pdf} % url = {http://www.theory.informatik.uni-kassel.de/~stamer/} @inproceedings{Stamer:2005:WEWoRC, author = {Heiko Stamer}, title = {{Efficient Electronic Gambling: An Extended Implementation of the Toolbox for Mental Card Games}}, booktitle = {Proceedings of the 1st Western European Workshop on Research in Cryptology (WEWoRC 2005)}, editor = {Christopher Wolf and Stefan Lucks and Po-Wah Yau}, year = 2005, pages = {1--12}, series = s-LNI, volume = {P-74}, publisher = o-GI, ISSN = {1617-5468}, ISBN = {3-88579-403-9}, abstract = {There are many wonderful protocols in cryptography which are still waiting for their realization. Here we consider efficient solutions for secure electronic card games. Our contribution seems to be the first known practical implementation that requires no trusted third-party and simultaneously keeps the players' strategies confidential. The provided open source library LibTMCG can be used for creating secure peer-to-peer games and furthermore for some unusual applications, e.g., secure multi-party computation or simple electronic voting schemes.}, keywords = {e-gambling, mental poker, secure electronic card games, verifiable secret shuffle, secure multi-party computation, zero-knowledge proofs} } % filename = {jcr1de1.pdf} % url = {http://www.tesisenxarxa.net/TDX-0131106-193157/} @phdthesis{Castella-Roca:2005, author = {Jordi Castell{\`a}-Roca}, title = {{Contributions to Mental Poker}}, school = {Universitat Aut{\`o}noma de Barcelona}, year = 2005, ISBN = {84-689-6233-3}, abstract = {Computer networks and especially the Internet have allowed some common activities such as shopping or gambling to become remote (e-shopping and e-gambling). The poker game played over a network is known as mental poker. The problem with mental poker is the difficulty of keeping it practical while guaranteeing the same standards of security, fairness and auditability offered by standard casinos for physical poker. The important aspects to take into account when designing mental poker protocols are: functionality, security, and computational and communication cost. Proposals in the literature usually focus on the first two items only. This makes comparisons difficult. This thesis starts with a formal cost analysis of the main proposals in the literature. The analysis is not limited to costs, though; security is also analyzed and, in fact, our study detected a fundamental weakness in one of the compared mental poker protocols. The attack is presented in a separate chapter after the global comparative analysis. The three following chapters of this thesis present three new protocols that enhance the proposals in the literature in different ways. The first proposal belongs to the family of TTP-free protocols and does not preserve the confidentiality of player strategies; it reduces the computational cost by avoiding the use of zeroknowledge proofs. The second proposal is TTP-free, preserves the confidentiality of player strategies and reduces the computational cost by requiring players to perform less mathematical operations. The third proposal addresses a novel functionality usually not offered in the literature, namely player dropout tolerance, i.e. the ability to continue the game even if some players leave it.}, keywords = {Mental Poker, Multiparty computation, Cryptography} } @inproceedings{ZhaoVaradharajan:2005:ITCC, author = {Weiliang Zhao and Vijay Varadharajan}, title = {{Efficient TTP-Free Mental Poker Protocols}}, booktitle = {Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC '05)}, pages = {745--750}, volume = 1, year = 2005, publisher = o-IEEE, ISBN = {0-7695-2315-3}, abstract = {Zhao et. al proposed an efficient mental poker protocol which did not require using a trusted third party (TTP). The protocol is efficient and suitable for any number of players but it introduces a security flaw. In this paper, we propose two mental poker protocols based on Zhao's previous work. The security flaw has been removed and the additional computing cost is small.} } % url = {http://www.parc.xerox.com/research/publications/details.php?id=5354} @inproceedings{Golle:2005:ITCC, author = {Philippe Golle}, title = {{Dealing Cards in Poker Games}}, booktitle = {Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC '05)}, pages = {506--511}, volume = 1, year = 2005, publisher = o-IEEE, ISBN = {0-7695-2315-3}, abstract = {This paper proposes a new protocol for shuffling and dealing cards, that is designed specifically for games of mental poker. Our protocol takes advantage of two features of poker games that are overlooked by generic card-shuffling protocols: 1) cards in poker games are dealt in rounds, with betting in-between, rather than all at once and 2) the total number of cards dealt in a game of poker is small (it depends on the number of players but is typically less than half the deck). With these observations in mind, we propose a protocol that spreads the computational cost of dealing cards more evenly across rounds. Compared to protocols that shuffle the whole deck upfront, our approach offers a dramatic decrease in latency and overall computational cost. Our protocol is fair, private and robust. It is ideally suited for resource-constrained devices such as PDAs.}, keywords = {shuffle, Mental Poker, mix, latency, ElGamal} } % file= {lncs3592dropout.pdf} % springerlink = {http://www.springerlink.com/content/a5ca1ugg34kmfrhb/} @inproceedings{Castella-RocaDomingo-FerrerSebe:2005, author = {Jordi Castell{\`a}-Roca and Francesc Seb{\'e} and Josep Domingo-Ferrer}, title = {{Dropout-Tolerant TTP-Free Mental Poker}}, booktitle = {Trust, Privacy, and Security in Digital Business, Proceedings of the Second International Conference TrustBus 2005}, editor = {Sokratis Katsikas and Javier L{\'o}pez and G{\"u}nther Pernul}, year = 2005, pages = {30--40}, series = s-LNCS, volume = 3592, publisher = o-SPRINGER, ISSN = {0302-9743}, ISBN = {3-540-28224-2}, abstract = {There is a broad literature on distributed card games over communications networks, collectively known as mental poker. Like in any distributed protocol, avoiding the need for a Trusted Third Party (TTP) in mental poker is highly desirable, because really trusted TTPs are not always available and seldom free. This paper deals with the player dropout problem in mental poker without a TTP. A solution based on zero-knowledge proofs is proposed. While staying TTP-free, our proposal allows the game to continue after player dropout.}, keywords = {Mental Poker, player dropout} } % url = {http://www.cs.chalmers.se/~andrei/askarov-sabelfeld-esorics05.pdf} % springerlink = {http://www.springerlink.com/content/5clup4c2332rw06g/} @inproceedings{AskarovSabelfeld:2005:ESORICS, author = {Aslan Askarov and Andrei Sabelfeld}, title = {{Security-Typed Languages for Implementation of Cryptographic Protocols: A Case Study}}, booktitle = {Computer Security - ESORICS 2005, Proceedings of the 10th European Symposium on Research in Computer Security}, editor = {Sabrina De Capitani di Vimercati and Paul F. Syverson and Dieter Gollmann}, year = 2005, pages = {197--221}, series = s-LNCS, volume = 3679, publisher = o-SPRINGER, ISSN = {0302-9743}, ISBN = {3-540-28963-0}, abstract = {Security protocols are critical for protecting modern communication infrastructures and are therefore subject to thorough analysis. However practical implementations of these protocols lack the same level of attention and thus may be more exposed to attacks. This paper discusses security assurance provided by security-typed languages when implementing cryptographic protocols. Our results are based on a case study using Jif, a Java-based security-typed language, for implementing a non-trivial cryptographic protocol that allows playing online poker without a trusted third party. The case study deploys the largest program written in a security-typed language to date and identifies insights ranging from security guarantees to useful patterns of secure programming.} } % url = {http://www.cs.chalmers.se/~aaskarov/jifpoker/report.pdf} @misc{AskarovSabelfeld:2005, author = {Aslan Askarov and Andrei Sabelfeld}, title = {{Security-Typed Languages for Implementation of Cryptographic Protocols: A Case Study of Mutual Distrust}}, howpublished = {Technical Report 2005-13, Department of Computer Science and Engineering, Chalmers University of Technology and G{\"o}eborg University}, year = 2005 } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 2004 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % url = {http://ieeexplore.ieee.org/iel5/9035/28683/01286753.pdf} @inproceedings{Castella-RocaDomingo-Ferrer:2004:ITCC, author = {Jordi Castell{\`a}-Roca and Josep Domingo-Ferrer}, title = {{On the Security of an Efficient TTP-Free Mental Poker Protocol}}, booktitle = {Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC '04)}, pages = {781--784}, volume = 2, year = 2004, publisher = o-IEEE, ISBN = {0-7695-2108-8}, abstract = {Using commutative cryptosystems is a way to obtain efficient mental poker protocols which do not require using a trusted third party (TTP). However, the security of such protocols depends on the particular cryptosystem used. We show that a TTP-free mental poker protocol using an ElGamal-like commutative cryptosystem is insecure.} } % filename = {cse207project.pdf} % url = {http://www.cs.ucsd.edu/~aauyoung/projects/} @misc{AuYoungTuttle:2004, author = {Alvin AuYoung and Christopher Tuttle}, title = {{Cryptographic Blackjack}}, howpublished = {Final Project Report CSE~207, University of California at San Diego}, year = 2004, abstract = {Internet casinos have become a billion dollar industry. The increasing popularity of online gaming is surprising given its weak guarantees of fairness compared to those offered by physical casinos. We apply a bit commitment protocol to an online blackjack game that provides strong fairness guarantees between the player and casino without compromising the play of the game. We introduce a set of experiments that capture the fairness guarantees of the protocol, and describe how this protocol can be extended to other online games.} } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 2003 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % springerlink = {http://www.springerlink.com/content/60wlhhucha0j375b/} @inproceedings{BarnettSmart:2003:IMA, author = {Adam Barnett and Nigel P. Smart}, title = {{Mental Poker Revisited}}, booktitle = {Cryptography and Coding, Proceedings of the 9th IMA International Conference}, editor = {Kenneth G. Paterson}, year = 2003, pages = {370--383}, series = s-LNCS, volume = 2898, publisher = o-SPRINGER, ISSN = {0302-9743}, ISBN = {3-540-20663-7}, abstract = {We discuss how to implement a secure card game without the need for a trusted dealer, a problem often denoted ``Mental Poker'' in the literature. Our solution requires a broadcast channel between all players and the number of bits needed to represent each card is independent of the number of players. Traditional solutions to ``Mental Poker'' require a linear relation between the number of players and the number of bits required to represent each card.} } % url = {http://citeseer.ist.psu.edu/castella-roca03practical.html} % springerlink = {http://www.springerlink.com/content/gywkyxn74eqymv12/} @inproceedings{Castella-RocaDomingo-FerrerRieraBorrell:2003:INDOCRYPT, author = {Jordi Castell{\`a}-Roca and Josep Domingo-Ferrer and Andreu Riera and Joan Borrell}, title = {{Practical Mental Poker Without a TTP Based on Homomorphic Encryption}}, booktitle = {Progress in Cryptology - INDOCRYPT 2003}, editor = {Thomas Johansson and Subhamoy Maitra}, year = 2003, pages = {280--294}, series = s-LNCS, volume = 2904, publisher = o-SPRINGER, ISSN = {0302-9743}, ISBN = {3-540-20609-5}, abstract = {A solution for obtaining impartial random values in on-line gambling is presented in this paper. Unlike most previous proposals, our method does not require any TTP and allows e-gambling to reach standards of fairness, security an auditability similar to those common in physical gambling. Although our solution is detailed here for the particular case of games with reversed cards (e.g. poker), it can be easily adapted for games with open cards (e.g. blackjack) and for random draw games (e.g. keno). Thanks to the use of permutations of homomorphically encrypted cards, the protocols described have moderate computational requirements.}, keywords = {Mental poker, e-gambling, privacy homomorphisms} } % url = {http://crpit.com/confpapers/CRPITV21AZhao.pdf} % url = {http://citeseer.ist.psu.edu/592840.html} @inproceedings{ZhaoVaradharajanMu:2003, author = {Weiliang Zhao and Vijay Varadharajan and Yi Mu}, title = {{A Secure Mental Poker Protocol Over The Internet}}, booktitle = {ACSW Frontiers 2003, Proceedings of the Australasian Information Security Workshop}, editor = {Chris Johnson and Paul Montague and Chris Steketee}, pages = {105--109}, series = s-CRPIT, volume = 21, year = 2003, publisher = o-ACS, ISSN = {1445-1336}, ISBN = {1-920682-00-7}, abstract = {An effcient and secure mental poker scheme is proposed in this paper. It is based on multiple encryption and decryption of individual cards. The protocol satisfies all major security requirements of a real mental poker. It gets rid of the Card Salesman and guarantees minimal effect due to collusion of players. The protocol is secure and more effcient compared with other known protocols. The strategies of players can be kept confidential with the introduction of a Dealer. The protocol is suitable to be implemented in an on-line card game.}, keywords = {Mental Poker, Applied Cryptography, Online Gambling} } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 2002 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % springerlink = {http://www.springerlink.com/content/v2gurbu7mght6vrb/} @inproceedings{SooSamsudinGoh:2002, author = {Wai Han Soo and Azman Samsudin and Alwyn Goh}, title = {{Efficient Mental Card Shuffling via Optimised Arbitrary-Sized Benes Permutation Network}}, booktitle = {Information Security, Proceedings of the 5th International Conference (ISC 2002)}, editor = {Agnes Hui Chan and Virgil Gligor}, year = 2002, pages = {446--458}, series = s-LNCS, volume = 2433, publisher = o-SPRINGER, ISSN = {0302-9743}, ISBN = {978-3-540-44270-7}, 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 $h$ 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.}, keywords = {shuffle, mental card game, mix-net, Benes permutation network} } @article{ChouYeh:2002, author = {Jue-Sam Chou and Yi-Shiung Yeh}, title = {{Mental Poker Game based on a Bit Commitment Scheme through Network}}, journal = {International Journal of Computer and Telecommunications Networking}, volume = 38, number = 2, year = 2002, ISSN = {1389-1286}, pages = {247--255}, doi = {http://dx.doi.org/10.1016/S1389-1286(01)00264-X}, publisher = {Elsevier}, abstract = {There are many schemes proposed on mental poker so far. Most of them are based on the composition of each player's private permutation of cards. Yet, each one is either too complex or has some drawbacks in it. In other words, no solution has come to reality. In this paper, we propose a permutation-free method, i.e. a bit commitment scheme, along with the RSA cryptosystem (Cryptography-Theory and Practice, CRC Press, Boca Raton, 1995; Public-key Cryptography, Springer, Berlin, 1996) to implement the mental poker game. It is not only simple but also concise in concept.} } @misc{Pinna:2002, author = {Michael Pinna}, title = {{A Secure Card Game}}, howpublished = {BA Thesis, Gonwille \& Caius College, University of Cambridge}, year = 2002 } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 2001 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 2000 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=836542} @article{HarnLinGong:2000, author = {L. Harn and H.-Y. Lin and G. Gong}, title = {{Bounded-to-Unbounded Poker Game}}, journal = {Electronics Letters}, volume = 36, number = 3, year = 2000, pages = {214--215}, publisher = o-IEEE, ISSN = {0013-5149}, abstract = {The bounded-to-unbounded poker game is a fair poker game that can be played over the Internet. It allows both dealer and player to distribute cards in a fair and secure manner. In addition, the presented protocol assumes that the player is computationally bounded: however, the dealer is computationally unbounded.} } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1999 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1998 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % filename = {A9814.ps} % url = {http://citeseer.nj.nec.com/schindelhauer98toolbox.html} @misc{Schindelhauer:1998, author = {Christian Schindelhauer}, title = {{A Toolbox for Mental Card Games}}, howpublished = {Technical Report A-98-14, Medizinische Universit{\"a}t L{\"u}beck}, year = 1998, abstract = {Mental card games are played without a trusted party and without cards. It is well known that the problem of mental card games can be solved in principle. But the schemes known so far are too messy to be used in practice. Only for the mental poker game a suitable solution is known [Cr{\'e}p 87] that achieves security against player coalition and complete confidentiality of a player's strategy. Here, we present a general-purpose scheme that may be used as basic toolbox for straight-forward implementations of card games. We present a data structure for cards and decks that is secure against player coalitions and enables standard operations like picking up a card, opening it, and (re-)mixing stacks. Furthermore, we introduce tools for special operations like inserting a card into the deck, splitting the deck, parting the game. The correctness of all operations is testified by zero-knowledge proofs. Finally, we discuss security problems that are typical for mental card games and suggest solutions to enable all players maximum possible fairness.} } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1997 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % filename = {CardGame.ps} % url = {http://search.ieice.org/bin/summary.php?id=e80-a_1_72&category=A&year=1997&lang=E} % url = {http://citeseer.ist.psu.edu/kurosawa97reshufflable.html} @article{KurosawaKatayamaOgata:1997, author = {Kaoru Kurosawa and Yutaka Katayama and Wakaha Ogata}, title = {{Reshufflable and Laziness Tolerant Mental Card Game Protocol}}, journal = {IEICE Transactions Fundamentals}, volume = {E80-A}, number = 1, pages = {72--78}, year = 1997, ISSN = {0916-8508}, abstract = {This paper presents a reshufflable and laziness tolerant mental card game protocol. First, our protocol can reshuffle any subset of cards. For example, some opened cards and some face down cards can be shuffled together. Next, we consider two types of honest players, currently active and currently nonactive. A player is currently nonactive if he dropped out the game or he declared "pass" and has not declared "rejoin" yet. In the proposed protocol, if more than half of the players are currently active, they can play the game. In this case, the privacy of the currently nonactive players are kept secret.} } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1996 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1995 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1994 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @mastersthesis{Edwards:1994, author = {Jonathan Edwards}, title = {{Implementing Electronic Poker: A Practical Exercise in Zero-Knowledge Interactive Proofs}}, school = {Department of Computer Science, University of Kentucky}, year = 1994 } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1993 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % url = {http://www.cs.rutgers.edu/~jkilian/collected-papers/CrKi93.pdf} % springerlink = {http://www.springerlink.com/content/1en8f3eywfwbu7gp/} @inproceedings{CrepeauKilian:1993:CRYPTO, author = {Claude Cr{\'e}peau and Joe Kilian}, title = {{Discreet Solitary Games}}, booktitle = {Advances in Cryptology - CRYPTO '93, Proceedings of the 13th Annual International Cryptology Conference}, editor = {Douglas R. Stinson}, series = s-LNCS, volume = 773, pages = {319--330}, year = 1993, publisher = o-SPRINGER, ISBN = {3-540-57766-1}, ISSN = {0302-9743}, abstract = {Cryptographic techniques have been used intensively in the past to show how to play multiparty games in an adversarial scenario. We now investigate the cryptographic power of a deck of cards in a solitary scenario. In particular, we show how a person can select a random permutation satisfying a certain criterion discreetly (without knowing which one was picked) using a simple deck of cards. We also show how it is possible using cards to play games of partial information such as POKER, BRIDGE and other cards games in solitary.} } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1992 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1991 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1990 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % springerlink = {http://www.springerlink.com/content/jy9pjypdadnl2v5y} @inproceedings{KurosawaKatayamaOgataTsujii:1990:EUROCRYPT, author = {Kaoru Kurosawa and Yutaka Katayama and Wakaha Ogata and Shigeo Tsujii}, title = {{General Public Key Residue Cryptosystem and Mental Poker Protocols}}, booktitle = {Advances in Cryptology - EUROCRYPT '90, Proceedings of the Workshop on the Theory and Application of of Cryptographic Techniques}, editor = {Ivan B. Damg{\aa}rd}, series = s-LNCS, volume = 473, pages = {374--388}, year = 1990, publisher = o-SPRINGER, ISBN = {3-540-53587-X}, ISSN = {0302-9743}, abstract = {This paper presents a general method how to construct public key cryptosystems based on the $r$-th residue problem. Based on the proposed method, we present the first mental poker protocol which can shuffle any set of cards. Its fault tolerant version is given, too. An efficient zero knowledge interactive proof system for quadratic non-residuosity is also shown.} } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1989 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1988 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1987 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % url = {http://portal.acm.org/citation.cfm?id=28420} @inproceedings{GoldreichMicaliWigderson:1987:STOC, author = {Oded Goldreich and Silvio Micali and Avi Wigderson}, title = {{How to play ANY mental game}}, booktitle = {Proceedings of the 19th Annual ACM Conference on Theory of Computing (STOC '87)}, year = 1987, ISBN = {0-89791-221-7}, pages = {218--229}, publisher = o-ACM, abstract = {We present a polynomial-time algorithm that, given as a input the description of a game with incomplete information and any number of players, produces a protocol for playing the game that leaks no partial information, provided the majority of the players is honest. Our algorithm automatically solves all the multi-party protocol problems addressed in complexity-based cryptography during the last 10 years. It actually is a completeness theorem for the class of distributed protocols with honest majority. Such completeness theorem is optimal in the sense that, if the majority of the players is not honest, some protocol problems have no efficient solution.} } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1986 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % url = {http://citeseer.ist.psu.edu/crepeau86zeroknowledge.html} % springerlink = {http://www.springerlink.com/content/9x0k51kdu6jq4x8w/} @inproceedings{Crepeau:1986:CRYPTO, author = {Claude Cr{\'e}peau}, title = {{A Zero-Knowledge Poker Protocol that Achieves Confidentiality of the Players' Strategy or How to Achieve an Electronic Poker Face}}, booktitle = {Advances in Cryptology - CRYPTO '86: Proceedings}, editor = {Andrew M. Odlyzko}, year = 1986, pages = {239--247}, series = s-LNCS, volume = 263, publisher = o-SPRINGER, ISSN = {0302-9743}, ISBN = {3-540-18047-8}, abstract = {Many attempts have been previously made to achieve a protocol that would allow people to play mental poker [SRA, GM1, BF, FM, Yu, Cr] (I would rather say electronic poker). Unfortunately no solution has ever come close to reality with respect to poker strategy. Poker players usually claim that luck has nothing to do with their gains. In fact, poker is a very strategic game. Often, an inexperienced player will loose a lot of money when playing against an experienced player, only because the former cannot hide so easily his emotions. The experienced player can easily know whether his opponent has a good hand or not. Electronic poker is an ideal way of hiding one's emotions. But, in fact, every protocol proposed thus far ruins this perfect poker face since their security is based on the fact that all hands are revealed at the end of the game. This means that the strategy of the players is known to all his opponents. In particular, if one bluffs with a bad hand in the hope that all his opponents will give up, he still has to reveal his hand at the end, in order to participate in the verification part of the protocol. Moreover, when a player opens his hand, he does not want his opponents to learn the moment at which each of his cards was drawn, since this would give them some information about his strategy. This paper proposes a new poker protocol that allows players to keep secret their strategy. This protocol is an extension of the one given by Cr{\'e}peau in [Cr]. The security will not be based on the knowledge of the entire deck of card at the end of the game, but rather on some independent information linked to the entries of the deck. This protocol achieves every constraints of a real poker game. It is the first complete solution to the mental poker problem. It achieves all the necessary conditions suggested in [Cr]: Uniqueness of cards Uniform random distribution of cards Absence of trusted third party Cheating detection with a very high probability Complete confidentiality of cards Min imal effect of coalitions Complete confidentiality of strategy.} } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1985 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % url = {http://citeseer.ist.psu.edu/crepeau86secure.html} % springerlink = {http://www.springerlink.com/content/8x766710v1488387/} @inproceedings{Crepeau:1985:CRYPTO, author = {Claude Cr{\'e}peau}, title = {{A Secure Poker Protocol that Minimizes the Effect of Player Coalitions}}, booktitle = {Advances in Cryptology - CRYPTO '85: Proceedings}, editor = {Hugh C. Williams}, year = 1985, pages = {73--86}, series = s-LNCS, volume = 218, publisher = o-SPRINGER, ISSN = {0302-9743}, ISBN = {3-540-16463-4}, abstract = {What can we expect from a poker protocol? How close to reality can we come? From the outset of this research, we realized that a cryptographic protocol could achieve more security than its real life counterpart (with physical cards). But every protocol proposed until now was far from offering all the possibilities of a real deck of cards or could not acheive the full security we were expecting.} } % springerlink = {http://www.springerlink.com/content/fu331k2m57g6n727/} @inproceedings{Coppersmith:1985:CRYPTO, author = {Don Coppersmith}, title = {{Cheating at Mental Poker}}, booktitle = {Advances in Cryptology - CRYPTO '85: Proceedings}, editor = {Hugh C. Williams}, year = 1985, pages = {104--107}, series = s-LNCS, volume = 218, publisher = o-SPRINGER, ISSN = {0302-9743}, ISBN = {3-540-16463-4}, abstract = {We review the ``mental poker'' scheme described by Shamir, Rivest and Adleman [SRA]. We present two possible means of cheating, depending on careless implementation of the SRA scheme. One will work if the prime $p$ is such that $p - 1$ has a small prime divisor. In the other scheme, the names of the cards ``TWO OF CLUBS'' have been extended by random-looking bits, chosen by the cheater.} } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1984 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % springerlink = {http://www.springerlink.com/content/0m3lu422qj62v4kp/} @inproceedings{Yung:1984:CRYPTO, author = {Mordechai Yung}, title = {{Cryptoprotocols: Subscription to a Public Key, the Secret Blocking and the Multi-Player Mental Poker Game}}, booktitle = {Advances in Cryptology: Proceedings of CRYPTO '84}, editor = {G.R. Blakley and David Chaum}, year = 1984, pages = {439--453}, series = s-LNCS, volume = 196, publisher = o-SPRINGER, ISSN = {0302-9743}, ISBN = {3-540-15658-5}, abstract = {Investigating the capabilities of public key and related cryptographic techniques has recently become an important area of cryptographic research. In this paper we present some new algorithms and cryptographic protocols (Cryptoprotocols) which enlarge the range of applications of public key systems and enable us to perform certain transactions in communication networks. The basic cryptographic tools used are Rabin's Oblivious Transfer Protocol and an algorithm we developed for Number Embedding which is provably hard to invert. We introduce the protocol ``Subscription to a Public Key'', which gives a way to transfer keys over insecure communication channels and has useful applications to cryptosystems. We develop the ``Secret Blocking Protocol'', specified as follows: `A transfers a secret to B, B can block the message. If B does not block it, there is a probability $P$ that he might get it. ($1/2 P \le 1$, where we can control the size of $P$). A does not know if the message was blocked (but he can find out later)'. The classic cryptotransaction is the ``Mental Poker Game''. A cryptographically secure solution to the ``Multi Player Mental Poker Game'' is given. The approach used in constructing the solution provides a general methodology of provable and modular ``Protocol Composition''.} } @inproceedings{FortuneMerritt:1984:CRYPTO, author = {Steven Fortune and Michael Merritt}, title = {{Poker Protocols}}, booktitle = {Advances in Cryptology: Proceedings of CRYPTO '84}, editor = {G.R. Blakley and David Chaum}, year = 1984, pages = {454--466}, series = s-LNCS, volume = 196, publisher = o-SPRINGER, ISSN = {0302-9743}, ISBN = {3-540-15658-5}, abstract = {The situation is quite serious. After four years of research, there has been no satisfactory way for a group of card sharks to play poker over the phone. Until now. In this paper, we present a new method for playing `mental poker,' discuss its significance, and mention some of the further questions it raises. Ante up. The rules for mental poker are just like regular poker, except that players communicate over the phone, and there are no physical cards. The hard part of mental poker is dealing the cards. Hands must be random and disjoint, and players should not be able to claim to have any cards but those dealt (a sleeve will hold as many `virtual cards' as angels will fit on the head of a pin). Playing mental poker is a difficult problem for a number of reasons. The foremost reason is that it is impossible, a result due to Shamir, Rivest and Adleman. Of course, this is an information-theoretic result, and the same reference presents a method for playing mental poker that relies on the difficulty of inverting certain cryptographic transformations. Unfortunately, a cryptographic flaw allows players to determine the color of each other's cards. This set the stage for a new implementation devised by Goldwasser and Micali, which was proven to hide all partial information (up to an explicit cryptographic assumption). Unfortunately, this implementation works only for two players, which is a very restricted kind of poker. Next, Barany and Furedi devised a protocol that permits three or more players to play poker, but only if players are not permitted to form coalitions. If two players conspire, they can learn the contents of everyone else's hands. The following section discusses this history of mental poker in more detail, outlining the key ideas, contributions and limitations of this earlier work. This paper presents a new way of playing mental poker. Unlike earlier solutions, it is secure against coalitions, permits any number of players, and uses inexpensive, highly secure cryptographic techniques. The protocol does require the participation of a trusted party to shuffle the cards. However, thereafter the trusted party does not participate in the protocol. The protocol can be easily adapted to play almost all types of poker known to the authors. Of course, poker is a metaphor for any system in which users should have only partial information about the dynamic allocation of resources. Beyond this, the poker protocol presented here takes on a broader significance because of the simple tools used in its implementation.} } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1983 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % url = {http://portal.acm.org/citation.cfm?id=1603} @article{BaranyFuredi:1983, author = {Imre B{\'a}r{\'a}ny and Zlot{\'a}n F{\"u}redi}, title = {{Mental Poker with Three or More Players}}, journal = {Information and Control}, volume = 59, number = {1--3}, pages = {84--93}, year = 1983, publisher = o-ACADEMIC, ISSN = {0019-9958}, abstract = {} } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1982 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % filename = {} % url = {http://portal.acm.org/citation.cfm?id=802212} @inproceedings{GoldwasserMicali:1982:STOC, author = {Shafi Goldwasser and Silvio Micali}, title = {{Probabilistic Encryption \& How To Play Mental Poker Keeping Secret All Partial Information}}, booktitle = {Proceedings of the 14th Annual ACM Symposium on Theory of Computing (STOC '82)}, editor = {}, pages = {365--377}, year = 1982, publisher = o-ACM, ISBN = {0-89791-070-3}, abstract = {This paper proposes an Encryption Scheme that possess the following property: An adversary, who knows the encryption algorithm and is given the cyphertext, cannot obtain any information about the clear-text. Any implementation of a Public Key Cryptosystem, as proposed by Diffie and Hellman in [8], should possess this property. Our Encryption Scheme follows the ideas in the number theoretic implementations of a Public Key Cryptosystem due to Rivest, Shamir and Adleman [13], and Rabin [12].} } @mastersthesis{Yung:1982, author = {Mordechai Yung}, title = {{K-Player Mental Poker}}, school = {Tel-Aviv University}, year = 1982 } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1981 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @article{ShamirRivestAdleman:1981, author = {Adi Shamir and Ronald L. Rivest and Leonard M. Adleman}, title = {{Mental Poker}}, journal = {The Mathematical Gardner}, pages = {37--43}, year = 1981, publisher = {Prindle, Weber \& Schmidt, Boston}, abstract = {Can two potentially dishonest players play a fair game of poker without using any cards---for example, over the phone? This paper provides the following answers: No. (Rigorous mathematical proof supplied.) Yes. (Correct and complete protocol given.)} } @misc{Lipton:1981, author = {Richard J. Lipton}, title = {{How to Cheat at Mental Poker}}, howpublished = {Proceedings of the AMS Short Course on Cryptology}, year = 1981 } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1980 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% 1979 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% @misc{Lipton:1979, author = {Richard J. Lipton}, title = {{How to Cheat at Mental Poker}}, howpublished = {Technical Report, Computer Science Department, Berkeley University}, year = 1979 } @misc{ShamirRivestAdleman:1979, author = {Adi Shamir and Ronald L. Rivest and Leonard M. Adleman}, title = {{Mental Poker}}, howpublished = {Technical Report MIT-LCS-TM-125, Massachusetts Institute of Technology}, year = 1979, abstract = {Is it possible to play a fair game of 'Mental Poker'. We will give a complete (but paradoxical) answer to this question. We will first prove that the problem is intrinsically insoluble, and then describe a fair method of playing 'Mental Poker'.} } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% GFDL %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% %% GNU Free Documentation License %% ------------------------------ %% %% GNU Free Documentation License %% Version 1.2, November 2002 %% %% %% Copyright (C) 2000,2001,2002 Free Software Foundation, Inc. %% 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA %% Everyone is permitted to copy and distribute verbatim copies %% of this license document, but changing it is not allowed. %% %% %% 0. PREAMBLE %% %% The purpose of this License is to make a manual, textbook, or other %% functional and useful document "free" in the sense of freedom: to %% assure everyone the effective freedom to copy and redistribute it, %% with or without modifying it, either commercially or noncommercially. %% Secondarily, this License preserves for the author and publisher a way %% to get credit for their work, while not being considered responsible %% for modifications made by others. %% %% This License is a kind of "copyleft", which means that derivative %% works of the document must themselves be free in the same sense. It %% complements the GNU General Public License, which is a copyleft %% license designed for free software. %% %% We have designed this License in order to use it for manuals for free %% software, because free software needs free documentation: a free %% program should come with manuals providing the same freedoms that the %% software does. But this License is not limited to software manuals; %% it can be used for any textual work, regardless of subject matter or %% whether it is published as a printed book. We recommend this License %% principally for works whose purpose is instruction or reference. %% %% %% 1. APPLICABILITY AND DEFINITIONS %% %% This License applies to any manual or other work, in any medium, that %% contains a notice placed by the copyright holder saying it can be %% distributed under the terms of this License. Such a notice grants a %% world-wide, royalty-free license, unlimited in duration, to use that %% work under the conditions stated herein. The "Document", below, %% refers to any such manual or work. Any member of the public is a %% licensee, and is addressed as "you". You accept the license if you %% copy, modify or distribute the work in a way requiring permission %% under copyright law. %% %% A "Modified Version" of the Document means any work containing the %% Document or a portion of it, either copied verbatim, or with %% modifications and/or translated into another language. %% %% A "Secondary Section" is a named appendix or a front-matter section of %% the Document that deals exclusively with the relationship of the %% publishers or authors of the Document to the Document's overall subject %% (or to related matters) and contains nothing that could fall directly %% within that overall subject. (Thus, if the Document is in part a %% textbook of mathematics, a Secondary Section may not explain any %% mathematics.) The relationship could be a matter of historical %% connection with the subject or with related matters, or of legal, %% commercial, philosophical, ethical or political position regarding %% them. %% %% The "Invariant Sections" are certain Secondary Sections whose titles %% are designated, as being those of Invariant Sections, in the notice %% that says that the Document is released under this License. If a %% section does not fit the above definition of Secondary then it is not %% allowed to be designated as Invariant. The Document may contain zero %% Invariant Sections. If the Document does not identify any Invariant %% Sections then there are none. %% %% The "Cover Texts" are certain short passages of text that are listed, %% as Front-Cover Texts or Back-Cover Texts, in the notice that says that %% the Document is released under this License. A Front-Cover Text may %% be at most 5 words, and a Back-Cover Text may be at most 25 words. %% %% A "Transparent" copy of the Document means a machine-readable copy, %% represented in a format whose specification is available to the %% general public, that is suitable for revising the document %% straightforwardly with generic text editors or (for images composed of %% pixels) generic paint programs or (for drawings) some widely available %% drawing editor, and that is suitable for input to text formatters or %% for automatic translation to a variety of formats suitable for input %% to text formatters. A copy made in an otherwise Transparent file %% format whose markup, or absence of markup, has been arranged to thwart %% or discourage subsequent modification by readers is not Transparent. %% An image format is not Transparent if used for any substantial amount %% of text. A copy that is not "Transparent" is called "Opaque". %% %% Examples of suitable formats for Transparent copies include plain %% ASCII without markup, Texinfo input format, LaTeX input format, SGML %% or XML using a publicly available DTD, and standard-conforming simple %% HTML, PostScript or PDF designed for human modification. Examples of %% transparent image formats include PNG, XCF and JPG. Opaque formats %% include proprietary formats that can be read and edited only by %% proprietary word processors, SGML or XML for which the DTD and/or %% processing tools are not generally available, and the %% machine-generated HTML, PostScript or PDF produced by some word %% processors for output purposes only. %% %% The "Title Page" means, for a printed book, the title page itself, %% plus such following pages as are needed to hold, legibly, the material %% this License requires to appear in the title page. For works in %% formats which do not have any title page as such, "Title Page" means %% the text near the most prominent appearance of the work's title, %% preceding the beginning of the body of the text. %% %% A section "Entitled XYZ" means a named subunit of the Document whose %% title either is precisely XYZ or contains XYZ in parentheses following %% text that translates XYZ in another language. (Here XYZ stands for a %% specific section name mentioned below, such as "Acknowledgements", %% "Dedications", "Endorsements", or "History".) To "Preserve the Title" %% of such a section when you modify the Document means that it remains a %% section "Entitled XYZ" according to this definition. %% %% The Document may include Warranty Disclaimers next to the notice which %% states that this License applies to the Document. These Warranty %% Disclaimers are considered to be included by reference in this %% License, but only as regards disclaiming warranties: any other %% implication that these Warranty Disclaimers may have is void and has %% no effect on the meaning of this License. %% %% %% 2. VERBATIM COPYING %% %% You may copy and distribute the Document in any medium, either %% commercially or noncommercially, provided that this License, the %% copyright notices, and the license notice saying this License applies %% to the Document are reproduced in all copies, and that you add no other %% conditions whatsoever to those of this License. You may not use %% technical measures to obstruct or control the reading or further %% copying of the copies you make or distribute. However, you may accept %% compensation in exchange for copies. If you distribute a large enough %% number of copies you must also follow the conditions in section 3. %% %% You may also lend copies, under the same conditions stated above, and %% you may publicly display copies. %% %% %% 3. COPYING IN QUANTITY %% %% If you publish printed copies (or copies in media that commonly have %% printed covers) of the Document, numbering more than 100, and the %% Document's license notice requires Cover Texts, you must enclose the %% copies in covers that carry, clearly and legibly, all these Cover %% Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on %% the back cover. Both covers must also clearly and legibly identify %% you as the publisher of these copies. The front cover must present %% the full title with all words of the title equally prominent and %% visible. You may add other material on the covers in addition. %% Copying with changes limited to the covers, as long as they preserve %% the title of the Document and satisfy these conditions, can be treated %% as verbatim copying in other respects. %% %% If the required texts for either cover are too voluminous to fit %% legibly, you should put the first ones listed (as many as fit %% reasonably) on the actual cover, and continue the rest onto adjacent %% pages. %% %% If you publish or distribute Opaque copies of the Document numbering %% more than 100, you must either include a machine-readable Transparent %% copy along with each Opaque copy, or state in or with each Opaque copy %% a computer-network location from which the general network-using %% public has access to download using public-standard network protocols %% a complete Transparent copy of the Document, free of added material. %% If you use the latter option, you must take reasonably prudent steps, %% when you begin distribution of Opaque copies in quantity, to ensure %% that this Transparent copy will remain thus accessible at the stated %% location until at least one year after the last time you distribute an %% Opaque copy (directly or through your agents or retailers) of that %% edition to the public. %% %% It is requested, but not required, that you contact the authors of the %% Document well before redistributing any large number of copies, to give %% them a chance to provide you with an updated version of the Document. %% %% %% 4. MODIFICATIONS %% %% You may copy and distribute a Modified Version of the Document under %% the conditions of sections 2 and 3 above, provided that you release %% the Modified Version under precisely this License, with the Modified %% Version filling the role of the Document, thus licensing distribution %% and modification of the Modified Version to whoever possesses a copy %% of it. In addition, you must do these things in the Modified Version: %% %% A. Use in the Title Page (and on the covers, if any) a title distinct %% from that of the Document, and from those of previous versions %% (which should, if there were any, be listed in the History section %% of the Document). You may use the same title as a previous version %% if the original publisher of that version gives permission. %% B. List on the Title Page, as authors, one or more persons or entities %% responsible for authorship of the modifications in the Modified %% Version, together with at least five of the principal authors of the %% Document (all of its principal authors, if it has fewer than five), %% unless they release you from this requirement. %% C. State on the Title page the name of the publisher of the %% Modified Version, as the publisher. %% D. Preserve all the copyright notices of the Document. %% E. Add an appropriate copyright notice for your modifications %% adjacent to the other copyright notices. %% F. Include, immediately after the copyright notices, a license notice %% giving the public permission to use the Modified Version under the %% terms of this License, in the form shown in the Addendum below. %% G. Preserve in that license notice the full lists of Invariant Sections %% and required Cover Texts given in the Document's license notice. %% H. Include an unaltered copy of this License. %% I. Preserve the section Entitled "History", Preserve its Title, and add %% to it an item stating at least the title, year, new authors, and %% publisher of the Modified Version as given on the Title Page. If %% there is no section Entitled "History" in the Document, create one %% stating the title, year, authors, and publisher of the Document as %% given on its Title Page, then add an item describing the Modified %% Version as stated in the previous sentence. %% J. Preserve the network location, if any, given in the Document for %% public access to a Transparent copy of the Document, and likewise %% the network locations given in the Document for previous versions %% it was based on. These may be placed in the "History" section. %% You may omit a network location for a work that was published at %% least four years before the Document itself, or if the original %% publisher of the version it refers to gives permission. %% K. For any section Entitled "Acknowledgements" or "Dedications", %% Preserve the Title of the section, and preserve in the section all %% the substance and tone of each of the contributor acknowledgements %% and/or dedications given therein. %% L. Preserve all the Invariant Sections of the Document, %% unaltered in their text and in their titles. Section numbers %% or the equivalent are not considered part of the section titles. %% M. Delete any section Entitled "Endorsements". Such a section %% may not be included in the Modified Version. %% N. Do not retitle any existing section to be Entitled "Endorsements" %% or to conflict in title with any Invariant Section. %% O. Preserve any Warranty Disclaimers. %% %% If the Modified Version includes new front-matter sections or %% appendices that qualify as Secondary Sections and contain no material %% copied from the Document, you may at your option designate some or all %% of these sections as invariant. To do this, add their titles to the %% list of Invariant Sections in the Modified Version's license notice. %% These titles must be distinct from any other section titles. %% %% You may add a section Entitled "Endorsements", provided it contains %% nothing but endorsements of your Modified Version by various %% parties--for example, statements of peer review or that the text has %% been approved by an organization as the authoritative definition of a %% standard. %% %% You may add a passage of up to five words as a Front-Cover Text, and a %% passage of up to 25 words as a Back-Cover Text, to the end of the list %% of Cover Texts in the Modified Version. Only one passage of %% Front-Cover Text and one of Back-Cover Text may be added by (or %% through arrangements made by) any one entity. If the Document already %% includes a cover text for the same cover, previously added by you or %% by arrangement made by the same entity you are acting on behalf of, %% you may not add another; but you may replace the old one, on explicit %% permission from the previous publisher that added the old one. %% %% The author(s) and publisher(s) of the Document do not by this License %% give permission to use their names for publicity for or to assert or %% imply endorsement of any Modified Version. %% %% %% 5. COMBINING DOCUMENTS %% %% You may combine the Document with other documents released under this %% License, under the terms defined in section 4 above for modified %% versions, provided that you include in the combination all of the %% Invariant Sections of all of the original documents, unmodified, and %% list them all as Invariant Sections of your combined work in its %% license notice, and that you preserve all their Warranty Disclaimers. %% %% The combined work need only contain one copy of this License, and %% multiple identical Invariant Sections may be replaced with a single %% copy. If there are multiple Invariant Sections with the same name but %% different contents, make the title of each such section unique by %% adding at the end of it, in parentheses, the name of the original %% author or publisher of that section if known, or else a unique number. %% Make the same adjustment to the section titles in the list of %% Invariant Sections in the license notice of the combined work. %% %% In the combination, you must combine any sections Entitled "History" %% in the various original documents, forming one section Entitled %% "History"; likewise combine any sections Entitled "Acknowledgements", %% and any sections Entitled "Dedications". You must delete all sections %% Entitled "Endorsements". %% %% %% 6. COLLECTIONS OF DOCUMENTS %% %% You may make a collection consisting of the Document and other documents %% released under this License, and replace the individual copies of this %% License in the various documents with a single copy that is included in %% the collection, provided that you follow the rules of this License for %% verbatim copying of each of the documents in all other respects. %% %% You may extract a single document from such a collection, and distribute %% it individually under this License, provided you insert a copy of this %% License into the extracted document, and follow this License in all %% other respects regarding verbatim copying of that document. %% %% %% 7. AGGREGATION WITH INDEPENDENT WORKS %% %% A compilation of the Document or its derivatives with other separate %% and independent documents or works, in or on a volume of a storage or %% distribution medium, is called an "aggregate" if the copyright %% resulting from the compilation is not used to limit the legal rights %% of the compilation's users beyond what the individual worksform. %% Otherwise they must appear on printed covers that bracket the whole %% aggregate. %% %% %% 8. TRANSLATION %% %% Translation is considered a kind of modification, so you may %% distribute translations of the Document under the terms of section 4. %% Replacing Invariant Sections with translations requires special %% permission from their copyright holders, but you may include %% translations of some or all Invariant Sections in addition to the %% original versions of these Invariant Sections. You may include a %% translation of this License, and all the license notices in the %% Document, and any Warranty Disclaimers, provided that you also include %% the original English version of this License and the original versions %% of those notices and disclaimers. In case of a disagreement between %% the translation and the original version of this License or a notice %% or disclaimer, the original version will prevail. %% %% If a section in the Document is Entitled "Acknowledgements", %% "Dedications", or "History", the requirement (section 4) to Preserve %% its Title (section 1) will typically require changing the actual %% title. %% %% %% 9. TERMINATION %% %% You may not copy, modify, sublicense, or distribute the Document except %% as expressly provided for under this License. Any other attempt to %% copy, modify, sublicense or distribute the Document is void, and will %% automatically terminate your rights under this License. However, %% parties who have received copies, or rights, from you under this %% License will not have their licenses terminated so long as such %% parties remain in full compliance. %% %% %% 10. FUTURE REVISIONS OF THIS LICENSE %% %% The Free Software Foundation may publish new, revised versions %% of the GNU Free Documentation License from time to time. Such new %% versions will be similar in spirit to the present version, but may %% differ in detail to address new problems or concerns. See %% http://www.gnu.org/copyleft/. %% %% Each version of the License is given a distinguishing version number. %% If the Document specifies that a particular numbered version of this %% License "or any later version" applies to it, you have the option of %% following the terms and conditions either of that specified version or %% of any later version that has been published (not as a draft) by the %% Free Software Foundation. If the Document does not specify a version %% number of this License, you may choose any version ever published (not %% as a draft) by the Free Software Foundation. %% %% %% ADDENDUM: How to use this License for your documents %% %% To use this License in a document you have written, include a copy of %% the License in the document and put the following copyright and %% license notices just after the title page: %% %% Copyright (c) YEAR YOUR NAME. %% Permission is granted to copy, distribute and/or modify this document %% under the terms of the GNU Free Documentation License, Version 1.2 %% or any later version published by the Free Software Foundation; %% with no Invariant Sections, no Front-Cover Texts, and no Back-Cover %% Texts. A copy of the license is included in the section entitled %% "GNU Free Documentation License". %% %% If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts, %% replace the "with...Texts." line with this: %% %% with the Invariant Sections being LIST THEIR TITLES, with the %% Front-Cover Texts being LIST, and with the Back-Cover Texts being LIST. %% %% If you have Invariant Sections without Cover Texts, or some other %% combination of the three, merge those two alternatives to suit the %% situation. %% %% If your document contains nontrivial examples of program code, we %% recommend releasing these examples in parallel under your choice of %% free software license, such as the GNU General Public License, %% to permit their use in free software.