Gilad Asharov

From MaRDI portal
Person:321317

Available identifiers

zbMath Open asharov.giladMaRDI QIDQ321317

List of research outcomes





PublicationDate of PublicationType
NIZKs with maliciously chosen CRS: subversion advice-ZK and accountable soundness2025-01-10Paper
Perfect asynchronous MPC with linear communication overhead2024-11-13Paper
Perfect (parallel) broadcast in constant expected rounds via statistical VSS2024-11-13Paper
Complete characterization of fairness in secure two-party computation of Boolean functions2024-10-21Paper
Optimal oblivious parallel RAM2024-07-19Paper
OptORAMa: Optimal oblivious RAM2024-07-04Paper
Static vs. adaptive security in perfect MPC: a separation and the adaptive security of BGW2024-06-25Paper
Bucket oblivious sort: an extremely simple oblivious sort2024-05-14Paper
Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security2024-03-26Paper
https://portal.mardi4nfdi.de/entity/Q61473902024-01-15Paper
Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time2023-12-08Paper
Oblivious parallel tight compaction2023-11-02Paper
Asymptotically free broadcast in constant expected time via packed VSS2023-08-14Paper
Efficient perfectly secure computation with optimal resilience2023-04-13Paper
Oblivious RAM with worst-case logarithmic overhead2023-04-13Paper
Efficient perfectly secure computation with optimal resilience2022-10-04Paper
A complete characterization of game-theoretically fair, multi-party coin toss2022-08-30Paper
On the complexity of compressing obfuscation2022-07-18Paper
Sorting Short Keys in Circuits of Size ${o(n \log n)}$2022-05-31Paper
Oblivious RAM with \textit{worst-case} logarithmic overhead2022-05-18Paper
OptORAMa: optimal oblivious RAM2022-03-23Paper
Locality-preserving oblivious RAM2022-03-03Paper
Towards accountability in CRS generation2021-12-08Paper
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations2021-10-18Paper
Tight tradeoffs in searchable symmetric encryption2021-04-07Paper
On the complexity of compressing obfuscation2020-06-30Paper
Locality-preserving oblivious RAM2020-02-06Paper
On constructing one-way permutations from indistinguishability obfuscation2018-09-14Paper
Tight tradeoffs in searchable symmetric encryption2018-09-12Paper
More efficient oblivious transfer extensions2017-10-12Paper
Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations2017-09-29Paper
A full proof of the BGW protocol for perfectly secure multiparty computation2017-03-02Paper
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption2016-12-21Paper
Toward a game theoretic view of secure computation2016-10-13Paper
On Constructing One-Way Permutations from Indistinguishability Obfuscation2016-04-08Paper
More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries2015-09-30Paper
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions2015-07-06Paper
Towards Characterizing Complete Fairness in Secure Two-Party Computation2014-02-18Paper
Fair and Efficient Secure Multiparty Computation with Reputation Systems2013-12-10Paper
Calling Out Cheaters: Covert Security with Public Verifiability2013-03-19Paper
A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness2013-03-18Paper
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE2012-06-29Paper
Perfectly-Secure Multiplication for Any t < n/32011-08-12Paper
Towards a Game Theoretic View of Secure Computation2011-05-27Paper
Utility dependence in correct and fair rational secret sharing2011-04-01Paper
Utility Dependence in Correct and Fair Rational Secret Sharing2009-10-20Paper

Research outcomes over time

This page was built for person: Gilad Asharov