The following pages link to Vadim Lyubashevsky (Q315553):
Displaying 32 items.
- Tightly secure signatures from lossy identification schemes (Q315555) (← links)
- A note on the distribution of the distance from a lattice (Q1006407) (← links)
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs (Q1648790) (← links)
- A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model (Q1653109) (← links)
- Amortization with fewer equations for proving knowledge of small secrets (Q1675209) (← links)
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits (Q1784111) (← links)
- More efficient commitments from structured lattice assumptions (Q1796807) (← links)
- Shorter lattice-based zero-knowledge proofs via one-time commitments (Q2061919) (← links)
- A non-PCP approach to succinct quantum-safe zero-knowledge (Q2096535) (← links)
- Practical product proofs for lattice commitments (Q2096537) (← links)
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions (Q2128577) (← links)
- More efficient amortization of exact zero-knowledge proofs for LWE (Q2148770) (← links)
- Practical non-interactive publicly verifiable secret sharing with thousands of parties (Q2170010) (← links)
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs (Q2181849) (← links)
- Short discrete log proofs for FHE and ring-LWE ciphertexts (Q2289214) (← links)
- Worst-case hardness for LPN and cryptographic hashing via code smoothing (Q2292709) (← links)
- Asymptotically efficient lattice-based digital signatures (Q2413615) (← links)
- Geometry of jump systems (Q2496908) (← links)
- The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs (Q2827724) (← links)
- Lattice Signatures and Bimodal Gaussians (Q2845659) (← links)
- Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs (Q2849403) (← links)
- Tightly-Secure Signatures from Lossy Identification Schemes (Q2894432) (← links)
- Lattice Signatures without Trapdoors (Q2894441) (← links)
- From Selective to Full Security: Semi-generic Transformations in the Standard Model (Q2900225) (← links)
- Efficient Identity-Based Encryption over NTRU Lattices (Q2936597) (← links)
- Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures (Q2938865) (← links)
- Simple Lattice Trapdoor Sampling from a Broad Class of Distributions (Q2941217) (← links)
- Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices (Q2948355) (← links)
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings (Q2953777) (← links)
- Lattice-Based Signatures: Optimization and Implementation on Reconfigurable Hardware (Q2982200) (← links)
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem (Q3183586) (← links)
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum (Q3408206) (← links)
