A single shuffle is enough for secure card-based computation of any Boolean circuit

DOI10.1016/j.dam.2020.10.013zbMath1476.68086OpenAlexW3097358189MaRDI QIDQ2217477

Kazumasa Shinagawa, Koji Nuida

Publication date: 29 December 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.10.013

zbMATH Keywords

card-based protocolsgarbled circuitssecure computations

Mathematics Subject Classification ID

Cryptography (94A60) Other nonclassical models of computation (68Q09) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (8)

Card-based cryptographic protocols with a standard deck of cards using private operations ⋮ How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition ⋮ Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle ⋮ Card-based zero-knowledge proof for the nearest neighbor property: zero-knowledge proof of ABC end view ⋮ 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 ⋮ Card-based cryptographic protocols for three-input functions using private operations

Cites Work

• Unnamed Item
• Secure grouping protocol using a deck of cards
• Card-Based Cryptographic Protocols Using a Minimal Number of Cards
• Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points
• Two Halves Make a Whole
• Card-Based Protocols for Any Boolean Function
• Multi-party Computation with Small Shuffle Complexity Using Regular Polygon Cards
• Improved Garbled Circuit: Free XOR Gates and Applications
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Six-Card Secure AND and Four-Card Secure XOR

This page was built for publication: A single shuffle is enough for secure card-based computation of any Boolean circuit