Pages that link to "Item:Q5964073"

The following pages link to Card-based protocols for securely computing the conjunction of multiple variables (Q5964073):

Displaying 20 items.

• How to construct physical zero-knowledge proofs for puzzles with a ``single loop'' condition (Q820565) (← links)
• The minimum number of cards in practical card-based protocols (Q1701439) (← links)
• Secure grouping protocol using a deck of cards (Q1705722) (← links)
• The six-card trick: secure computation of three-input equality (Q1736040) (← links)
• Card-based cryptographic protocols for three-input functions using private operations (Q2115886) (← links)
• Card-based cryptographic protocols with a standard deck of cards using private operations (Q2119979) (← links)
• Card-based secure ranking computations (Q2180177) (← links)
• Secure computation of any Boolean function based on any deck of cards (Q2327087) (← links)
• Information leakage due to operative errors in card-based protocols (Q2672274) (← links)
• A card-minimal three-input and protocol using two shuffles (Q2695338) (← links)
• A secure additive protocol for card players (Q2869467) (← links)
• Card-based Protocols Using Triangle Cards (Q3301023) (← links)
• (Q4817502) (← links)
• Multi-party computation based on physical coins (Q6049058) (← links)
• Card-based ZKP protocol for Nurimisaki (Q6155254) (← links)
• Another use of the five-card trick: card-minimal secure three-input majority function evaluation (Q6157606) (← links)
• Secure computations through checking suits of playing cards (Q6166876) (← links)
• Card-Based Secure Sorting Protocol (Q6487420) (← links)
• Card-based ZKP protocols for Takuzu and Juosan (Q6487593) (← links)
• The landscape of computing symmetric \(n\)-variable functions with \(2n\) cards (Q6605342) (← links)