Pages that link to "Item:Q4829810"
From MaRDI portal
The following pages link to Complexity of lattice problems. A cryptographic perspective. (Q4829810):
Displaying 50 items.
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Optimum commutative group codes (Q2256103) (← links)
- Restricted parameter range promise set cover problems are easy (Q2258109) (← links)
- The RSA group is pseudo-free (Q2267366) (← links)
- Local formulas for Ehrhart coefficients from lattice tiles (Q2292908) (← links)
- A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths (Q2329392) (← links)
- Worst-case to average-case reductions for module lattices (Q2345928) (← links)
- The remote set problem on lattices (Q2353188) (← links)
- Torsion \(\mathbb Z\)-module and torsion-free \(\mathbb Z\)-module (Q2353430) (← links)
- Embedded lattice and properties of Gram matrix (Q2356940) (← links)
- Post-quantum cryptography: lattice signatures (Q2390954) (← links)
- Dense packings from algebraic number fields and codes (Q2396759) (← links)
- Duplication free public keys based on SIS-type problems (Q2406699) (← links)
- Dual lattice of \(\mathbb{Z}\)-module lattice (Q2407510) (← links)
- List-decoding Barnes-Wall lattices (Q2410678) (← links)
- On projections of arbitrary lattices (Q2435418) (← links)
- On the probability of generating a lattice (Q2437315) (← links)
- Recovering a sum of two squares decomposition (Q2437316) (← links)
- Cubic sieve congruence of the discrete logarithm problem, and fractional part sequences (Q2437317) (← links)
- Lattice-based completely non-malleable public-key encryption in the standard model (Q2448075) (← links)
- Fast LLL-type lattice reduction (Q2490117) (← links)
- Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms (Q2490259) (← links)
- Nonembeddability theorems via Fourier analysis (Q2491108) (← links)
- Matrix of \(\mathbb{Z}\)-module (Q2515742) (← links)
- Characterizing the performance of wireless communication architectures via basic Diophantine approximation bounds (Q2658389) (← links)
- Discrete Gaussian measures and new bounds of the smoothing parameter for lattices (Q2666966) (← links)
- Cryptanalysis of Boyen's attribute-based encryption scheme in TCC 2013 (Q2673979) (← links)
- On the equivalence of two post-quantum cryptographic families (Q2687966) (← links)
- Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices (Q2692387) (← links)
- The irreducible vectors of a lattice: some theory and applications (Q2698346) (← links)
- Cryptographic Assumptions: A Position Paper (Q2796139) (← links)
- Quotient module of \(\mathbb Z\)-module (Q2852158) (← links)
- Free \(\mathbb Z\)-module (Q2852170) (← links)
- Formalization of integral linear space (Q2865731) (← links)
- \(\mathbb Z\)-modules (Q2865761) (← links)
- A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors (Q2942829) (← links)
- Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
- Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle (Q3088093) (← links)
- The Geometry of Lattice Cryptography (Q3092183) (← links)
- Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2 (Q3104703) (← links)
- Recovering zeros of polynomials modulo a prime (Q3189458) (← links)
- The Reductions for the Approximating Covering Radius Problem (Q3297478) (← links)
- Two Efficient Tag-Based Encryption Schemes on Lattices (Q3297485) (← links)
- Simplified Revocable Hierarchical Identity-Based Encryption from Lattices (Q3297616) (← links)
- An LWE-based verifiable threshold secret sharing scheme (Q3383067) (← links)
- Zero-Knowledge Interactive Proof Systems for New Lattice Problems (Q3460104) (← links)
- Lattice problems in NP ∩ coNP (Q3546284) (← links)
- Bounding the sum of square roots via lattice reduction (Q3584821) (← links)
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures (Q3593101) (← links)
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems (Q3600386) (← links)
