Securely computing the \(n\)-variable equality function with \(2n\) cards

DOI10.1016/j.tcs.2021.07.007OpenAlexW2989151298MaRDI QIDQ5896830

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

zbMATH Keywords

symmetric functionsecure multi-party computationcard-based cryptographydoubly symmetric functionequality function

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (7)

Physical ZKP protocols for Nurimisaki and Kurodoko ⋮ Card-minimal protocols for symmetric Boolean functions of more than seven inputs ⋮ Physical zero-knowledge proof protocol for Topswops ⋮ Hide a liar: card-based ZKP protocol for Usowan ⋮ Single-shuffle card-based protocol with eight cards per gate ⋮ Card-based ZKP protocol for Nurimisaki ⋮ A card-minimal three-input and protocol using two shuffles

Cites Work

• Unnamed Item
• Unnamed Item
• Secure computation without computers
• Secure multiparty computations without computers
• The six-card trick: secure computation of three-input equality
• Card-based protocols for secure ranking computations
• AND protocols using only uniform shuffles
• Card-Based Cryptographic Protocols Using a Minimal Number of Cards
• Card-Based Protocols for Any Boolean Function
• Multi-party Computation with Small Shuffle Complexity Using Regular Polygon Cards
• The Five-Card Trick Can Be Done with Four Cards
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Voting with a Logarithmic Number of Cards
• Six-Card Secure AND and Four-Card Secure XOR
• Secure Multiparty Computations Using a Dial Lock
• Securely computing the \(n\)-variable equality function with \(2n\) cards
• Computations with a deck of cards
• Multi-party computation based on physical coins

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