Pages that link to "Item:Q2217477"
From MaRDI portal
The following pages link to A single shuffle is enough for secure card-based computation of any Boolean circuit (Q2217477):
Displaying 11 items.
- How to construct physical zero-knowledge proofs for puzzles with a ``single loop'' condition (Q820565) (← links)
- How to implement a non-uniform or non-closed shuffle (Q2038355) (← 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)
- Secure computation of any Boolean function based on any deck of cards (Q2327087) (← links)
- Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle (Q2672240) (← links)
- Card-based zero-knowledge proof for the nearest neighbor property: zero-knowledge proof of ABC end view (Q6112013) (← links)
- Actively revealing card attack on card-based protocols (Q6136456) (← links)
- Secure computations through checking suits of playing cards (Q6166876) (← links)
- Foundations for actively secure card-based cryptography (Q6487589) (← links)
- Single-shuffle card-based protocols with six cards per gate (Q6547900) (← links)
