Multi-party computation with small shuffle complexity using regular polygon cards (Q3467159)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6536041
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multi-party computation with small shuffle complexity using regular polygon cards |
scientific article; zbMATH DE number 6536041 |
Statements
Multi-party Computation with Small Shuffle Complexity Using Regular Polygon Cards (English)
0 references
27 January 2016
0 references
multi-party computation
0 references
card-based protocol
0 references
polygon cards
0 references
shuffle complexity
0 references
0.8349551558494568
0 references
0.8336629867553711
0 references
0.8108876347541809
0 references
0.8076923489570618
0 references
0.8000523447990417
0 references
