Pages that link to "Item:Q5899512"

The following pages link to On lattices, learning with errors, random linear codes, and cryptography (Q5899512):

Displaying 50 items.

• Practical FHE parameters against lattice attacks (Q5034914) (← links)
• Meta-heuristic approaches to solve shortest lattice vector problem (Q5035010) (← links)
• RLWE/PLWE equivalence for totally real cyclotomic subextensions via quasi-Vandermonde matrices (Q5039762) (← links)
• A Lattice-Based Certificateless Public Key Encryption with Equality Test in Standard Model (Q5040375) (← links)
• Attribute-Based Keyword Search from Lattices (Q5040376) (← links)
• Adaptive Simulation Security for Inner Product Functional Encryption (Q5041151) (← links)
• PAKEs: New Framework, New Techniques and More Efficient Lattice-Based Constructions in the Standard Model (Q5041165) (← links)
• Constraining and Watermarking PRFs from Milder Assumptions (Q5041166) (← links)
• Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography (Q5041172) (← links)
• The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound (Q5041235) (← links)
• A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties (Q5056025) (← links)
• Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite (Q5056039) (← links)
• Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications (Q5087262) (← links)
• On Quantum Chosen-Ciphertext Attacks and Learning with Errors (Q5089145) (← links)
• (Q5091027) (← links)
• Hardness of bounded distance decoding on lattices in lp norms (Q5092487) (← links)
• Efficient Construction of Public-Key Matrices in Lattice-Based Cryptography: Chaos Strikes Again (Q5095920) (← links)
• Message-Restriction-Free Commitment Scheme Based on Lattice Assumption (Q5095924) (← links)
• Constructing concrete hard instances of the maximum independent set problem (Q5149679) (← links)
• The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) (← links)
• Verifying quantum computations at scale: A cryptographic leash on quantum devices (Q5204995) (← links)
• Novel Identity-Based Hash Proof System with Compact Master Public Key from Lattices in the Standard Model (Q5205013) (← links)
• Integer Version of Ring-LWE and Its Applications (Q5216985) (← links)
• Kissing Numbers and Transference Theorems from Generalized Tail Bounds (Q5232155) (← links)
• Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) (Q5240427) (← links)
• On Ideal Lattices and Learning with Errors over Rings (Q5395738) (← links)
• Classical hardness of learning with errors (Q5495828) (← links)
• One-Shot Verifiable Encryption from Lattices (Q5738881) (← links)
• Short Stickelberger Class Relations and Application to Ideal-SVP (Q5738882) (← links)
• Private Puncturable PRFs from Standard Lattice Assumptions (Q5738885) (← links)
• Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE (Q5738886) (← links)
• On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL (Q5738971) (← links)
• Magic Adversaries Versus Individual Reduction: Science Wins Either Way (Q5738980) (← links)
• Survey of Lattice-Based Group Signature (Q5855889) (← links)
• Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS (Q5859732) (← links)
• Expanders with respect to Hadamard spaces and random graphs (Q5892453) (← links)
• Limits of local algorithms over sparse random graphs (Q5892454) (← links)
• Deterministic compression with uncertain priors (Q5892455) (← links)
• The truth behind the myth of the folk theorem (Q5892456) (← links)
• Round-optimal secure multi-party computation (Q5918346) (← links)
• Improved learning of \(k\)-parities (Q5918966) (← links)
• Sumcheck-based delegation of quantum computing to rational server (Q5925559) (← links)
• A Systematic Approach and Analysis of Key Mismatch Attacks on Lattice-Based NIST Candidate KEMs (Q6041281) (← links)
• Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations (Q6041285) (← links)
• LMCLAEKS: LWE-assisted multi-recipient certificateless authenticated encryption with keyword search (Q6052672) (← links)
• Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs (Q6057185) (← links)
• Functional commitments for all functions, with transparent setup and from SIS (Q6063522) (← links)
• Discretization error reduction for high precision torus fully homomorphic encryption (Q6067349) (← links)
• A thorough treatment of highly-efficient NTRU instantiations (Q6091128) (← links)
• Semi-quantum tokenized signatures (Q6097266) (← links)