Generalized Compact Knapsacks Are Collision Resistant
From MaRDI portal
Recommendations
Cited in
(96)- Memory lower bounds of reductions revisited
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- A pseudorandom number generator based on worst-case lattice problems
- Scalable zero knowledge via cycles of elliptic curves
- On the tightness of forward-secure signature reductions
- Security analysis of cryptosystems using short generators over ideal lattices
- Bonsai trees, or how to delegate a lattice basis
- A framework for cryptographic problems from linear algebra
- MPSign: a signature from small-secret middle-product learning with errors
- On the ideal shortest vector problem over random rational primes
- On the security of homomorphic encryption on approximate numbers
- On the integer polynomial learning with errors problem
- Chosen-ciphertext lattice-based public key encryption with equality test in standard model
- Random self-reducibility of ideal-SVP via Arakelov random walks
- Practical product proofs for lattice commitments
- Lattice-based blind signatures, revisited
- Cyclic and well-rounded lattices
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- Universal product learning with errors: a new variant of \textsf{LWE} for lattice-based cryptography
- Gadget-based iNTRU lattice trapdoors
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
- Asymptotically quasi-optimal cryptography
- Lattice trapdoors and IBE from middle-product LWE
- On the complexity of collision resistant hash functions: new and old black-box separations
- A verifiable threshold secret sharing scheme based on lattices
- Trapdoor delegation and HIBE from middle-product LWE in standard model
- Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency
- Worst-case to average-case reductions for module lattices
- Post-quantum cryptography: lattice signatures
- Asymptotically efficient lattice-based digital signatures
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption
- Post-quantum online voting scheme
- Post-quantum cryptography: state of the art
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
- Collision-free hashing from lattice problems
- The geometry of lattice cryptography
- Tightly secure signatures from lossy identification schemes
- Parallel Hashing via List Recoverability
- Hash Functions from Sigma Protocols and Improvements to VSH
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Secure parameters for SWIFFT
- scientific article; zbMATH DE number 1088903 (Why is no real title available?)
- On ideal lattices, Gröbner bases and generalized hash functions
- The linear transformation that relates the canonical and coefficient embeddings of ideals in cyclotomic integer rings
- Low-complexity cryptographic hash functions
- On the geometry of cyclic lattices
- A characterization of chameleon hash functions and new, efficient designs
- Tighter Reductions for Forward-Secure Signature Schemes
- Short bases of lattices over number fields
- Improved Zero-Knowledge Identification with Lattices
- Interpreting hash function security proofs
- Strongly secure authenticated key exchange from factoring, codes, and lattices
- A Parallel GPU Implementation of SWIFFTX
- Compact privacy protocols from post-quantum and timed classical assumptions
- Cryptographic functions from worst-case complexity assumptions
- Integer version of ring-LWE and its applications
- On Lattices Generated by Finite Abelian Groups
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Asymptotically Efficient Lattice-Based Digital Signatures
- One-shot verifiable encryption from lattices
- Short Stickelberger class relations and application to Ideal-SVP
- On ideal class group computation of imaginary multiquadratic fields
- Theory of Cryptography
- Functional commitments for all functions, with transparent setup and from SIS
- Optimisations and tradeoffs for HElib
- A thorough treatment of highly-efficient NTRU instantiations
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Practical sublinear proofs for R1CS from lattices
- Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem
- Fiat-Shamir signatures based on module-NTRU
- Verifiable Decryption for Fully Homomorphic Encryption
- Roadmap of post-quantum cryptography standardization: side-channel attacks and countermeasures
- A new lattice-based online/offline signatures framework for low-power devices
- Reductions from module lattices to free module lattices, and application to dequantizing module-LLL
- Lattice-Based DAPS and Generalizations: Self-enforcement in Signature Schemes
- Fast Fourier Orthogonalization over NTRU Lattices
- Scalable CCA-secure public-key authenticated encryption with keyword search from ideal lattices in cloud computing
- Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
- Ideal-SVP is hard for small-norm uniform prime ideals
- Algebraically structured LWE, revisited
- A generalization of NTRUEncrypt
- Cyclic lattices, ideal lattices, and bounds for the smoothing parameter
- On the high dimensional RSA algorithm -- a public key cryptosystem based on lattice and algebraic number theory
- Discriminants of number fields
- On algebraic embedding for unstructured lattices
- Ring signatures for deniable AKEM: Gandalf's fellowship
- On two signature variants of Buchberger's algorithm over principal ideal domains
- \textsf{LatticeFold+}: faster, simpler, shorter lattice-based folding for succinct proof systems
- Module learning with errors with truncated matrices
- Current paradigms for construction of lattice-based digital signature schemes
- \textsf{LatticeFold}: a lattice-based folding scheme and its applications to succinct proof systems
- A closer look at \textsc{Falcon}
- \textsf{ABBA}: lattice-based commitments from commutators
- More efficient lattice-based electronic voting from NTRU
- Lattices from Hermitian function fields
This page was built for publication: Generalized Compact Knapsacks Are Collision Resistant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591445)
