Pages that link to "Item:Q5901106"
From MaRDI portal
The following pages link to On lattices, learning with errors, random linear codes, and cryptography (Q5901106):
Displaying 50 items.
- (Leveled) fully homomorphic encryption without bootstrapping (Q92720) (← links)
- On random nonsingular Hermite normal form (Q266588) (← links)
- On solving LPN using BKW and variants, Implementation and analysis (Q276557) (← links)
- Signature schemes secure against hard-to-invert leakage (Q290397) (← links)
- Policy-based signature scheme from lattices (Q306050) (← links)
- New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors (Q393183) (← links)
- Quantum private comparison over noisy channels (Q496932) (← links)
- Generating shorter bases for hard random lattices (Q537918) (← links)
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device (Q742507) (← links)
- A new scale-invariant homomorphic encryption scheme (Q781008) (← links)
- Noisy Simon period finding (Q826245) (← links)
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
- Dual lattice attacks for closest vector problems (with preprocessing) (Q826277) (← links)
- On the hardness of module-LWE with binary secret (Q826282) (← links)
- Balancing access control and privacy for data deduplication via functional encryption (Q826391) (← links)
- SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions (Q831176) (← links)
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- Separating models of learning with faulty teachers (Q1017667) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- Lattice-based key exchange on small integer solution problem (Q1616180) (← links)
- Two-round MPC: information-theoretic and black-box (Q1629402) (← links)
- Two-message statistically sender-private OT from LWE (Q1631337) (← links)
- Adaptively secure distributed PRFs from LWE (Q1631339) (← links)
- Return of GGH15: provable security against zeroizing attacks (Q1631349) (← links)
- LWE without modular reduction and improved side-channel attacks against BLISS (Q1633471) (← links)
- Quantum algorithms for the \(k\)-XOR problem (Q1633472) (← links)
- Regular lossy functions and their applications in leakage-resilient cryptography (Q1643156) (← links)
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm (Q1643980) (← links)
- Memory lower bounds of reductions revisited (Q1648781) (← links)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
- Another step towards realizing random oracles: non-malleable point obfuscation (Q1648795) (← links)
- A novel model for lattice-based authorized searchable encryption with special keyword (Q1665334) (← links)
- A pseudorandom number generator based on worst-case lattice problems (Q1675485) (← links)
- Hardness of \(k\)-LWE and applications in traitor tracing (Q1688407) (← links)
- On the asymptotic complexity of solving LWE (Q1692148) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Efficient authentication from hard learning problems (Q1698400) (← links)
- Post-quantum key exchange for the Internet and the open quantum safe project (Q1698609) (← links)
- Leakage-resilient cryptography from puncturable primitives and obfuscation (Q1710617) (← links)
- Decentralized multi-client functional encryption for inner product (Q1710623) (← links)
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH (Q1710687) (← links)
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption (Q1711842) (← links)
- Assessing the feasibility of single trace power analysis of Frodo (Q1726676) (← links)
- Minimal condition for shortest vectors in lattices of low dimension (Q1739940) (← links)
- Efficient reductions in cyclotomic rings -- application to Ring LWE based FHE schemes (Q1746962) (← links)
- HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption (Q1746967) (← links)
- A lattice-based group signature scheme with verifier-local revocation (Q1749538) (← links)
- The polynomial approximate common divisor problem and its application to the fully homomorphic encryption (Q1750401) (← links)
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance (Q1753174) (← links)
