Fine-Grained Cryptography
From MaRDI portal
Recommendations
- Fine-grained cryptography revisited
- Fine-grained cryptography revisited
- Public-key cryptography in the fine-grained setting
- Fine-grained secure computation
- Fine-grained secure attribute-based encryption
- Fine-grained secure attribute-based encryption
- Cryptogenography
- scientific article; zbMATH DE number 1006115
- Cryptography secure against related-key attacks and tampering
- Practical cryptography
Cites work
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 1088242 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- scientific article; zbMATH DE number 1418287 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- A Framework for Efficient and Composable Oblivious Transfer
- A Pseudorandom Generator from any One-way Function
- A method for obtaining digital signatures and public-key cryptosystems
- Addendum to “simple constructions of almost k-wise independent random variables”
- Advances in Cryptology - EUROCRYPT 2004
- An average-case depth hierarchy theorem for Boolean circuits
- Basing Weak Public-Key Cryptography on Strong One-Way Functions
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Conditionally-perfect secrecy and a provably-secure randomized cipher
- Constant depth circuits, Fourier transform, and learnability
- Constructing locally computable extractors and cryptosystems in the bounded-storage model
- Cryptography in constant parallel time
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fully homomorphic encryption using ideal lattices
- Hardness vs randomness
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- How to use indistinguishability obfuscation
- Linear-size constant-depth polylog-threshold circuits
- Local zero knowledge
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- New directions in cryptography
- On Worst‐Case to Average‐Case Reductions for NP Problems
- On basing one-way functions on NP-hardness
- On basing size-verifiable one-way functions on NP-hardness
- On the Correlation of Parity and Small-Depth Circuits
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- On ε‐biased generators in NC0
- One-way permutations in NC 0
- Parity, circuits, and the polynomial-time hierarchy
- Polylogarithmic independence fools \(\mathrm{AC}^{0}\) circuits
- Public-key cryptography from different assumptions
- Secure communications over insecure channels
- The complexity of distributions
- The knowledge complexity of interactive proof-systems
- Theory of Cryptography
- \(\Sigma_ 1^ 1\)-formulae on finite structures
Cited in
(23)- Non-interactive zero-knowledge proofs with fine-grained security
- On building fine-grained one-way functions from strong average-case hardness
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- Fine-grained non-interactive key-exchange: constructions and lower bounds
- Fine-grained cryptography revisited
- Public-key cryptography in the fine-grained setting
- Paradigms for Unconditional Pseudorandom Generators
- Fine-grained secure computation
- Fine-grained polynomial functional encryption
- Anonymous whistleblowing over authenticated channels
- Fine-grained cryptanalysis: tight conditional bounds for dense \(k\)-SUM and \(k\)-XOR
- Unconditionally secure NIZK in the fine-grained setting
- Cryptography in $NC^0$
- Fine-grained cryptography revisited
- On building fine-grained one-way functions from strong average-case hardness
- Leakage-resilient circuits against \textsf{NC1}, revisited
- Fine-grained non-interactive key-exchange without idealized assumptions
- Fine-grained non-interactive key exchange, revisited
- Feebly secure cryptographic primitives
- Fine-grained complexity in a world without cryptography
- On sequential functions and fine-grained cryptography
- Fine-grained secure attribute-based encryption
- Fine-grained secure attribute-based encryption
This page was built for publication: Fine-Grained Cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829959)
