The landscape of computing symmetric \(n\)-variable functions with \(2n\) cards

DOI10.1007/978-3-031-47963-2_6MaRDI QIDQ6605342

Suthee Ruangwises

Publication date: 13 September 2024

zbMATH Keywords

symmetric functionsecure multi-party computationcard-based cryptography

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• The six-card trick: secure computation of three-input equality
• A card-minimal three-input and protocol using two shuffles
• Card-Based Cryptographic Protocols Using a Minimal Number of Cards
• Card-Based Protocols for Any Boolean Function
• 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
• Securely computing the \(n\)-variable equality function with \(2n\) cards
• Card-based protocols for securely computing the conjunction of multiple variables
• Card-minimal protocols for symmetric Boolean functions of more than seven inputs
• Another use of the five-card trick: card-minimal secure three-input majority function evaluation

This page was built for publication: The landscape of computing symmetric \(n\)-variable functions with \(2n\) cards

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