Pages that link to "Item:Q1701439"
From MaRDI portal
The following pages link to The minimum number of cards in practical card-based protocols (Q1701439):
Displaying 15 items.
- How to construct physical zero-knowledge proofs for puzzles with a ``single loop'' condition (Q820565) (← links)
- Card-based protocols using unequal division shuffles (Q1797742) (← 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)
- A secure three-input and protocol with a standard deck of minimal cards (Q2117094) (← links)
- Card-based cryptographic protocols with a standard deck of cards using private operations (Q2119979) (← links)
- A single shuffle is enough for secure card-based computation of any Boolean circuit (Q2217477) (← links)
- A card-minimal three-input and protocol using two shuffles (Q2695338) (← links)
- Committed-format AND protocol using only random cuts (Q6095508) (← links)
- Card-based zero-knowledge proof for the nearest neighbor property: zero-knowledge proof of ABC end view (Q6112013) (← 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)
- Foundations for actively secure card-based cryptography (Q6487589) (← links)
- Two UNO decks efficiently perform zero-knowledge proof for Sudoku (Q6546608) (← links)
- Single-shuffle card-based protocols with six cards per gate (Q6547900) (← links)
