Fine-grained secure computation
From MaRDI portal
Publication:1631318
DOI10.1007/978-3-030-03810-6_3zbMath1430.94061OpenAlexW2805218201MaRDI QIDQ1631318
Rosario Gennaro, Matteo Campanelli
Publication date: 6 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03810-6_3
Related Items (6)
Fine-grained secure attribute-based encryption ⋮ Non-interactive zero-knowledge proofs with fine-grained security ⋮ Fine-grained non-interactive key-exchange: constructions and lower bounds ⋮ 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
- Unnamed Item
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- One-way permutations in NC 0
- Efficient rational proofs for space bounded computations
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Secure communications over insecure channels
- Practical verified computation with streaming interactive proofs
- Fine-Grained Cryptography
- Sequentially Composable Rational Proofs
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Improved Delegation of Computation Using Fully Homomorphic Encryption
- From Secrecy to Soundness: Efficient Verification via Secure Computation
- Foundations of Cryptography
- The Knowledge Complexity of Interactive Proof Systems
- Foundations of Cryptography
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Average-case fine-grained hardness
- Fully homomorphic encryption using ideal lattices
- Rational proofs
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- Cryptography in $NC^0$
This page was built for publication: Fine-grained secure computation
