A note on the complexity of private simultaneous messages with many parties (Q6561687)
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 7871067
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the complexity of private simultaneous messages with many parties |
scientific article; zbMATH DE number 7871067 |
Statements
A note on the complexity of private simultaneous messages with many parties (English)
0 references
25 June 2024
0 references
secure computation
0 references
private simultaneous messages
0 references
0.864027738571167
0 references
0.8565606474876404
0 references
0.8298289775848389
0 references
0.8296387195587158
0 references
0.8088384866714478
0 references
