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.
- An optimized GHV-type HE scheme: simpler, faster, and more versatile (Q2096603) (← links)
- A new post-quantum multivariate polynomial public key encapsulation algorithm (Q2102772) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- Improved lattice enumeration algorithms by primal and dual reordering methods (Q2104429) (← links)
- Leveraging the hardness of dihedral coset problem for quantum cryptography (Q2104711) (← links)
- An improved quantum algorithm for the quantum learning with errors problem (Q2107929) (← links)
- Password protected secret sharing from lattices (Q2117043) (← links)
- On removing rejection conditions in practical lattice-based signatures (Q2118558) (← links)
- Key-homomorphic pseudorandom functions from LWE with small modulus (Q2119025) (← links)
- Compact ring signatures from learning with errors (Q2120080) (← links)
- A black-box approach to post-quantum zero-knowledge in constant rounds (Q2120081) (← links)
- Multi-theorem designated-verifier NIZK for QMA (Q2120083) (← links)
- Shortest vectors in lattices of Bai-Galbraith's embedding attack on the LWR problem (Q2128750) (← links)
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time (Q2139652) (← links)
- Attribute-based conditional proxy re-encryption in the standard model under LWE (Q2148755) (← links)
- Cross-domain attribute-based access control encryption (Q2149810) (← links)
- On the higher-bit version of approximate inhomogeneous short integer solution problem (Q2149828) (← links)
- Non-commutative ring learning with errors from cyclic algebras (Q2154559) (← links)
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
- Lattice-based public-key encryption with equality test supporting flexible authorization in standard model (Q2166741) (← links)
- Practical non-interactive publicly verifiable secret sharing with thousands of parties (Q2170010) (← links)
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption (Q2170018) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- Watermarking PRFs against quantum adversaries (Q2170100) (← links)
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography (Q2170105) (← links)
- Constant-round blind classical verification of quantum sampling (Q2170108) (← links)
- From cryptomania to obfustopia through secret-key functional encryption (Q2175212) (← links)
- Algebraically structured LWE. Revisited (Q2175901) (← links)
- Matrix PRFs: constructions, attacks, and applications to obfuscation (Q2175904) (← links)
- Compressible FHE with applications to PIR (Q2175949) (← links)
- Group signature from lattices preserving forward security in dynamic setting (Q2210634) (← links)
- Reinforcement learning for optimal error correction of toric codes (Q2213126) (← links)
- Lattice-based proxy-oriented identity-based encryption with keyword search for cloud storage (Q2215031) (← links)
- Computational fuzzy extractors (Q2216116) (← links)
- The projection games conjecture and the hardness of approximation of Super-SAT and related problems (Q2237900) (← links)
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus (Q2329396) (← links)
- Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency (Q2334442) (← links)
- Sharing privacy protected and statistically sound clinical research data using outsourced data storage (Q2336386) (← links)
- Worst-case to average-case reductions for module lattices (Q2345928) (← links)
- Efficient cryptosystems from \(2^k\)-th power residue symbols (Q2397448) (← links)
- Naor-Yung paradigm with shared randomness and applications (Q2401764) (← links)
- Comparison analysis of Ding's RLWE-based key exchange protocol and NewHope variants (Q2415387) (← links)
- Improved analysis of the reduction from BDD to uSVP (Q2419802) (← links)
- Solving the learning parity with noise's open question (Q2444770) (← links)
- A lattice-based signcryption scheme without random oracles (Q2515427) (← links)
- Error analysis of weak poly-LWE instances (Q2632837) (← links)
- A note on the concrete hardness of the shortest independent vector in lattices (Q2656338) (← links)
- A unified framework of identity-based sequential aggregate signatures from 2-level HIBE schemes (Q2660907) (← links)
- Toward non-interactive zero-knowledge proofs for NP from LWE (Q2661693) (← links)
- Bootstrapping for helib (Q2661696) (← links)
