Card-Based Protocols for Any Boolean Function

DOI10.1007/978-3-319-17142-5_11zbMath1353.94067OpenAlexW783329724MaRDI QIDQ2948458

Hideaki Sone, Takaaki Mizuki, Takuya Nishida, Yu-ichi Hayashi

Publication date: 30 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-17142-5_11

Mathematics Subject Classification ID

Related Items (10)

Card-based cryptographic protocols with a standard deck of cards using private operations ⋮ Efficient private PEZ protocols for symmetric functions ⋮ Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points ⋮ Physical ZKP protocols for Nurimisaki and Kurodoko ⋮ Card-minimal protocols for symmetric Boolean functions of more than seven inputs ⋮ Single-shuffle card-based protocol with eight cards per gate ⋮ A single shuffle is enough for secure card-based computation of any Boolean circuit ⋮ Securely computing the \(n\)-variable equality function with \(2n\) cards ⋮ 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: Card-Based Protocols for Any Boolean Function