Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Secure Trick-Taking Game Protocols

Xavier Bultel, Pascal Lafourcade

Published Jan 1, 2019• 3 citations
Publisher
DOI
10.1007/978-3-030-32101-7_17

Related papers

Secure Composition of Public Key Infrastructures and Protocols in Game-based Cryptographic Models

Herrscher, Maya

•Jan 1, 2025•0 citations

Game-Theoretic Security for Two-Party Protocols.

Haruna Higo, Keisuke Tanaka, Akihiro Yamada +1 more

•Jan 1, 2016•1 citation

Secure Communication Protocols

Éva Ádámkó

•Jun 18, 2020•0 citations

Secure Trick-Taking Game Protocols How to Play Online Spades with Cheaters

Xavier Bultel, Pascal Lafourcade

Trick-Taking Games (TTGs) are card games in which each player plays one of his cards in turn according to a given rule. The player with the highest card then wins the trick, i.e., he gets all the cards that have been played during the round. For instance, Spades is a famous TTG proposed by online casinos, where each player must play a card that follows the leading suit when it is possible. Otherwise, he can play any of his cards. In such a game, a dishonest user can play a wrong card even if he has cards of the leading suit. Since his other cards are hidden, there is no way to detect the cheat. Hence, the other players realize the problem later, i.e., when the cheater plays a card that he is not supposed to have. In this case, the game is biased and is canceled. Our goal is to design protocols that prevent such a cheat for TTGs. We give a security model for secure Spades protocols, and we design a scheme called SecureSpades. This scheme is secure under the Decisional Diffie-Hellman assumption in the random oracle model. Our model and our scheme can be extended to several other TTGs, such as Belotte, Whist, Bridge, etc.

•Feb 18, 2019•0 citations

Secure protocols and their applications

P.M.T.B Sandirigama

•Jan 1, 2001•0 citations

Practical Construction for Secure Trick-Taking Games Even with Cards Set Aside

Rohann Bella, Xavier Bultel, Céline Chevalier +2 more

Lecture notes in computer science•Nov 30, 2023•2 citations
Trick-Taking Games (TTGs) are card games in which each player plays one of his cards in turn according to a given rule. The player with the highest card then wins the trick, i.e., he gets all the cards that have been played during the round. For instance, Spades is a famous TTG proposed by online casinos, where each player must play a card that follows the leading suit when it is possible. Otherwise, he can play any of his cards. In such a game, a dishonest user can play a wrong card even if he has cards of the leading suit. Since his other cards are hidden, there is no way to detect the cheat. Hence, the other players realize the problem later, i.e., when the cheater plays a card that he is not supposed to have. In this case, the game is biased and is canceled. Our goal is to design protocols that prevent such a cheat for TTGs. We give a security model for secure Spades protocols, and we design a scheme called SecureSpades. This scheme is secure under the Decisional Diffie-Hellman assumption in the random oracle model. Our model and our scheme can be extended to several other TTGs, such as Belotte, Whist, Bridge, etc.