Gilad Asharov

Bar-Ilan University — Israel

Computer Science · Physical Sciences

22h-index2.1kcitations84works2.02yr 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(76), Complexity and Algorithms in Graphs(51), Privacy-Preserving Technologies in Data(35), Blockchain Technology Applications and Security(13), Cryptographic Implementations and Security(9)

Publications84 total

MegaBlocks: Breaking the Logarithmic I/O-Overhead Barrier for Oblivious RAM
2025Open Access
Asymptotically Free Broadcast in Constant Expected Time via Packed VSS
Journal of Cryptology·2025
Towards Accountability in CRS Generation
Journal of Cryptology·2025Open Access
Peeking Into the Future: MPC Resilient to Super-Rushing Adversaries
Lecture notes in computer science·2025· 1 cited
Asynchronous Agreement on a Core Set in Constant Expected Time and More Efficient Asynchronous VSS and MPC
Lecture notes in computer science·2024· 2 cited
Consensus in the Presence of Overlapping Faults and Total Omission
Lecture notes in computer science·2024· 1 cited
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
SIAM Journal on Computing·2024
Perfect (Parallel) Broadcast in Constant Expected Rounds via Statistical VSS
Lecture notes in computer science·2024· 7 cited
NIZKs with Maliciously Chosen CRS: Subversion Advice-ZK and Accountable Soundness
Lecture notes in computer science·2024· 1 cited
Perfect Asynchronous MPC with Linear Communication Overhead
Lecture notes in computer science·2024· 8 cited
FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM
2023· 6 citedOpen Access
Prime Match: A Privacy-Preserving Inventory Matching System
arXiv (Cornell University)·2023· 3 citedOpen Access
Oblivious RAM with Worst-Case Logarithmic Overhead
Journal of Cryptology·2023· 10 cited
Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time
Lecture notes in computer science·2023· 11 cited
Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security·2022· 28 cited
OptORAMa: Optimal Oblivious RAM
Journal of the ACM·2022· 28 cited
Efficient Perfectly Secure Computation with Optimal Resilience
Journal of Cryptology·2022· 5 cited
Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security
2022· 6 cited
On the Complexity of Compressing Obfuscation
Journal of Cryptology·2022
Sorting Short Keys in Circuits of Size ${o(n \log n)}$
SIAM Journal on Computing·2022· 3 cited
page 1 of 5Next →

Frequent Co-authors

Yehuda Lindell(13), Elaine Shi(10), Gil Segev(8), Ilan Komargodski(7), Wei-Kai Lin(6), Ittai Abraham(6), Thomas Schneider(5), Michael Zohner(5), Kartik Nayak(5), Tal Rabin(4), Rafael Pass(4), Enoch Peserico(3), T-H. Hubert Chan(3), Ling Ren(3), Shravani Patil(3), Arpita Patra(3), Abhishek Jain(2), Daniel Wichs(2), Ido Shahaf(2), Ran Canetti(2)