Card-based cryptography meets formal verification
From MaRDI portal
Publication:2181893
DOI10.1007/978-3-030-34578-5_18zbMath1456.94094OpenAlexW3158868992MaRDI QIDQ2181893
Michael Kirsten, Michael Schrempp, Alexander K. Koch
Publication date: 20 May 2020
Full work available at URL: https://publikationen.bibliothek.kit.edu/1000120005/93095586
formal verificationbounded model checkingsecure multiparty computationcard-based cryptographystandard decks
Related Items (9)
How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition ⋮ Card-minimal protocols for three-input functions with standard playing cards ⋮ Physical ZKP for Makaro using a standard deck of cards ⋮ Actively revealing card attack on card-based protocols ⋮ Single-shuffle card-based protocol with eight cards per gate ⋮ Secure computations through checking suits of playing cards ⋮ A card-minimal three-input and protocol using two shuffles ⋮ Practical card-based implementations of Yao's millionaire protocol ⋮ A secure three-input and protocol with a standard deck of minimal cards
This page was built for publication: Card-based cryptography meets formal verification
