Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
From MaRDI portal
Publication:2475579
DOI10.1007/s00037-007-0234-9zbMath1133.68024OpenAlexW2122086332MaRDI QIDQ2475579
Publication date: 11 March 2008
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-007-0234-9
Cryptography (94A60) Lattices and convex bodies (number-theoretic aspects) (11H06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Cyclic codes (94B15)
Related Items (52)
Cyclic and well-rounded lattices ⋮ On the hardness of module-LWE with binary secret ⋮ An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption ⋮ Tightly secure signatures from lossy identification schemes ⋮ Restricted linear congruences ⋮ Memory lower bounds of reductions revisited ⋮ Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs ⋮ The Modular Subset-Sum Problem and the size of deletion correcting codes ⋮ A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme ⋮ Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography ⋮ Algebraically structured LWE. Revisited ⋮ A pseudorandom number generator based on worst-case lattice problems ⋮ Asymptotically efficient lattice-based digital signatures ⋮ Bonsai trees, or how to delegate a lattice basis ⋮ On the hardness of module learning with errors with short distributions ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ The linear transformation that relates the canonical and coefficient embeddings of ideals in cyclotomic integer rings ⋮ Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) ⋮ Balanced non-adjacent forms ⋮ Hardness of (M)LWE with semi-uniform seeds ⋮ Towards classical hardness of module-LWE: the linear rank case ⋮ An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice ⋮ On the geometry of cyclic lattices ⋮ A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes ⋮ A verifiable threshold secret sharing scheme based on lattices ⋮ On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes ⋮ LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme ⋮ Improved (Hierarchical) Inner-Product Encryption from Lattices ⋮ Security analysis of cryptosystems using short generators over ideal lattices ⋮ Provably Secure NTRU Instances over Prime Cyclotomic Rings ⋮ Short Stickelberger Class Relations and Application to Ideal-SVP ⋮ Short Bases of Lattices over Number Fields ⋮ Improved Zero-Knowledge Identification with Lattices ⋮ Interpreting Hash Function Security Proofs ⋮ (Leveled) Fully Homomorphic Encryption without Bootstrapping ⋮ Cryptographic Functions from Worst-Case Complexity Assumptions ⋮ A framework for cryptographic problems from linear algebra ⋮ Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems ⋮ Towards a ring analogue of the leftover hash lemma ⋮ Asymptotically Efficient Lattice-Based Digital Signatures ⋮ Better Key Sizes (and Attacks) for LWE-Based Encryption ⋮ An Efficient Post-Quantum One-Time Signature Scheme ⋮ On the ideal shortest vector problem over random rational primes ⋮ On the security of homomorphic encryption on approximate numbers ⋮ The Geometry of Lattice Cryptography ⋮ Unnamed Item ⋮ Tightly secure signature schemes from the LWE and subset sum assumptions ⋮ Random self-reducibility of ideal-SVP via Arakelov random walks ⋮ Covert authentication from lattices ⋮ Permutation invariant lattices ⋮ Worst-case to average-case reductions for module lattices
Uses Software
This page was built for publication: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
