Pages that link to "Item:Q3467159"
From MaRDI portal
The following pages link to Multi-party Computation with Small Shuffle Complexity Using Regular Polygon Cards (Q3467159):
Displaying 6 items.
- A single shuffle is enough for secure card-based computation of any Boolean circuit (Q2217477) (← links)
- Card-based zero-knowledge proof protocols for graph problems and their computational model (Q2697917) (← links)
- Card-based Protocols Using Triangle Cards (Q3301023) (← links)
- Securely computing the \(n\)-variable equality function with \(2n\) cards (Q5896830) (← links)
- Physical zero-knowledge proof for ripple effect (Q5919107) (← links)
- A physical zero-knowledge proof for Sumplete, a puzzle generated by ChatGPT (Q6591492) (← links)