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

arXiv:1301.4289 · Designs Codes and Cryptography

A geometric protocol for cryptography with cards

Andrés Cordón–Franco, Hans van Ditmarsch, David Fernández–Duque, Fernando Soler Toscano

Published Jul 4, 2013• 13 citations
arXivHTMLPDF
DOI
10.1007/s10623-013-9855-y

Related papers

Practical Card-Based Cryptography

Takaaki Mizuki, Hiroki Shizuya

Lecture notes in computer science•Jan 1, 2014•51 citations

Card-Based Cryptography with Invisible Ink

Kazumasa Shinagawa

Lecture notes in computer science•Jan 1, 2019•3 citations

Private Permutations in Card-based Cryptography

雄士 中井

•Mar 25, 2021•0 citations

Towards Verifying Physical Assumption in Card-Based Cryptography

Masahisa Shimano, Kazuo Sakiyama, Daiki Miyahara

Lecture notes in computer science•Jan 1, 2023•1 citation

Card-Based Cryptographic Protocols Using a Minimal Number of Cards

Alexander Koch, Stefan Walzer, Kevin Härtel

Lecture notes in computer science•Jan 1, 2015•106 citations

Card-based Cryptography with a Standard Deck of Cards, Revisited: Efficient Protocols in the Private Model

Takeshi Nakai, Keita Iwanari, Tomoki Ono +3 more

Abstract Card-based cryptography is a secure computation protocol realized by using physical cards. There are two models on card-based cryptography: public and private models. We adopt private one that allows players to handle cards privately. While much of the existing works for card-based cryptography use two-colored cards, it is also a vital task to construct an efficient protocol with playing cards. In the public model, 2n cards are necessary for any n-bit input protocol since at least two cards are required to express a Boolean value. It holds true for both two-colored and playing-card settings. On the other hand, the private model enables us to construct a protocol with fewer than 2n cards. However, all existing protocols that achieve such properties are only in the two-colored setting. This paper shows that the private model enables us to construct a protocol with fewer than 2n cards using the playing cards. We first show two-bit input protocols with fewer than four cards for logical operations, AND, OR, and XOR. Furthermore, we show a three-input majority voting protocol using only three cards, which is constructed by combining our AND and OR protocols. Notably, our proposed protocols require no randomness. All operations are deterministic and depend only on players’ private inputs.

New Generation Computing•Jun 21, 2024•7 citations
Abstract Card-based cryptography is a secure computation protocol realized by using physical cards. There are two models on card-based cryptography: public and private models. We adopt private one that allows players to handle cards privately. While much of the existing works for card-based cryptography use two-colored cards, it is also a vital task to construct an efficient protocol with playing cards. In the public model, 2n cards are necessary for any n-bit input protocol since at least two cards are required to express a Boolean value. It holds true for both two-colored and playing-card settings. On the other hand, the private model enables us to construct a protocol with fewer than 2n cards. However, all existing protocols that achieve such properties are only in the two-colored setting. This paper shows that the private model enables us to construct a protocol with fewer than 2n cards using the playing cards. We first show two-bit input protocols with fewer than four cards for logical operations, AND, OR, and XOR. Furthermore, we show a three-input majority voting protocol using only three cards, which is constructed by combining our AND and OR protocols. Notably, our proposed protocols require no randomness. All operations are deterministic and depend only on players’ private inputs.