Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (Q3179364)
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 6667637
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity |
scientific article; zbMATH DE number 6667637 |
Statements
Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (English)
0 references
21 December 2016
0 references
secure computation
0 references
tamper-proof hardware
0 references
round complexity
0 references
minimal assumptions
0 references
0 references
0 references
0 references
0 references
0 references
0.89769965
0 references
0.8896807
0 references
0.88718045
0 references
0.8748829
0 references
0.87323296
0 references
0.8703265
0 references
0.8673805
0 references
0.86403555
0 references
0.85974467
0 references
