| Publication | Date of Publication | Type |
|---|
| Scalable multi-server private information retrieval | 2026-04-24 | Paper |
| Differentially oblivious Turing machines | 2026-04-15 | Paper |
| \textsf{PicoGRAM}: practical garbled RAM from decisional Diffie-Hellman | 2026-02-06 | Paper |
| Foundations of platform-assisted auctions | 2026-02-04 | Paper |
| Pseudorandom functions with weak programming privacy and applications to private information retrieval | 2025-12-02 | Paper |
| Quasi-linear indistinguishability obfuscation via mathematical proofs of equivalence and applications | 2025-11-20 | Paper |
| Advanced composition theorems for differential obliviousness | 2025-11-04 | Paper |
| Maximizing miner revenue in transaction fee mechanism design | 2025-11-04 | Paper |
Expected constant round Byzantine broadcast under dishonest majority
Journal of the ACM | 2025-10-23 | Paper |
| PIR with client-side preprocessing: information-theoretic constructions and lower bounds | 2024-12-13 | Paper |
| Efficient pre-processing PIR without public-key cryptography | 2024-11-13 | Paper |
| What can cryptography do for decentralized mechanism design? | 2024-09-25 | Paper |
| Non-interactive anonymous router with quasi-linear router computation | 2024-08-02 | Paper |
| Distributed-prover interactive proofs | 2024-08-01 | Paper |
| Optimal oblivious parallel RAM | 2024-07-19 | Paper |
| Optimal sorting circuits for short keys | 2024-07-19 | Paper |
OptORAMa: Optimal oblivious RAM
Journal of the ACM | 2024-07-04 | Paper |
| Foundations of transaction fee mechanism design | 2024-05-14 | Paper |
| Bucket oblivious sort: an extremely simple oblivious sort | 2024-05-14 | Paper |
Revisiting the Power of Non-Equivocation in Distributed Protocols
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
On the Amortized Communication Complexity of Byzantine Broadcast
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Optimal single-server private information retrieval
Advances in Cryptology – EUROCRYPT 2023 | 2024-01-16 | Paper |
NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead
Advances in Cryptology – EUROCRYPT 2023 | 2024-01-16 | Paper |
| scientific article; zbMATH DE number 7788472 (Why is no real title available?) | 2024-01-15 | Paper |
A theory of composition for differential obliviousness
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-12 | Paper |
Multi-client inner product encryption: function-hiding instantiations without random oracles
Lecture Notes in Computer Science | 2023-11-24 | Paper |
| Improved extension protocols for Byzantine broadcast and agreement | 2023-11-02 | Paper |
| Oblivious parallel tight compaction | 2023-11-02 | Paper |
| Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions. | 2023-07-03 | Paper |
| Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms | 2023-07-03 | Paper |
\(\log^\ast\)-round game-theoretically-fair leader election
Advances in Cryptology – CRYPTO 2022 | 2023-06-30 | Paper |
Maliciously secure massively parallel computation for all-but-one corruptions
Advances in Cryptology – CRYPTO 2022 | 2023-06-12 | Paper |
Foundations of Differentially Oblivious Algorithms
Journal of the ACM | 2023-04-27 | Paper |
Oblivious RAM with worst-case logarithmic overhead
Journal of Cryptology | 2023-04-13 | Paper |
| On the adaptive security of MACs and PRFs | 2023-03-21 | Paper |
Communication complexity of Byzantine agreement, revisited
Distributed Computing | 2023-03-14 | Paper |
| MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture | 2023-02-03 | Paper |
| Hybrid consensus: efficient consensus in the permissionless model | 2023-02-03 | Paper |
| A complete characterization of game-theoretically fair, multi-party coin toss | 2022-08-30 | 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 |
| Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time | 2022-05-18 | Paper |
| Game-theoretic fairness meets multi-party protocols: the case of leader election | 2022-04-22 | Paper |
| Secure massively parallel computation for dishonest majority | 2022-03-23 | Paper |
| OptORAMa: optimal oblivious RAM | 2022-03-23 | Paper |
Locality-preserving oblivious RAM
Journal of Cryptology | 2022-03-03 | Paper |
| Non-interactive anonymous router | 2021-12-08 | Paper |
| Expected constant round Byzantine broadcast under dishonest majority | 2021-12-01 | Paper |
| Sublinear-round Byzantine agreement under corrupt majority | 2021-12-01 | Paper |
| Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions | 2021-12-01 | Paper |
Lower bounds for external memory integer sorting via network coding
SIAM Journal on Computing | 2021-10-18 | Paper |
Communication Complexity of Byzantine Agreement, Revisited
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
| Towards attribute-based encryption for RAMs from LWE: sub-linear decryption, and more | 2020-05-20 | Paper |
| Synchronous, with a chance of partition tolerance | 2020-05-20 | Paper |
| Streamlined blockchains: a simple and elegant approach (a tutorial and survey) | 2020-05-20 | Paper |
Locally decodable and updatable non-malleable codes and their applications
Journal of Cryptology | 2020-03-03 | Paper |
Locality-preserving oblivious RAM
Advances in Cryptology – EUROCRYPT 2019 | 2020-02-06 | Paper |
Lower bounds for external memory integer sorting via network coding
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Can we overcome the n n barrier for oblivious sorting?
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Foundations of differentially oblivious algorithms
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Oblivious network RAM and leveraging parallelism to achieve obliviousness
Journal of Cryptology | 2019-08-13 | Paper |
More is less: perfectly secure oblivious algorithms in the multi-server setting
(available as arXiv preprint) | 2019-01-23 | Paper |
| Game theoretic notions of fairness in multi-party coin toss | 2018-12-11 | Paper |
| Perfectly secure oblivious parallel RAM | 2018-12-06 | Paper |
Path ORAM
Journal of the ACM | 2018-12-06 | Paper |
Distributed Private Data Analysis
ACM Transactions on Algorithms | 2018-11-12 | Paper |
| Thunderella: blockchains with optimistic instant confirmation | 2018-07-09 | Paper |
| On the depth of oblivious parallel RAM | 2018-04-06 | Paper |
| Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM | 2018-04-06 | Paper |
| Cache-oblivious and data-oblivious sorting and applications | 2018-03-15 | Paper |
| The sleepy model of consensus | 2018-03-08 | Paper |
| Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs | 2018-01-19 | Paper |
FruitChains: a fair blockchain
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Formal abstractions for attested execution secure processors
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Oblivious network RAM and leveraging parallelism to achieve obliviousness
Advances in Cryptology -- ASIACRYPT 2015 | 2016-06-10 | Paper |
Onion ORAM: a constant bandwidth blowup oblivious RAM
Theory of Cryptography | 2016-04-08 | Paper |
Constant-Round MPC with Fairness and Guarantee of Output Delivery
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Locally decodable and updatable non-malleable codes and their applications
Theory of Cryptography | 2015-07-06 | Paper |
Multi-client verifiable computation with stronger security guarantees
Theory of Cryptography | 2015-07-06 | Paper |
Multi-input functional encryption
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
Verifiable oblivious storage
Public-Key Cryptography – PKC 2014 | 2014-03-25 | Paper |
Streaming authenticated data structures
Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings | 2013-05-31 | Paper |
Signatures of correct computation
Theory of Cryptography | 2013-03-18 | Paper |
Privacy-Preserving Stream Aggregation with Fault Tolerance
Financial Cryptography and Data Security | 2012-11-09 | Paper |
Optimal lower bound for differentially private multi-party aggregation
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Policy-enhanced private set intersection: sharing information while enforcing privacy policies
Public Key Cryptography – PKC 2012 | 2012-07-20 | Paper |
Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
Lecture Notes in Computer Science | 2011-12-02 | Paper |
Private and continual release of statistics
Automata, Languages and Programming | 2010-09-07 | Paper |
Signatures of reputation. (Extended abstract)
Financial Cryptography and Data Security | 2010-08-17 | Paper |
Predicate Privacy in Encryption Systems
Theory of Cryptography | 2009-03-03 | Paper |
Delegating Capabilities in Predicate Encryption Systems
Automata, Languages and Programming | 2008-08-19 | Paper |
