Fine-grained cryptography revisited
From MaRDI portal
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].
Recommendations
- Fine-grained cryptography revisited
- Fine-Grained Cryptography
- Public-key cryptography in the fine-grained setting
- Fine-grained secure computation
- Revisiting homomorphic encryption schemes for finite fields
- Completely Non-malleable Encryption Revisited
- Security analysis of cryptographic protocols based on fine-grained freshness
- Fine-grained secure attribute-based encryption
- Fine-grained secure attribute-based encryption
- Cascade Encryption Revisited
Cited in
(11)- One-way permutations in NC 0
- Fine-grained secure computation
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- Fine-grained secure attribute-based encryption
- Public-key cryptography in the fine-grained setting
- Fine-Grained Cryptography
- Cascade Encryption Revisited
- Fine-grained cryptography revisited
- Fine-grained secure attribute-based encryption
- Cryptography in constant parallel time
- Fine-grained polynomial functional encryption
This page was built for publication: Fine-grained cryptography revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918810)
