Pages that link to "Item:Q5899512"
From MaRDI portal
The following pages link to On lattices, learning with errors, random linear codes, and cryptography (Q5899512):
Displaying 50 items.
- Scalable revocable identity-based signature over lattices in the standard model (Q2662710) (← links)
- On the RLWE/PLWE equivalence for cyclotomic number fields (Q2668220) (← links)
- Cryptographic algorithms for privacy-preserving online applications (Q2668547) (← links)
- When NTT meets Karatsuba: preprocess-then-NTT technique revisited (Q2672460) (← links)
- Quantum learning Boolean linear functions w.r.t. product distributions (Q2677243) (← links)
- Quantum algorithms for typical hard problems: a perspective of cryptanalysis (Q2677252) (← links)
- On the hardness of module learning with errors with short distributions (Q2677644) (← links)
- On optimizing electricity markets performance (Q2679792) (← links)
- Adaptively secure inner product encryption from LWE (Q2691591) (← links)
- Towards classical hardness of module-LWE: the linear rank case (Q2692385) (← links)
- Security limitations of classical-client delegated quantum computing (Q2692401) (← links)
- Unclonable encryption, revisited (Q2695639) (← links)
- Simulatable verifiable random function from the LWE assumption (Q2700784) (← links)
- Finding Shortest Lattice Vectors in the Presence of Gaps (Q2790044) (← links)
- Adaptive Security with Quasi-Optimal Rate (Q2796140) (← links)
- Decompositions of triangle-dense graphs (Q2796209) (← links)
- Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem (Q2796401) (← links)
- A Noiseless Key-Homomorphic PRF: Application on Distributed Storage Systems (Q2817833) (← links)
- A novel fully homomorphic encryption scheme bsed on LWE (Q2825264) (← links)
- Naor-Yung Paradigm with Shared Randomness and Applications (Q2827710) (← links)
- How (Not) to Instantiate Ring-LWE (Q2827731) (← links)
- Sampling exactly from the normal distribution (Q2828164) (← links)
- Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE (Q2829234) (← links)
- Spooky Encryption and Its Applications (Q2829944) (← links)
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions (Q2829952) (← links)
- On CCA-Secure Somewhat Homomorphic Encryption (Q2889863) (← links)
- Lattice Point Enumeration on Block Reduced Bases (Q2947536) (← links)
- On error distributions in ring-based LWE (Q2971006) (← links)
- Non-Random Coding Error Bounds for Lattices (Q2977037) (← links)
- A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$ (Q2988333) (← links)
- Analysis of Error Terms of Signatures Based on Learning with Errors (Q2988339) (← 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)
