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.
- Oblivious message retrieval (Q6097269) (← links)
- Graphic lattices made by graph felicitous-type labelings and colorings of topological coding (Q6103472) (← links)
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general (Q6104329) (← links)
- Solving LWR via BDD Strategy: Modulus Switching Approach (Q6104634) (← links)
- Revisiting the Sparsification Technique in Kannan’s Embedding Attack on LWE (Q6108625) (← links)
- Classical reduction of gap SVP to LWE: a concrete security analysis (Q6112249) (← links)
- mrNISC from LWE with polynomial modulus (Q6116180) (← links)
- Homomorphic encryption: a mathematical survey (Q6118172) (← links)
- Revocable identity-based fully homomorphic signature scheme with signing key exposure resistance (Q6118648) (← links)
- Revisiting group oriented secret sharing schemes (Q6125457) (← links)
- Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping (Q6132408) (← links)
- Classically verifiable NIZK for QMA with preprocessing (Q6134001) (← links)
- Subfield attacks on HSVP in ideal lattices (Q6134036) (← links)
- On the measurement and simulation of the BKZ behavior for \(q\)-ary lattices (Q6134037) (← links)
- Identity-based interactive aggregate signatures from lattices (Q6134230) (← links)
- Cumulatively all-lossy-but-one trapdoor functions from standard assumptions (Q6134825) (← links)
- mrNISC from LWE with polynomial modulus (Q6134835) (← links)
- Cryptographic primitives with hinting property (Q6135390) (← links)
- Towards practical topology-hiding computation (Q6135413) (← links)
- Quantum mutual implicit authentication key agreement protocol without entanglement with key recycling (Q6145368) (← links)
- A fully secure lattice-based signcryption with designated equality test in standard model (Q6153219) (← links)
- An Efficient Algorithm for Integer Lattice Reduction (Q6154950) (← links)
- Securing approximate homomorphic encryption using differential privacy (Q6155269) (← links)
- Maliciously secure massively parallel computation for all-but-one corruptions (Q6155275) (← links)
- On the hardness of the NTRU problem (Q6157484) (← links)
- Balanced non-adjacent forms (Q6157562) (← links)
- Transciphering framework for approximate homomorphic encryption (Q6157566) (← links)
- A new lattice-based online/offline signatures framework for low-power devices (Q6159029) (← links)
- Lattice-based inner product argument (Q6160829) (← links)
- Leveled Hierarchical Identity-Based Fully Homomorphic Encryption from Learning with Rounding (Q6163655) (← links)
- A New Insight—Proxy Re-encryption Under LWE with Strong Anti-collusion (Q6163695) (← links)
- A survey on functional encryption (Q6163797) (← links)
- The direction of updatable encryption does matter (Q6169034) (← links)
- Public-key encryption from homogeneous CLWE (Q6169421) (← links)
- No-directional and backward-leak uni-directional updatable encryption are equivalent (Q6173296) (← links)
- HRA-secure attribute-based threshold proxy re-encryption from lattices (Q6192306) (← links)
- \(\mathrm{mR}_{\mathrm{LWE}}\)-CP-ABE: a revocable CP-ABE for post-quantum cryptography (Q6193390) (← links)
- Subfield algorithms for ideal- and module-SVP based on the decomposition group (Q6196952) (← links)
- Mathematics of computation through the lens of linear equations and lattices (Q6198651) (← links)
- A lattice-based forward secure IBE scheme for Internet of things (Q6198752) (← links)
- Lattice-Based DAPS and Generalizations: Self-enforcement in Signature Schemes (Q6487214) (← links)
- Oblivious Online Monitoring for Safety LTL Specification via Fully Homomorphic Encryption (Q6487325) (← links)
- BS: Blockwise Sieve Algorithm for Finding Short Vectors from Sublattices (Q6487348) (← links)
- Accelerating Lattice Based Proxy Re-encryption Schemes on GPUs (Q6488041) (← links)
- Spherical Gaussian leftover hash lemma via the Rényi divergence (Q6535100) (← links)
- Adaptively secure identity-based encryption from middle-product learning with errors (Q6535491) (← links)
- Ciphertext policy attribute-based encryption for circuits from LWE assumption (Q6536220) (← links)
- Cryptographic primitives with hinting property (Q6536746) (← links)
- Watermarking PRFs and PKE against quantum adversaries (Q6536747) (← links)
- Revisiting key switching techniques with applications to light-key FHE (Q6547847) (← links)
