Fine-grained cryptography revisited (Q5918810)
From MaRDI portal
scientific article; zbMATH DE number 7198904
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fine-grained cryptography revisited |
scientific article; zbMATH DE number 7198904 |
Statements
Fine-grained cryptography revisited (English)
0 references
11 May 2020
0 references
Under the complexity assumption \(N{C^1} \varsubsetneq \oplus L/\mathrm{poly}\), constructions for fine-grained cryptographic primitives are proposed: a one-way permutation, a hash proof system and a trapdoor one-way function, which all are computable in \(N{C^1}\) and secure against \(N{C^1}\)circuits. For the entire collection see [Zbl 1428.94010].
0 references
fine-grained cryptography
0 references
\(\mathsf{NC^1}\) circuit
0 references
one-way permutation
0 references
hash proof system
0 references
trapdoor one-way function
0 references
