Voting with a Logarithmic Number of Cards
From MaRDI portal
Publication:5300921
DOI10.1007/978-3-642-39074-6_16zbMath1382.91040OpenAlexW69711576MaRDI QIDQ5300921
Hideaki Sone, Isaac Kobina Asiedu, Takaaki Mizuki
Publication date: 28 June 2013
Published in: Unconventional Computation and Natural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-39074-6_16
Related Items (10)
Card-based cryptographic protocols with a standard deck of cards using private operations ⋮ Zero-knowledge proof protocol for cryptarithmetic using dihedral cards ⋮ Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points ⋮ 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 ⋮ Securely computing the \(n\)-variable equality function with \(2n\) cards ⋮ Card-based protocols using unequal division 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: Voting with a Logarithmic Number of Cards
