The following pages link to Alon Rosen (Q315549):
Displaying 50 items.
- A dichotomy for local small-bias generators (Q315550) (← links)
- Completeness in two-party secure computation: A computational view (Q862422) (← links)
- Constant-round oblivious transfer in the bounded storage model (Q877811) (← links)
- An efficiency-preserving transformation from honest-verifier statistical zero-knowledge to statistical zero-knowledge (Q1653075) (← links)
- Proofs of Work from worst-case assumptions (Q1673424) (← links)
- Functional encryption for bounded collusions, revisited (Q1690192) (← links)
- Securing Abe's mix-net against malicious verifiers via witness indistinguishability (Q1796796) (← links)
- Public-coin parallel zero-knowledge for NP (Q1946592) (← links)
- More constructions of lossy and correlation-secure trapdoor functions (Q1946593) (← links)
- Input locality and hardness amplification (Q1946597) (← links)
- Limits on the efficiency of (ring) LWE-based non-interactive key exchange (Q2051406) (← links)
- Public-coin zero-knowledge arguments with (almost) minimal time and space overheads (Q2119043) (← links)
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration (Q2128558) (← links)
- Time- and space-efficient arguments from groups of unknown order (Q2139631) (← links)
- Concurrent zero-knowledge. With additional background by Oded Goldreich (Q2433152) (← links)
- Cryptography from one-way communication: on completeness of finite channels (Q2691601) (← links)
- Non-interactive composition of sigma-protocols via Share-then-Hash (Q2691604) (← links)
- Acyclicity programming for sigma-protocols (Q2695643) (← links)
- On the Hardness of Learning with Rounding over Small Modulus (Q2796126) (← links)
- Adaptive Security with Quasi-Optimal Rate (Q2796140) (← links)
- Rational Sumchecks (Q2799100) (← links)
- On the Existence of Extractable One-Way Functions (Q2829449) (← links)
- Limits on the Power of Cryptographic Cheap Talk (Q2845678) (← links)
- The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator (Q2874531) (← links)
- Lossy Functions Do Not Amplify Well (Q2891500) (← links)
- A Dichotomy for Local Small-Bias Generators (Q2891508) (← links)
- Pseudorandom Functions and Lattices (Q2894440) (← links)
- SPRING: Fast Pseudorandom Functions from Rounded Ring Products (Q2946902) (← links)
- Candidate weak pseudorandom functions in AC <sup>0</sup> ○ MOD <sub>2</sub> (Q2988885) (← links)
- Rational arguments (Q2988906) (← links)
- Input Locality and Hardness Amplification (Q3000528) (← links)
- Optimistic Concurrent Zero Knowledge (Q3058666) (← links)
- Pseudorandom Functions and Factoring (Q3149873) (← links)
- Pseudo-random functions and factoring (extended abstract) (Q3191966) (← links)
- SWIFFT: A Modest Proposal for FFT Hashing (Q3525661) (← links)
- Concurrent Nonmalleable Commitments (Q3549327) (← links)
- (Q3549647) (← links)
- More Constructions of Lossy and Correlation-Secure Trapdoor Functions (Q3562902) (← links)
- New and improved constructions of non-malleable cryptographic protocols (Q3581449) (← links)
- Fairness with an Honest Minority and a Rational Majority (Q3611757) (← links)
- On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols (Q3611768) (← links)
- Chosen-Ciphertext Security via Correlated Products (Q3611780) (← links)
- New and Improved Constructions of Nonmalleable Cryptographic Protocols (Q3624381) (← links)
- (Q4536818) (← links)
- Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds (Q4785630) (← links)
- Average-case fine-grained hardness (Q4977996) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- Limits on the Efficiency of (Ring) LWE Based Non-interactive Key Exchange (Q5041164) (← links)
- An Algebraic Approach to Nonmalleability (Q5157398) (← links)
- Black-box concurrent zero-knowledge requires \tilde {Ω} (log <i>n</i> ) rounds (Q5176015) (← links)
