Fine-Grained Cryptography
From MaRDI portal
Publication:2829959
DOI10.1007/978-3-662-53015-3_19zbMATH Open1406.94042OpenAlexW2494954630MaRDI QIDQ2829959FDOQ2829959
Authors: Akshay Degwekar, Vinod Vaikuntanathan, Prashant Nalini Vasudevan 
Publication date: 9 November 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/111069
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
- Fully homomorphic encryption using ideal lattices
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- A method for obtaining digital signatures and public-key cryptosystems
- \(\Sigma_ 1^ 1\)-formulae on finite structures
- Hardness vs randomness
- Title not available (Why is that?)
- New directions in cryptography
- A Pseudorandom Generator from any One-way Function
- Cryptography in constant parallel time
- Constructing locally computable extractors and cryptosystems in the bounded-storage model
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- The knowledge complexity of interactive proof-systems
- Advances in Cryptology - EUROCRYPT 2004
- Title not available (Why is that?)
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Constant depth circuits, Fourier transform, and learnability
- A Framework for Efficient and Composable Oblivious Transfer
- Parity, circuits, and the polynomial-time hierarchy
- Secure communications over insecure channels
- Conditionally-perfect secrecy and a provably-secure randomized cipher
- Public-key cryptography from different assumptions
- Title not available (Why is that?)
- On ε‐biased generators in NC0
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- On basing one-way functions on NP-hardness
- Polylogarithmic independence fools \(\mathrm{AC}^{0}\) circuits
- How to use indistinguishability obfuscation
- On Worst‐Case to Average‐Case Reductions for NP Problems
- Title not available (Why is that?)
- Linear-size constant-depth polylog-threshold circuits
- Theory of Cryptography
- Local zero knowledge
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of distributions
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- Addendum to “simple constructions of almost k-wise independent random variables”
- One-way permutations in NC 0
- On basing size-verifiable one-way functions on NP-hardness
- On the Correlation of Parity and Small-Depth Circuits
- Basing Weak Public-Key Cryptography on Strong One-Way Functions
- An average-case depth hierarchy theorem for Boolean circuits
Cited In (20)
- On building fine-grained one-way functions from strong average-case hardness
- Fine-grained non-interactive key-exchange: constructions and lower bounds
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- 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
- 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
- Fine-grained non-interactive key-exchange without idealized assumptions
- Fine-grained non-interactive key exchange, revisited
- Feebly secure cryptographic primitives
- On sequential functions and fine-grained cryptography
- Fine-grained secure attribute-based encryption
- Fine-grained secure attribute-based encryption
- Non-interactive zero-knowledge proofs with fine-grained security
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)
