Securely computing the n-variable equality function with 2n cards

DOI10.1016/J.TCS.2021.07.007OpenAlexW2989151298MaRDI QIDQ5896830FDOQ5896830

Authors: Suthee Ruangwises, Toshiya Itoh 

Publication date: 27 September 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.05994

Recommendations

• The six-card trick: secure computation of three-input equality
• Card-based protocols for any Boolean function
• Card-based cryptographic protocols using a minimal number of cards
• Computations with a deck of cards
• Securely computing XOR with 10 cards

zbMATH Keywords

symmetric functionsecure multi-party computationcard-based cryptographyequality functiondoubly symmetric function

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Computations with a deck of cards
• Secure computation without computers
• Secure multiparty computations without computers
• Card-based protocols for secure ranking computations
• Card-based cryptographic protocols using a minimal number of cards
• Title not available (Why is that?)
• The five-card trick can be done with four cards
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Six-Card Secure AND and Four-Card Secure XOR
• Foundations for actively secure card-based cryptography
• The six-card trick: secure computation of three-input equality
• Voting with a Logarithmic Number of Cards
• AND protocols using only uniform shuffles
• Card-based protocols for any Boolean function
• Securely computing XOR with 10 cards
• Securely computing the \(n\)-variable equality function with \(2n\) cards
• Multi-party computation based on physical coins
• Multi-party computation with small shuffle complexity using regular polygon cards
• Secure Multiparty Computations Using a Dial Lock

Cited In (17)

• Securely computing XOR with 10 cards
• Card-based protocols for any Boolean function
• Card-based protocols using triangle cards
• The six-card trick: secure computation of three-input equality
• Single-shuffle card-based protocol with eight cards per gate
• Physical ZKP protocols for Nurimisaki and Kurodoko
• Secure computation of any Boolean function based on any deck of cards
• The landscape of computing symmetric \(n\)-variable functions with \(2n\) cards
• Secure computations through checking suits of playing cards
• Physical zero-knowledge proof protocol for Topswops
• Card-based protocols using unequal division shuffles
• Hide a liar: card-based ZKP protocol for Usowan
• Card-based ZKP protocol for Nurimisaki
• Card-based secure ranking computations
• Card-minimal protocols for symmetric Boolean functions of more than seven inputs
• A card-minimal three-input and protocol using two shuffles
• Multi-party computation with small shuffle complexity using regular polygon cards

This page was built for publication: Securely computing the \(n\)-variable equality function with \(2n\) cards

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