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• 12 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•49 citations

Card-Based Cryptography with Invisible Ink

Kazumasa Shinagawa

Lecture notes in computer science•Jan 1, 2019•3 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•102 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•6 citations

Floating-point Number Commitments in Card-based Cryptography and Their Applications

Shun Odaka, Yuichi Komano

Card-based cryptography enables the execution of cryptographic protocols such as secure multiparty computation, by using a deck of physical cards. To facilitate statistical analysis with card-based cryptography, we have previously presented protocols for integer-based arithmetic operations. These protocols utilize integer commitments, which are face-down card sequences encoding integers, and consist of simple operations. However, in statistical applications, they suffer from poor scalability, as the required number of cards increases significantly as the number of data points increases. To address this issue, this paper introduces a new representation of commitments, named floating-point number (FPN) commitments, which are face-down card sequences encoding floating-point numbers. These FPN commitments allow us to represent a wide range of numbers, including negative and arbitrary-precision values, with fewer cards. We then propose protocols for converting a conventional integer commitment to an FPN commitment and for performing arithmetic operations using FPN commitments. We also demonstrate that our new representation and protocols enhance the applicability of card-based cryptography to statistical processing.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2026•0 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.
Card-based cryptography enables the execution of cryptographic protocols such as secure multiparty computation, by using a deck of physical cards. To facilitate statistical analysis with card-based cryptography, we have previously presented protocols for integer-based arithmetic operations. These protocols utilize integer commitments, which are face-down card sequences encoding integers, and consist of simple operations. However, in statistical applications, they suffer from poor scalability, as the required number of cards increases significantly as the number of data points increases. To address this issue, this paper introduces a new representation of commitments, named floating-point number (FPN) commitments, which are face-down card sequences encoding floating-point numbers. These FPN commitments allow us to represent a wide range of numbers, including negative and arbitrary-precision values, with fewer cards. We then propose protocols for converting a conventional integer commitment to an FPN commitment and for performing arithmetic operations using FPN commitments. We also demonstrate that our new representation and protocols enhance the applicability of card-based cryptography to statistical processing.