Pages that link to "Item:Q2945569"
From MaRDI portal
The following pages link to Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points (Q2945569):
Displaying 12 items.
- How to construct physical zero-knowledge proofs for puzzles with a ``single loop'' condition (Q820565) (← 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)
- Zero-knowledge proof protocol for cryptarithmetic using dihedral cards (Q2152086) (← links)
- Efficient card-based zero-knowledge proof for Sudoku (Q2196568) (← links)
- Card-based protocols for secure ranking computations (Q2207500) (← links)
- A single shuffle is enough for secure card-based computation of any Boolean circuit (Q2217477) (← links)
- Efficient generation of a card-based uniformly distributed random derangement (Q2232235) (← links)
- Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle (Q2672240) (← links)
- Card-based zero-knowledge proof protocols for graph problems and their computational model (Q2697917) (← links)
- Card-Based Zero-Knowledge Proof for Sudoku (Q3301020) (← links)
- Actively revealing card attack on card-based protocols (Q6136456) (← links)
