On the complexity of compressing obfuscation (Q5896077)
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 7216166
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of compressing obfuscation |
scientific article; zbMATH DE number 7216166 |
Statements
On the complexity of compressing obfuscation (English)
0 references
30 June 2020
0 references
indistinguishability obfuscation
0 references
compressing obfuscation with perfect correctness
0 references
0.997589647769928
0 references
0.754838764667511
0 references
0.7537170648574829
0 references
0.7471146583557129
0 references
0.7435107827186584
0 references
