Handling expected polynomial-time strategies in simulation-based security proofs (Q1021232)
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 5562544
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Handling expected polynomial-time strategies in simulation-based security proofs |
scientific article; zbMATH DE number 5562544 |
Statements
Handling expected polynomial-time strategies in simulation-based security proofs (English)
0 references
8 June 2009
0 references
expected polynomial-time
0 references
black-box simulation
0 references
secure multiparty computation
0 references
zero-knowledge
0 references
0 references
0.9992509484291076
0 references
0.8464431762695312
0 references
0.8431500792503357
0 references
0.8359120488166809
0 references
