Search

Your search keyword '"Rothblum, Ron D."' showing total 129 results

Search Constraints

Start Over You searched for: Author "Rothblum, Ron D." Remove constraint Author: "Rothblum, Ron D."
129 results on '"Rothblum, Ron D."'

Search Results

1. Rate-1 Zero-Knowledge Proofs from One-Way Functions

2. Doubly-Efficient Batch Verification in Statistical Zero-Knowledge

3. Distribution-Free Proofs of Proximity

4. Strong Batching for Non-interactive Statistical Zero-Knowledge

6. Combinatorially Homomorphic Encryption

7. Hard properties with (very) short PCPPs and their applications

9. PPAD is as Hard as LWE and Iterated Squaring

10. Collision-Resistance from Multi-Collision-Resistance

11. Faster Sounder Succinct Arguments and s

12. Succinct Interactive Oracle Proofs: Applications and Limitations

13. Time- and Space-Efficient Arguments from Groups of Unknown Order

14. Public-Coin Statistical Zero-Knowledge Batch Verification Against Malicious Verifiers

16. Batch Verification for Statistical Zero Knowledge Proofs

17. Batch Verification and Proofs of Proximity with Polylog Overhead

18. Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads

19. On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds.

24. On the (In)security of Kilian-Based SNARGs

25. Statistical Difference Beyond the Polarizing Regime

26. New Constructions of Reusable Designated-Verifier NIZKs

27. Reusable Designated-Verifier NIZKs for all NP from CDH

28. Towards Non-Interactive Zero-Knowledge for NP from LWE

29. From Laconic Zero-Knowledge to Public-Key Cryptography : Extended Abstract

30. Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption

31. Multi-Collision Resistant Hash Functions and Their Applications

37. From Obfuscation to the Security of Fiat-Shamir for Proofs

39. Spooky Encryption and Its Applications

40. How to Delegate Computations: The Power of No-Signaling Proofs.

46. Arguments of Proximity : [Extended Abstract]

47. Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs : (Extended Abstract)

50. Efficient Interactive Proofs for Non-Deterministic Bounded Space

Catalog

Books, media, physical & digital resources