Pages that link to "Item:Q2283025"
From MaRDI portal
The following pages link to Practical card-based implementations of Yao's millionaire protocol (Q2283025):
Displaying 17 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)
- 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)
- Card-based protocols for secure ranking computations (Q2207500) (← 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)
- Two standard decks of playing cards are sufficient for a ZKP for Sudoku (Q2695333) (← links)
- Yao's millionaires' problem and decoy-based public key encryption by classical physics (Q2929625) (← links)
- Card-minimal protocols for three-input functions with standard playing cards (Q6103095) (← links)
- Physical ZKP for Makaro using a standard deck of cards (Q6111941) (← 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)
- Card-Based Secure Sorting Protocol (Q6487420) (← links)
- A physical zero-knowledge proof for Sumplete, a puzzle generated by ChatGPT (Q6591492) (← links)
