scientific article; zbMATH DE number 1024066
From MaRDI portal
Publication:4341757
zbMath0870.94024MaRDI QIDQ4341757
Publication date: 20 July 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition ⋮ Six-Card Secure AND and Four-Card Secure XOR ⋮ Secure multiparty computations without computers ⋮ Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points ⋮ Committed-format AND protocol using only random cuts ⋮ Actively revealing card attack on card-based protocols ⋮ Secure computations through checking suits of playing cards ⋮ Card-based zero-knowledge proof protocols for graph problems and their computational model ⋮ Card-based protocols for secure ranking computations ⋮ A single shuffle is enough for secure card-based computation of any Boolean circuit ⋮ Private computation using a PEZ dispenser. ⋮ Efficient generation of a card-based uniformly distributed random derangement ⋮ Securely computing the \(n\)-variable equality function with \(2n\) cards ⋮ Computations with a deck of cards ⋮ Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol ⋮ Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles ⋮ Card-based protocols for securely computing the conjunction of multiple variables ⋮ Card-based protocols using unequal division shuffles ⋮ Crypto Santa ⋮ Card-based cryptographic protocols for three-input functions using private operations ⋮ A secure three-input and protocol with a standard deck of minimal cards
