| Publication | Date of Publication | Type |
|---|
| Peeking into the future: MPC resilient to super-rushing adversaries | 2025-12-02 | Paper |
Asymptotically free broadcast in constant expected time via packed VSS
Journal of Cryptology | 2025-10-23 | Paper |
Towards accountability in CRS generation
Journal of Cryptology | 2025-09-30 | Paper |
| Limits on the power of indistinguishability obfuscation and functional encryption | 2025-08-05 | Paper |
| NIZKs with maliciously chosen CRS: subversion advice-ZK and accountable soundness | 2025-01-10 | Paper |
| Perfect asynchronous MPC with linear communication overhead | 2024-11-13 | Paper |
| Perfect (parallel) broadcast in constant expected rounds via statistical VSS | 2024-11-13 | Paper |
Complete characterization of fairness in secure two-party computation of Boolean functions
SIAM Journal on Computing | 2024-10-21 | Paper |
| Optimal oblivious parallel RAM | 2024-07-19 | Paper |
OptORAMa: Optimal oblivious RAM
Journal of the ACM | 2024-07-04 | Paper |
| Static vs. adaptive security in perfect MPC: a separation and the adaptive security of BGW | 2024-06-25 | Paper |
| Bucket oblivious sort: an extremely simple oblivious sort | 2024-05-14 | Paper |
Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| scientific article; zbMATH DE number 7788472 (Why is no real title available?) | 2024-01-15 | Paper |
Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
| Oblivious parallel tight compaction | 2023-11-02 | Paper |
Asymptotically free broadcast in constant expected time via packed VSS
Theory of Cryptography | 2023-08-14 | Paper |
Efficient perfectly secure computation with optimal resilience
Theory of Cryptography | 2023-04-13 | Paper |
Oblivious RAM with worst-case logarithmic overhead
Journal of Cryptology | 2023-04-13 | Paper |
Efficient perfectly secure computation with optimal resilience
Journal of Cryptology | 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
Journal of Cryptology | 2022-07-18 | Paper |
Sorting Short Keys in Circuits of Size ${o(n \log n)}$
SIAM Journal on Computing | 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
Journal of Cryptology | 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
SIAM Journal on Computing | 2021-10-18 | Paper |
Tight tradeoffs in searchable symmetric encryption
Journal of Cryptology | 2021-04-07 | Paper |
On the complexity of compressing obfuscation
Lecture Notes in Computer Science | 2020-06-30 | Paper |
Locality-preserving oblivious RAM
Advances in Cryptology – EUROCRYPT 2019 | 2020-02-06 | Paper |
On constructing one-way permutations from indistinguishability obfuscation
Journal of Cryptology | 2018-09-14 | Paper |
Tight tradeoffs in searchable symmetric encryption
Lecture Notes in Computer Science | 2018-09-12 | Paper |
More efficient oblivious transfer extensions
Journal of Cryptology | 2017-10-12 | Paper |
Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
A full proof of the BGW protocol for perfectly secure multiparty computation
Journal of Cryptology | 2017-03-02 | Paper |
Limits on the power of indistinguishability obfuscation and functional encryption
SIAM Journal on Computing | 2016-12-21 | Paper |
Toward a game theoretic view of secure computation
Journal of Cryptology | 2016-10-13 | Paper |
On constructing one-way permutations from indistinguishability obfuscation
Theory of Cryptography | 2016-04-08 | Paper |
More efficient oblivious transfer extensions with security for malicious adversaries
Advances in Cryptology -- EUROCRYPT 2015 | 2015-09-30 | Paper |
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
Theory of Cryptography | 2015-07-06 | Paper |
Towards characterizing complete fairness in secure two-party computation
Theory of Cryptography | 2014-02-18 | Paper |
Fair and efficient secure multiparty computation with reputation systems
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
Calling out cheaters: covert security with public verifiability
Advances in Cryptology – ASIACRYPT 2012 | 2013-03-19 | Paper |
A full characterization of functions that imply fair coin tossing and ramifications to fairness
Theory of Cryptography | 2013-03-18 | Paper |
Multiparty computation with low communication, computation and interaction via threshold FHE
Advances in Cryptology – EUROCRYPT 2012 | 2012-06-29 | Paper |
Perfectly-secure multiplication for any \(t < n/3\)
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Towards a game theoretic view of secure computation
Advances in Cryptology – EUROCRYPT 2011 | 2011-05-27 | Paper |
Utility dependence in correct and fair rational secret sharing
Journal of Cryptology | 2011-04-01 | Paper |
Utility Dependence in Correct and Fair Rational Secret Sharing
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
