383 results on '"Reyzin, Leonid"'
Search Results
152. CryptAttackTester: high-assurance attack analysis
153. Is ML-Based Cryptanalysis Inherently Limited? Simulating Cryptographic Adversaries via Gradient-Based Methods
154. Not Just Regular Decoding: Asymptotics and Improvements of Regular Syndrome Decoding Attacks
155. Quantum Complexity for Discrete Logarithms and Related Problems
156. Pseudorandom Error-Correcting Codes
157. Space-Efficient and Noise-Robust Quantum Factoring
158. Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions
159. Quantum Lattice Enumeration in Limited Depth
160. Quantum Advantage from One-Way Functions
161. Traceable Secret Sharing: Strong Security and Efficient Constructions
162. Collision Resistance from Multi-collision Resistance for All Constant Parameters
163. On Sequential Functions and Fine-Grained Cryptography
164. Sometimes You Can’t Distribute Random-Oracle-Based Proofs
165. Improved Algorithms for Finding Fixed-Degree Isogenies Between Supersingular Elliptic Curves
166. Stochastic Secret Sharing with 1-Bit Shares and Applications to MPC
167. Towards Breaking the Half-Barrier of Local Leakage-Resilient Shamir’s Secret Sharing
168. Memory-Sample Lower Bounds for LWE
169. Feistel-Like Structures Revisited: Classification and Cryptanalysis
170. QFESTA: Efficient Algorithms and Parameters for FESTA Using Quaternion Algebras
171. Radical Isogeny Formulae
172. Cryptanalysis of Lattice-Based Sequentiality Assumptions and Proofs of Sequential Work
173. The One-Wayness of Jacobi Signatures
174. Limits on the Power of Prime-Order Groups: Separating Q-Type from Static Assumptions
175. Generic and Algebraic Computation Models: When AGM Proofs Transfer to the GGM
176. Information-Theoretic Security with Asymmetries
177. Algebraic Structure of the Iterates of
178. HAWKEYE – Recovering Symmetric Cryptography From Hardware Circuits
179. Tight Characterizations for Preprocessing Against Cryptographic Salting
180. The Committing Security of MACs with Applications to Generic Composition
181. The Algebraic FreeLunch: Efficient Gröbner Basis Attacks Against Arithmetization-Oriented Primitives
182. Succinctly-Committing Authenticated Encryption
183. Probabilistic Linearization: Internal Differential Collisions in up to 6 Rounds of SHA-3
184. New Approaches for Estimating the Bias of Differential-Linear Distinguishers
185. Improving Generic Attacks Using Exceptional Functions
186. Speeding Up Preimage and Key-Recovery Attacks with Highly Biased Differential-Linear Approximations
187. Generic MitM Attack Frameworks on Sponge Constructions
188. Time-Memory Trade-Offs Sound the Death Knell for GPRS and GSM
189. Revisiting Differential-Linear Attacks via a Boomerang Perspective with Application to AES, Ascon, CLEFIA, SKINNY, PRESENT, KNOT, TWINE, WARP, LBlock, Simeck, and SERPENT
190. Polynomial Commitments from Lattices: Post-quantum Security, Fast Verification and Transparent Setup
191. Field-Agnostic SNARKs from Expand-Accumulate Codes
192. BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codes
193. Greyhound: Fast Polynomial Commitments from Lattices
194. Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way Functions
195. Zero-Knowledge IOPs Approaching Witness Length
196. Adaptive Security in SNARGs via iO and Lossy Functions
197. Polymath: Groth16 Is Not the Limit
198. Adaptively Sound Zero-Knowledge SNARKs for UP
199. Concretely Efficient Lattice-Based Polynomial Commitment from Standard Assumptions
200. HyperNova: Recursive Arguments for Customizable Constraint Systems
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.