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

DOI10.1016/J.DAM.2020.10.013MaRDI QIDQ2217477zbMATH OpenOpenAlexFDO

Authors Kazumasa Shinagawa, Koji Nuida

Publication date 29 December 2020

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

Copyright license Creative Commons Attribution 4.0 International

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

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

Recommendations

• Card-based protocols for any Boolean function
• Card-based cryptographic protocols using a minimal number of cards
• The minimum number of cards in practical card-based protocols
• Foundations for actively secure card-based cryptography
• Six-Card Secure AND and Four-Card Secure XOR

Cites work

• Card-based cryptographic protocols using a minimal number of cards
• Card-based protocols for any Boolean function
• Efficient card-based protocols for generating a hidden random permutation without fixed points
• scientific article; zbMATH DE number 1024066 (Why is no real title available?)
• Improved Garbled Circuit: Free XOR Gates and Applications
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Multi-party computation with small shuffle complexity using regular polygon cards
• Secure grouping protocol using a deck of cards
• Six-Card Secure AND and Four-Card Secure XOR
• Two halves make a whole: reducing data transfer in garbled circuits using half gates

Cited in

(19)

• How to implement a non-uniform or non-closed shuffle
• Card-based cryptographic protocols for three-input functions using private operations
• Card-based cryptographic protocols with a standard deck of cards using private operations
• Secure computation of any Boolean function based on any deck of cards
• Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle
• Multi-party computation with small shuffle complexity using regular polygon cards
• 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
• Foundations for actively secure card-based cryptography
• Single-shuffle card-based protocols with six cards per gate
• Upper bounds on the number of shuffles for two-helping-card multi-input AND protocols
• Cyclic equalizability of words and its application to card-based cryptography
• Visualizing differentially private mechanisms with physical cards
• Card-based protocols with single-card encoding
• Card-based cryptography meets 3D printer
• Simulating virtual players for UNO without computers
• How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition

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

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