Pages that link to "Item:Q3591445"
From MaRDI portal
The following pages link to Generalized Compact Knapsacks Are Collision Resistant (Q3591445):
Displaying 50 items.
- Tightly secure signatures from lossy identification schemes (Q315555) (← links)
- On the geometry of cyclic lattices (Q464733) (← links)
- A characterization of chameleon hash functions and new, efficient designs (Q484332) (← links)
- Strongly secure authenticated key exchange from factoring, codes, and lattices (Q494585) (← links)
- Lattices from Hermitian function fields (Q897782) (← links)
- Memory lower bounds of reductions revisited (Q1648781) (← links)
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs (Q1648790) (← links)
- A pseudorandom number generator based on worst-case lattice problems (Q1675485) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- On the tightness of forward-secure signature reductions (Q1715854) (← links)
- Security analysis of cryptosystems using short generators over ideal lattices (Q1756730) (← links)
- Bonsai trees, or how to delegate a lattice basis (Q1928766) (← links)
- A framework for cryptographic problems from linear algebra (Q2023808) (← links)
- MPSign: a signature from small-secret middle-product learning with errors (Q2055685) (← links)
- On the ideal shortest vector problem over random rational primes (Q2056701) (← links)
- On the security of homomorphic encryption on approximate numbers (Q2056709) (← links)
- On the integer polynomial learning with errors problem (Q2061918) (← links)
- Chosen-ciphertext lattice-based public key encryption with equality test in standard model (Q2072076) (← links)
- Random self-reducibility of ideal-SVP via Arakelov random walks (Q2096524) (← links)
- Practical product proofs for lattice commitments (Q2096537) (← links)
- Lattice-based blind signatures, revisited (Q2096538) (← links)
- Cyclic and well-rounded lattices (Q2121980) (← links)
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices (Q2128574) (← links)
- Universal product learning with errors: a new variant of \textsf{LWE} for lattice-based cryptography (Q2143125) (← links)
- Gadget-based iNTRU lattice trapdoors (Q2152053) (← links)
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems (Q2161427) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Lattice trapdoors and IBE from middle-product LWE (Q2175903) (← links)
- On the complexity of collision resistant hash functions: new and old black-box separations (Q2175920) (← links)
- A verifiable threshold secret sharing scheme based on lattices (Q2224837) (← links)
- Trapdoor delegation and HIBE from middle-product LWE in standard model (Q2229268) (← links)
- Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency (Q2334442) (← links)
- Worst-case to average-case reductions for module lattices (Q2345928) (← links)
- Post-quantum cryptography: lattice signatures (Q2390954) (← links)
- Asymptotically efficient lattice-based digital signatures (Q2413615) (← links)
- An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption (Q2629405) (← links)
- Post-quantum online voting scheme (Q2670852) (← links)
- Post-Quantum Cryptography: State of the Art (Q2803619) (← links)
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings (Q2953777) (← links)
- The Geometry of Lattice Cryptography (Q3092183) (← links)
- Parallel Hashing via List Recoverability (Q3457065) (← links)
- Hash Functions from Sigma Protocols and Improvements to VSH (Q3600369) (← links)
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems (Q3600386) (← links)
- On ideal lattices, Gröbner bases and generalized hash functions (Q4563584) (← links)
- The linear transformation that relates the canonical and coefficient embeddings of ideals in cyclotomic integer rings (Q4595068) (← links)
- (Q4638056) (← links)
- Tighter Reductions for Forward-Secure Signature Schemes (Q4916016) (← links)
- Short Bases of Lattices over Number Fields (Q4931647) (← links)
- Improved Zero-Knowledge Identification with Lattices (Q4933208) (← links)
- Interpreting Hash Function Security Proofs (Q4933215) (← links)
