Rafael Pass

Tel Aviv University — Israel

Computer Science · Physical Sciences

49h-index8.8kcitations307works0.62yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Cryptography and Data Security(218), Complexity and Algorithms in Graphs(108), Cryptographic Implementations and Security(82), Privacy-Preserving Technologies in Data(44), Blockchain Technology Applications and Security(38)

Publications307 total

A Meta-complexity Theoretic Approach to Indistinguishability Obfuscation and Witness Pseudo-Canonicalization
Lecture notes in computer science·2025
Causality Without Causal Models
Electronic Proceedings in Theoretical Computer Science·2025Open Access
Guest Column: On Cryptography and Meta-Complexity
ACM SIGACT News·2025
On One-Way Functions, the Worst-Case Hardness of Time-Bounded Kolmogorov Complexity, and Computational Depth
Lecture notes in computer science·2024· 2 cited
Fair Interest Rates Are Impossible for Lending Pools: Results from Options Pricing
arXiv (Cornell University)·2024Open Access
Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance
Lecture notes in computer science·2024· 1 cited
A Direct PRF Construction from Kolmogorov Complexity
Lecture notes in computer science·2024· 1 cited
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement
2023· 7 cited
Toward Basing Cryptography on the Hardness of EXP
Communications of the ACM·2023· 1 cited
One-Way Functions and the Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions
Lecture notes in computer science·2023· 8 cited
Counting Unpredictable Bits: A Simple PRG from One-Way Functions
Lecture notes in computer science·2023· 4 citedOpen Access
Simplex Consensus: A Simple and Fast Consensus Protocol
Lecture notes in computer science·2023· 9 citedOpen Access
On One-Way Functions and Sparse Languages
Lecture notes in computer science·2023· 2 citedOpen Access
One-Way Functions and (Im)perfect Obfuscation
SIAM Journal on Computing·2022· 2 cited
Incrementally Verifiable Computation via Rate-1 Batch Arguments
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)·2022· 26 cited
SPARKs: Succinct Parallelizable Arguments of Knowledge
Journal of the ACM·2022
Communication complexity of byzantine agreement, revisited
Distributed Computing·2022· 15 cited
On the Complexity of Compressing Obfuscation
Journal of Cryptology·2022
Locality-Preserving Oblivious RAM
Journal of Cryptology·2022· 1 cited
Parallelizable Delegation from LWE
Lecture notes in computer science·2022· 6 cited
page 1 of 16Next →

Frequent Co-authors

Elaine Shi(10), Huijia Lin(8), Abhi Shelat(5), Elette Boyle(5), Alon Rosen(5), Ran Canetti(4), Kai-Min Chung(3), Sidharth Telang(3), Vinod Vaikuntanathan(3), Boaz Barak(2), Karn Seth(2), Johannes Gehrke(2), Edward Lui(2), Hoeteck Wee(2), Muthuramakrishnan Venkitasubramaniam(2), Ilan Komargodski(2), Silvio Micali(2), Lior Seeman(1), Yevgeniy Dodis(1), Shabsi Walfish(1)