Fine-grained cryptography revisited
From MaRDI portal
Publication:5918348
DOI10.1007/s00145-021-09390-3zbMath1469.94094OpenAlexW3164394840MaRDI QIDQ5918348
Shohei Egashira, Yu Yu Wang, Keisuke Tanaka
Publication date: 30 July 2021
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-021-09390-3
trapdoor one-way functionhash proof system\(\mathsf{NC}^1\) circuitfine-grained cryptographyone-way permutation family
Related Items (6)
Fine-grained secure attribute-based encryption ⋮ Non-interactive zero-knowledge proofs with fine-grained security ⋮ Unconditionally secure NIZK in the fine-grained setting ⋮ Fine-grained non-interactive key-exchange: constructions and lower bounds ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Fine-grained secure attribute-based encryption
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
- \(\Sigma_ 1^ 1\)-formulae on finite structures
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- One-way functions and circuit complexity
- On uniform circuit complexity
- Conditionally-perfect secrecy and a provably-secure randomized cipher
- Fine-grained secure computation
- On tightly secure non-interactive key exchange
- Trapdoor functions from the computational Diffie-Hellman assumption
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- New techniques for efficient trapdoor functions and applications
- Efficient cryptographic schemes provably as secure as subset sum
- On Constructing One-Way Permutations from Indistinguishability Obfuscation
- Secure communications over insecure channels
- Fine-Grained Cryptography
- SPHF-Friendly Non-interactive Commitments
- Erratum for
- Relatively-Sound NIZKs and Password-Based Key-Exchange
- Round-Optimal Password-Based Authenticated Key Exchange
- Parity, circuits, and the polynomial-time hierarchy
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Lossy trapdoor functions and their applications
- New directions in cryptography
- A Pseudorandom Generator from any One-way Function
- Foundations of Cryptography
- A storage complexity based analogue of Maurer key establishment using public channels
- Everlasting security in the bounded storage model
- Advances in Cryptology - EUROCRYPT 2004
- Smooth Projective Hashing and Two-Message Oblivious Transfer
- Advances in Cryptology - CRYPTO 2003
- Basing Weak Public-Key Cryptography on Strong One-Way Functions
- On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations
- Cryptography in $NC^0$
- Theory of Cryptography
- Fine-grained cryptography revisited
This page was built for publication: Fine-grained cryptography revisited
