Voting with a Logarithmic Number of Cards

DOI10.1007/978-3-642-39074-6_16MaRDI QIDQ5300921zbMATH OpenOpenAlexFDO

Authors Takaaki Mizuki, Isaac Kobina Asiedu, Hideaki Sone

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

Mathematics Subject Classification ID

Voting theory (91B12)

Recommendations

• The mathematics of voting
• Votes and a half-binomial
• On the welfare of cardinal voting mechanisms
• Combinatorial voting
• Ordinal versus cardinal voting rules: a mechanism design approach
• A note on the voting problem
• Logic and majority voting
• Voting Rules from Random Relations
• Voting in combinatorial domains

Cited in

(11)

• 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
• 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
• Securely computing the \(n\)-variable equality function with \(2n\) cards
• 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
• Card-based overwriting protocol for equality function and applications

This page was built for publication: Voting with a Logarithmic Number of Cards

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300921)