Pages that link to "Item:Q2207500"
From MaRDI portal
The following pages link to Card-based protocols for secure ranking computations (Q2207500):
Displaying 12 items.
- How to construct physical zero-knowledge proofs for puzzles with a ``single loop'' condition (Q820565) (← links)
- Efficient card-based cryptographic protocols for millionaires' problem utilizing private permutations (Q1989462) (← 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)
- Practical card-based implementations of Yao's millionaire protocol (Q2283025) (← links)
- Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle (Q2672240) (← links)
- Securely computing the \(n\)-variable equality function with \(2n\) cards (Q5896830) (← links)
- Topics in Cryptology – CT-RSA 2006 (Q5898573) (← links)
- Actively revealing card attack on card-based protocols (Q6136456) (← links)
- Card-Based Secure Sorting Protocol (Q6487420) (← links)
- A physical zero-knowledge proof for Sumplete, a puzzle generated by ChatGPT (Q6591492) (← links)