Fine-Grained Cryptography

DOI10.1007/978-3-662-53015-3_19zbMath1406.94042OpenAlexW2494954630MaRDI QIDQ2829959

Vinod Vaikuntanathan, Prashant Nalini Vasudevan, Akshay Degwekar

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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Fine-grained secure computation, Fine-grained secure attribute-based encryption, Non-interactive zero-knowledge proofs with fine-grained security, On building fine-grained one-way functions from strong average-case hardness, Unconditionally secure NIZK in the fine-grained setting, Fine-grained non-interactive key-exchange: constructions and lower bounds, Paradigms for Unconditional Pseudorandom Generators, Anonymous whistleblowing over authenticated channels, Fine-grained secure attribute-based encryption, Fine-grained cryptography revisited, New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cryptography in constant parallel time
• \(\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 permutations in NC 0
• Linear-size constant-depth polylog-threshold circuits
• Conditionally-perfect secrecy and a provably-secure randomized cipher
• Hardness vs randomness
• Constructing locally computable extractors and cryptosystems in the bounded-storage model
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Secure communications over insecure channels
• On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings
• Public-key cryptography from different assumptions
• The Complexity of Distributions
• Local zero knowledge
• On basing one-way functions on NP-hardness
• Constant depth circuits, Fourier transform, and learnability
• Parity, circuits, and the polynomial-time hierarchy
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Polylogarithmic independence fools AC ⁰ circuits
• A Framework for Efficient and Composable Oblivious Transfer
• New directions in cryptography
• Addendum to “simple constructions of almost k-wise independent random variables”
• A method for obtaining digital signatures and public-key cryptosystems
• A Pseudorandom Generator from any One-way Function
• The knowledge complexity of interactive proof-systems
• An Average-Case Depth Hierarchy Theorem for Boolean Circuits
• Fully homomorphic encryption using ideal lattices
• On the Correlation of Parity and Small-Depth Circuits
• How to use indistinguishability obfuscation
• On Basing Size-Verifiable One-Way Functions on NP-Hardness
• Advances in Cryptology - EUROCRYPT 2004
• Basing Weak Public-Key Cryptography on Strong One-Way Functions
• On ε‐biased generators in NC⁰
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Theory of Cryptography
• On Worst‐Case to Average‐Case Reductions for NP Problems