Pages that link to "Item:Q5199207"
From MaRDI portal
The following pages link to Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions (Q5199207):
Displayed 50 items.
- Tightly secure signatures from lossy identification schemes (Q315555) (← links)
- Pseudo-free families of finite computational elementary abelian \(p\)-groups (Q524639) (← links)
- On the tightness of forward-secure signature reductions (Q1715854) (← links)
- A lattice-based group signature scheme with verifier-local revocation (Q1749538) (← links)
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance (Q1753174) (← links)
- On the structure of Boolean functions with small spectral norm (Q2012184) (← links)
- Verifiable single-server private information retrieval from LWE with binary errors (Q2055570) (← links)
- Multiparty reusable non-interactive secure computation from LWE (Q2056764) (← links)
- Shorter lattice-based zero-knowledge proofs via one-time commitments (Q2061919) (← links)
- Rounding in the rings (Q2096527) (← links)
- Hardness of LWE on general entropic distributions (Q2119024) (← links)
- Key-homomorphic pseudorandom functions from LWE with small modulus (Q2119025) (← links)
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems (Q2161427) (← links)
- Obfuscated fuzzy Hamming distance and conjunctions from subset product problems (Q2175905) (← links)
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease (Q2317863) (← links)
- Tightly secure signature schemes from the LWE and subset sum assumptions (Q2330120) (← links)
- Naor-Yung paradigm with shared randomness and applications (Q2401764) (← links)
- On the hardness of module learning with errors with short distributions (Q2677644) (← links)
- Cryptographic group actions and applications (Q2692390) (← links)
- On the Hardness of Learning with Rounding over Small Modulus (Q2796126) (← links)
- Decompositions of Triangle-Dense Graphs (Q2796209) (← links)
- How (Not) to Instantiate Ring-LWE (Q2827731) (← links)
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions (Q2829952) (← links)
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security (Q2829953) (← links)
- Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts (Q2835588) (← links)
- Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN (Q2835589) (← links)
- Lattice-based FHE as secure as PKE (Q2988863) (← links)
- Cryptogenography (Q2988864) (← links)
- Limits of random oracles in secure computation (Q2988865) (← links)
- Non-commutative arithmetic circuits with division (Q2988867) (← links)
- Decision trees, protocols and the entropy-influence conjecture (Q2988868) (← links)
- Locally testable codes and cayley graphs (Q2988869) (← links)
- Invitation games and the price of stability (Q2988870) (← links)
- Welfare maximization and truthfulness in mechanism design with ordinal preferences (Q2988871) (← links)
- Coordination mechanisms from (almost) all scheduling policies (Q2988872) (← links)
- Private interactive communication across an adversarial channel (Q2988873) (← links)
- Tree codes and a conjecture on exponential sums (Q2988874) (← links)
- Capacity of non-malleable codes (Q2988875) (← links)
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications (Q2988877) (← links)
- Adversarial hypothesis testing and a quantum stein's lemma for restricted measurements (Q2988878) (← links)
- Sequential decision making with vector outcomes (Q2988880) (← links)
- Learning mixtures of arbitrary distributions over large discrete domains (Q2988881) (← links)
- Why do simple algorithms for triangle enumeration work in the real world? (Q2988883) (← links)
- Black-box obfuscation for d-CNFs (Q2988884) (← links)
- Candidate weak pseudorandom functions in AC <sup>0</sup> ○ MOD <sub>2</sub> (Q2988885) (← links)
- Iterated group products and leakage resilience against NC1 (Q2988886) (← links)
- Building one-time memories from isolated qubits (Q2988887) (← links)
- Attribute-efficient evolvability of linear functions (Q2988888) (← links)
- Energy-efficient circuit design (Q2988889) (← links)
- Rate-independent computation in continuous chemical reaction networks (Q2988890) (← links)
