Gilad Asharov

Available identifiers

zbMath Open asharov.giladMaRDI QIDQ321317

List of research outcomes

Publication	Date of Publication	Type
Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security	2024-03-26	Paper
https://portal.mardi4nfdi.de/entity/Q6147390	2024-01-15	Paper
Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time	2023-12-08	Paper
Oblivious parallel tight compaction	2023-11-02	Paper
Asymptotically free broadcast in constant expected time via packed VSS	2023-08-14	Paper
Oblivious RAM with worst-case logarithmic overhead	2023-04-13	Paper
Efficient perfectly secure computation with optimal resilience	2023-04-13	Paper
Efficient perfectly secure computation with optimal resilience	2022-10-04	Paper
A complete characterization of game-theoretically fair, multi-party coin toss	2022-08-30	Paper
On the complexity of compressing obfuscation	2022-07-18	Paper
Sorting Short Keys in Circuits of Size ${o(n \log n)}$	2022-05-31	Paper
Oblivious RAM with \textit{worst-case} logarithmic overhead	2022-05-18	Paper
OptORAMa: optimal oblivious RAM	2022-03-23	Paper
Locality-preserving oblivious RAM	2022-03-03	Paper
Towards accountability in CRS generation	2021-12-08	Paper
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations	2021-10-18	Paper
Tight tradeoffs in searchable symmetric encryption	2021-04-07	Paper
On the complexity of compressing obfuscation	2020-06-30	Paper
Locality-preserving oblivious RAM	2020-02-06	Paper
On constructing one-way permutations from indistinguishability obfuscation	2018-09-14	Paper
Tight tradeoffs in searchable symmetric encryption	2018-09-12	Paper
More efficient oblivious transfer extensions	2017-10-12	Paper
Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations	2017-09-29	Paper
A full proof of the BGW protocol for perfectly secure multiparty computation	2017-03-02	Paper
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption	2016-12-21	Paper
Toward a game theoretic view of secure computation	2016-10-13	Paper
On Constructing One-Way Permutations from Indistinguishability Obfuscation	2016-04-08	Paper
More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries	2015-09-30	Paper
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions	2015-07-06	Paper
Towards Characterizing Complete Fairness in Secure Two-Party Computation	2014-02-18	Paper
Fair and Efficient Secure Multiparty Computation with Reputation Systems	2013-12-10	Paper
Calling Out Cheaters: Covert Security with Public Verifiability	2013-03-19	Paper
A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness	2013-03-18	Paper
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE	2012-06-29	Paper
Perfectly-Secure Multiplication for Any t < n/3	2011-08-12	Paper
Towards a Game Theoretic View of Secure Computation	2011-05-27	Paper
Utility dependence in correct and fair rational secret sharing	2011-04-01	Paper
Utility Dependence in Correct and Fair Rational Secret Sharing	2009-10-20	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Gilad Asharov