383 results on '"Reyzin, Leonid"'
Search Results
2. Turning HATE into LOVE: Compact Homomorphic Ad Hoc Threshold Encryption for Scalable MPC
3. Can a Public Blockchain Keep a Secret?
4. Efficient Noninteractive Certification of RSA Moduli and Beyond
5. Computational fuzzy extractors
6. Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption
7. Fuzzy Password-Authenticated Key Exchange
8. A Unified Framework for Trapdoor-Permutation-Based Sequential Aggregate Signatures
9. An Improved Robust Fuzzy Extractor
10. Upper and Lower Bounds on Black-Box Steganography
11. Can a Public Blockchain Keep a Secret?
12. Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
13. Improving Authenticated Dynamic Dictionaries, with Applications to Cryptocurrencies
14. Beyond Hellman’s Time-Memory Trade-Offs with Applications to Proofs of Space
15. Scrypt Is Maximally Memory-Hard
16. Reusable Fuzzy Extractors for Low-Entropy Distributions
17. When Are Fuzzy Extractors Possible?
18. Reusable Fuzzy Extractors for Low-Entropy Distributions
19. On the Correlation Intractability of Obfuscated Pseudorandom Functions
20. Efficient Asynchronous Accumulators for Distributed PKI
21. A survey of leakage-resilient cryptography
22. Forward-Secure Signatures with Optimal Signing and Verifying
23. Signing with Partially Adversarial Hashing
24. Concurrent/Resettable Zero-Knowledge Protocols for NP in the Public Key Model
25. Mutually Independent Commitment
26. Amplifying Privacy in Privacy Amplification
27. Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption
28. Fuzzy Password-Authenticated Key Exchange
29. A Unified Framework for Trapdoor-Permutation-Based Sequential Aggregate Signatures
30. Computational Fuzzy Extractors
31. Sequential Aggregate Signatures with Lazy Verification from Trapdoor Permutations : (Extended Abstract)
32. A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
33. Some Notions of Entropy for Cryptography : (Invited Talk)
34. Sequential aggregate signatures with lazy verification from trapdoor permutations
35. Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
36. Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6
37. Key Agreement from Close Secrets over Unsecured Channels
38. Saving Private Randomness in One-Way Functions and Pseudorandom Generators
39. Authenticated Index Structures for Outsourced Databases
40. Improving Authenticated Dynamic Dictionaries, with Applications to Cryptocurrencies
41. Beyond Hellman’s Time-Memory Trade-Offs with Applications to Proofs of Space
42. Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
43. Fuzzy Extractors
44. Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets
45. Mercurial Commitments with Applications to Zero-Knowledge Sets : Extended Abstract
46. Upper and Lower Bounds on Black-Box Steganography
47. Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?
48. Sequential Aggregate Signatures from Trapdoor Permutations
49. Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
50. Physically Observable Cryptography
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.