Pages that link to "Item:Q1989462"
From MaRDI portal
The following pages link to Efficient card-based cryptographic protocols for millionaires' problem utilizing private permutations (Q1989462):
Displaying 6 items.
- Four cards are sufficient for a card-based three-input voting protocol utilizing private permutations (Q1705725) (← links)
- Card-based protocols for secure ranking computations (Q2207500) (← links)
- Efficient generation of a card-based uniformly distributed random derangement (Q2232235) (← links)
- Practical card-based implementations of Yao's millionaire protocol (Q2283025) (← links)
- An Efficient and Verifiable Solution to the Millionaire Problem (Q5450894) (← links)
- A physical zero-knowledge proof for Sumplete, a puzzle generated by ChatGPT (Q6591492) (← links)