The minimum number of cards in practical card-based protocols

DOI10.1007/978-3-319-70700-6_5zbMath1417.94064OpenAlexW2770302702MaRDI QIDQ1701439

Hideaki Sone, Yu-ichi Hayashi, Takaaki Mizuki, Daiki Miyahara, Stefan Walzer, Julia Kastner, Alexander K. Koch

Publication date: 23 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-70700-6_5

zbMATH Keywords

card-based protocols cryptography without computers secure computation copy Boolean AND committed format

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (11)

Card-based cryptographic protocols with a standard deck of cards using private operations ⋮ How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition ⋮ Committed-format AND protocol using only random cuts ⋮ Card-minimal protocols for symmetric Boolean functions of more than seven inputs ⋮ Card-based zero-knowledge proof for the nearest neighbor property: zero-knowledge proof of ABC end view ⋮ Single-shuffle card-based protocol with eight cards per gate ⋮ Another use of the five-card trick: card-minimal secure three-input majority function evaluation ⋮ Secure computations through checking suits of playing cards ⋮ A card-minimal three-input and protocol using two shuffles ⋮ Card-based cryptographic protocols for three-input functions using private operations ⋮ A secure three-input and protocol with a standard deck of minimal cards

This page was built for publication: The minimum number of cards in practical card-based protocols