On lattices, learning with errors, random linear codes, and cryptography
From MaRDI portal
Publication:5899512
DOI10.1145/1568318.1568324zbMath1325.68101OpenAlexW2007466965WikidataQ130965943 ScholiaQ130965943MaRDI QIDQ5899512
Publication date: 11 November 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1568318.1568324
Linear codes (general theory) (94B05) Quantum computation (81P68) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Relations with coding theory (11H71) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (only showing first 100 items - show all)
Adaptive Simulation Security for Inner Product Functional Encryption ⋮ PAKEs: New Framework, New Techniques and More Efficient Lattice-Based Constructions in the Standard Model ⋮ Constraining and Watermarking PRFs from Milder Assumptions ⋮ Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography ⋮ The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound ⋮ A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties ⋮ Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite ⋮ Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications ⋮ Efficient Construction of Public-Key Matrices in Lattice-Based Cryptography: Chaos Strikes Again ⋮ Message-Restriction-Free Commitment Scheme Based on Lattice Assumption ⋮ A Systematic Approach and Analysis of Key Mismatch Attacks on Lattice-Based NIST Candidate KEMs ⋮ Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations ⋮ LMCLAEKS: LWE-assisted multi-recipient certificateless authenticated encryption with keyword search ⋮ Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ Discretization error reduction for high precision torus fully homomorphic encryption ⋮ Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption ⋮ On the feasibility of single-trace attacks on the Gaussian sampler using a CDT ⋮ A thorough treatment of highly-efficient NTRU instantiations ⋮ Semi-quantum tokenized signatures ⋮ Oblivious message retrieval ⋮ Graphic lattices made by graph felicitous-type labelings and colorings of topological coding ⋮ Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general ⋮ Solving LWR via BDD Strategy: Modulus Switching Approach ⋮ Revisiting the Sparsification Technique in Kannan’s Embedding Attack on LWE ⋮ Hybrid dual and meet-LWE attack ⋮ Classical reduction of gap SVP to LWE: a concrete security analysis ⋮ mrNISC from LWE with polynomial modulus ⋮ Homomorphic encryption: a mathematical survey ⋮ Revocable identity-based fully homomorphic signature scheme with signing key exposure resistance ⋮ Revisiting group oriented secret sharing schemes ⋮ mrNISC from LWE with polynomial modulus ⋮ Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping ⋮ Classically verifiable NIZK for QMA with preprocessing ⋮ Subfield attacks on HSVP in ideal lattices ⋮ On the measurement and simulation of the BKZ behavior for \(q\)-ary lattices ⋮ Identity-based interactive aggregate signatures from lattices ⋮ Cumulatively all-lossy-but-one trapdoor functions from standard assumptions ⋮ Cryptographic primitives with hinting property ⋮ Towards practical topology-hiding computation ⋮ From the hardness of detecting superpositions to cryptography: quantum public key encryption and commitments ⋮ Semantic embedding for quantum algorithms ⋮ Quantum mutual implicit authentication key agreement protocol without entanglement with key recycling ⋮ A framework for practical anonymous credentials from lattices ⋮ A fully secure lattice-based signcryption with designated equality test in standard model ⋮ An Efficient Algorithm for Integer Lattice Reduction ⋮ Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash ⋮ Securing approximate homomorphic encryption using differential privacy ⋮ Maliciously secure massively parallel computation for all-but-one corruptions ⋮ On the hardness of the NTRU problem ⋮ Balanced non-adjacent forms ⋮ Transciphering framework for approximate homomorphic encryption ⋮ A new lattice-based online/offline signatures framework for low-power devices ⋮ Lattice-based inner product argument ⋮ Leveled Hierarchical Identity-Based Fully Homomorphic Encryption from Learning with Rounding ⋮ A New Insight—Proxy Re-encryption Under LWE with Strong Anti-collusion ⋮ A survey on functional encryption ⋮ The direction of updatable encryption does matter ⋮ Public-key encryption from homogeneous CLWE ⋮ Public key authenticated encryption with keyword search from LWE ⋮ No-directional and backward-leak uni-directional updatable encryption are equivalent ⋮ Concrete security from worst-case to average-case lattice reductions ⋮ Fast blind rotation for bootstrapping FHEs ⋮ HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering ⋮ Accelerating HE operations from key decomposition technique ⋮ Simple tests of quantumness also certify qubits ⋮ A detailed analysis of Fiat-Shamir with aborts ⋮ Toward practical lattice-based proof of knowledge from Hint-MLWE ⋮ HRA-secure attribute-based threshold proxy re-encryption from lattices ⋮ \(\mathrm{mR}_{\mathrm{LWE}}\)-CP-ABE: a revocable CP-ABE for post-quantum cryptography ⋮ Subfield algorithms for ideal- and module-SVP based on the decomposition group ⋮ Mathematics of computation through the lens of linear equations and lattices ⋮ A lattice-based forward secure IBE scheme for Internet of things ⋮ Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) ⋮ Deterministic compression with uncertain priors ⋮ Constructing concrete hard instances of the maximum independent set problem ⋮ The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs ⋮ One-Shot Verifiable Encryption from Lattices ⋮ Short Stickelberger Class Relations and Application to Ideal-SVP ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE ⋮ On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ The truth behind the myth of the folk theorem ⋮ Expanders with respect to Hadamard spaces and random graphs ⋮ Unnamed Item ⋮ Limits of local algorithms over sparse random graphs ⋮ Round-optimal secure multi-party computation ⋮ Improved learning of \(k\)-parities ⋮ Verifying quantum computations at scale: A cryptographic leash on quantum devices ⋮ Novel Identity-Based Hash Proof System with Compact Master Public Key from Lattices in the Standard Model ⋮ Sumcheck-based delegation of quantum computing to rational server ⋮ Integer Version of Ring-LWE and Its Applications ⋮ On Quantum Chosen-Ciphertext Attacks and Learning with Errors ⋮ Hardness of bounded distance decoding on lattices in lp norms ⋮ Kissing Numbers and Transference Theorems from Generalized Tail Bounds ⋮ Survey of Lattice-Based Group Signature ⋮ Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS ⋮ Meta-heuristic approaches to solve shortest lattice vector problem ⋮ RLWE/PLWE equivalence for totally real cyclotomic subextensions via quasi-Vandermonde matrices
This page was built for publication: On lattices, learning with errors, random linear codes, and cryptography
