The following pages link to Leonid Reyzin (Q476199):
Displaying 46 items.
- Sequential aggregate signatures with lazy verification from trapdoor permutations (Q476200) (← links)
- Upper and lower bounds on black-box steganography (Q1027982) (← links)
- Improving the exact security of digital signature schemes (Q1596365) (← links)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- Fuzzy password-authenticated key exchange (Q1653099) (← links)
- Beyond Hellman's time-memory trade-offs with applications to proofs of space (Q1703929) (← links)
- A unified framework for trapdoor-permutation-based sequential aggregate signatures (Q1753840) (← links)
- Can a public blockchain keep a secret? (Q2055723) (← links)
- Efficient noninteractive certification of RSA moduli and beyond (Q2178874) (← links)
- Computational fuzzy extractors (Q2216116) (← links)
- Mercurial commitments with applications to zero-knowledge sets (Q2377062) (← links)
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy (Q2516532) (← links)
- (Q2707408) (← links)
- (Q2778858) (← links)
- On the Correlation Intractability of Obfuscated Pseudorandom Functions (Q2796135) (← links)
- Efficient Asynchronous Accumulators for Distributed PKI (Q2827725) (← links)
- Computational Fuzzy Extractors (Q2867218) (← links)
- Amplifying Privacy in Privacy Amplification (Q2874537) (← links)
- Privacy amplification with asymptotically optimal entropy loss (Q2875205) (← links)
- A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy (Q2891507) (← links)
- Some Notions of Entropy for Cryptography (Q3002109) (← links)
- Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6 (Q3391566) (← links)
- An Improved Robust Fuzzy Extractor (Q3540042) (← links)
- Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases (Q3563833) (← links)
- Key Agreement from Close Secrets over Unsecured Channels (Q3627436) (← links)
- (Q4409139) (← links)
- (Q4412971) (← links)
- (Q4414268) (← links)
- (Q4414270) (← links)
- (Q4414286) (← links)
- (Q4496063) (← links)
- (Q4536814) (← links)
- (Q4783734) (← links)
- (Q4783744) (← links)
- Sequential Aggregate Signatures with Lazy Verification from Trapdoor Permutations (Q4911613) (← links)
- Protecting Circuits from Computationally Bounded and Noisy Leakage (Q5173248) (← links)
- Scrypt Is Maximally Memory-Hard (Q5270357) (← links)
- Advances in Cryptology - EUROCRYPT 2004 (Q5307247) (← links)
- Advances in Cryptology – CRYPTO 2004 (Q5311560) (← links)
- Mercurial Commitments with Applications to Zero-Knowledge Sets (Q5385743) (← links)
- Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility (Q5429389) (← links)
- Saving Private Randomness in One-Way Functions and Pseudorandom Generators (Q5445528) (← links)
- Privacy amplification with asymptotically optimal entropy loss (Q5501933) (← links)
- Theory of Cryptography (Q5711645) (← links)
- Theory of Cryptography (Q5901777) (← links)
- Approximate lower bound arguments (Q6637520) (← links)
