Pages that link to "Item:Q3088173"

The following pages link to Collision-Free Hashing from Lattice Problems (Q3088173):

Displaying 23 items.

• Generating shorter bases for hard random lattices (Q537918) (← links)
• A relation of primal--dual lattices and the complexity of shortest lattice vector problem (Q1274988) (← links)
• Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
• The hunting of the SNARK (Q1698394) (← links)
• A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor (Q1861566) (← links)
• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
• Efficient proof composition for verifiable computation (Q2167734) (← links)
• Quantum algorithms for variants of average-case lattice problems via filtering (Q2170094) (← links)
• On the complexity of collision resistant hash functions: new and old black-box separations (Q2175920) (← links)
• Sharing privacy protected and statistically sound clinical research data using outsourced data storage (Q2336386) (← links)
• Lattice-based completely non-malleable public-key encryption in the standard model (Q2448075) (← links)
• How to Prove Knowledge of Small Secrets (Q2829957) (← links)
• Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption (Q2953774) (← links)
• An LWE-based verifiable threshold secret sharing scheme (Q3383067) (← links)
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems (Q3600386) (← links)
• (Q4638056) (← links)
• New Constructions for Secure Hash Functions (Q4639447) (← links)
• Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack (Q5738887) (← links)
• Improvements in the analysis of Kannan's CVP algorithm (Q5964026) (← links)
• The Phase Transition of Discrepancy in Random Hypergraphs (Q6046817) (← links)
• Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors (Q6110389) (← links)
• The Boneh-Katz transformation, revisited: pseudorandom/obliviously-samplable PKE from lattices and codes and its application (Q6618581) (← links)
• Lossy cryptography from code-based assumptions (Q6652889) (← links)