The following pages link to Chris Peikert (Q537917):
Displaying 50 items.
- Generating shorter bases for hard random lattices (Q537918) (← links)
- Outsourcing computation: the minimal refereed mechanism (Q777972) (← links)
- Limits on the hardness of lattice problems in \(\ell_{p}\) norms (Q937206) (← links)
- New (and old) proof systems for lattice problems (Q1753870) (← links)
- Privately constraining and programming PRFs, the LWE way (Q1753873) (← links)
- More efficient commitments from structured lattice assumptions (Q1796807) (← links)
- Bonsai trees, or how to delegate a lattice basis (Q1928766) (← links)
- He gives C-sieves on the CSIDH (Q2119021) (← links)
- Algebraically structured LWE. Revisited (Q2175901) (← links)
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors (Q2181846) (← links)
- List-decoding Barnes-Wall lattices (Q2410678) (← links)
- Vector and functional commitments from lattices (Q2697903) (← links)
- A Decade of Lattice Cryptography (Q2808276) (← links)
- On Adaptively Secure Multiparty Computation with a Short CRS (Q2827714) (← links)
- How (Not) to Instantiate Ring-LWE (Q2827731) (← links)
- Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE (Q2829234) (← links)
- Practical Bootstrapping in Quasilinear Time (Q2845657) (← links)
- Hardness of SIS and LWE with Small Parameters (Q2845658) (← links)
- How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE (Q2873651) (← links)
- Faster Bootstrapping with Polynomial Error (Q2874511) (← links)
- New and Improved Key-Homomorphic Pseudorandom Functions (Q2874514) (← links)
- Identity-Based (Lossy) Trapdoor Functions and Applications (Q2894410) (← links)
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller (Q2894439) (← links)
- Pseudorandom Functions and Lattices (Q2894440) (← links)
- Circular and KDM Security for Identity-Based Encryption (Q2900226) (← links)
- Ring Switching in BGV-Style Homomorphic Encryption (Q2912784) (← links)
- Lattice Cryptography for the Internet (Q2938684) (← links)
- SPRING: Fast Pseudorandom Functions from Rounded Ring Products (Q2946902) (← links)
- Better Key Sizes (and Attacks) for LWE-Based Encryption (Q3073715) (← links)
- Multi-key FHE from LWE, Revisited (Q3181028) (← links)
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems (Q3183587) (← links)
- Lossy Trapdoor Functions and Their Applications (Q3225173) (← links)
- Public-Key Encryption Schemes with Auxiliary Inputs (Q3408205) (← links)
- SWIFFT: A Modest Proposal for FFT Hashing (Q3525661) (← links)
- (Q3549647) (← links)
- Lossy trapdoor functions and their applications (Q3549700) (← links)
- Trapdoors for hard lattices and new cryptographic constructions (Q3549701) (← links)
- On Ideal Lattices and Learning with Errors over Rings (Q3563827) (← links)
- Bonsai Trees, or How to Delegate a Lattice Basis (Q3563854) (← links)
- An Efficient and Parallel Gaussian Sampler for Lattices (Q3582749) (← links)
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems (Q3600239) (← links)
- A Framework for Efficient and Composable Oblivious Transfer (Q3600240) (← links)
- Some Recent Progress in Lattice-Based Cryptography (Q3611759) (← links)
- (Q4474183) (← links)
- A Toolkit for Ring-LWE Cryptography (Q4924402) (← links)
- Pseudorandomness of ring-LWE for any ring and modulus (Q4977994) (← links)
- Lattice (List) Decoding Near Minkowski’s Inequality (Q5030328) (← links)
- Constraining and Watermarking PRFs from Milder Assumptions (Q5041166) (← links)
- Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography (Q5041172) (← links)
- Hardness of bounded distance decoding on lattices in lp norms (Q5092487) (← links)
