Public-key cryptography from different assumptions
From MaRDI portal
Recommendations
Cited in
(53)- On the complexity of random satisfiability problems with planted solutions
- Expander-Based Cryptography Meets Natural Proofs
- A nearly tight sum-of-squares lower bound for the planted clique problem
- Indistinguishability obfuscation from bilinear maps and LPN variants
- Public-key cryptography in the fine-grained setting
- scientific article; zbMATH DE number 5666449 (Why is no real title available?)
- Sherali-Adams integrality gaps matching the log-density threshold
- On the one-way function candidate proposed by Goldreich
- Indistinguishability obfuscation from well-founded assumptions
- Computational barriers in minimax submatrix detection
- scientific article; zbMATH DE number 7758323 (Why is no real title available?)
- Approximation algorithms and hardness of the \(k\)-route cut problem
- Solving the learning parity with noise's open question
- Expander-based cryptography meets natural proofs
- Cryptography from planted graphs: security with logarithmic-size messages
- Public-key encryption, local pseudorandom generators, and the low-degree method
- The densest k-subhypergraph problem
- Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning
- Fast pseudorandom functions based on expander graphs
- Public-key encryption from homogeneous CLWE
- Breaking thermaxBarrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem
- A dichotomy for local small-bias generators
- On the security of Goldreich's one-way function
- The strongish planted clique hypothesis and its consequences
- Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
- Fast pseudorandom correlation functions from sparse LPN
- Pseudorandom correlation generators for multiparty Beaver triples over \(\mathbb{F}_2\)
- Slightly sublinear trapdoor hash functions and PIR from low-noise LPN
- Cryptographic hardness of random local functions. Survey
- Fine-Grained Cryptography
- On public key encryption from noisy codewords
- Indistinguishability obfuscation
- Cryptography from learning parity with noise
- From laconic zero-knowledge to public-key cryptography. Extended abstract
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error
- \(k\)-SUM in the sparse regime: complexity and applications
- Structure versus hardness through the obfuscation lens
- \textsf{BitGC}: garbled circuits with 1 bit per gate
- Fine-grained complexity in a world without cryptography
- New Algorithms for Learning in Presence of Errors
- Candidate one-way functions based on expander graphs
- A systematic study of sparse LWE
- Lossy cryptography from code-based assumptions
- Is ML-based cryptanalysis inherently limited? Simulating cryptographic adversaries via gradient-based methods
- Hardness self-amplification: simplified, optimized, and unified
- Somewhat homomorphic encryption from linear homomorphism and sparse LPN
- Sum-of-squares lower bounds for densest k-subgraph
- Input locality and hardness amplification
- The Complexity of Public-Key Cryptography
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting)
- Algebraic attacks against random local functions and their countermeasures
- Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
- Polynomial integrality gaps for strong SDP relaxations of densest k-subgraph
This page was built for publication: Public-key cryptography from different assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875143)
