| Publication | Date of Publication | Type |
|---|
| Revisiting the Power of Non-Equivocation in Distributed Protocols | 2024-03-26 | Paper |
| On the Amortized Communication Complexity of Byzantine Broadcast | 2024-03-26 | Paper |
| Optimal single-server private information retrieval | 2024-01-16 | Paper |
| NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147390 | 2024-01-15 | Paper |
| A theory of composition for differential obliviousness | 2023-12-12 | Paper |
| Multi-client inner product encryption: function-hiding instantiations without random oracles | 2023-11-24 | 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 | 2023-06-30 | Paper |
| Maliciously secure massively parallel computation for all-but-one corruptions | 2023-06-12 | Paper |
| Foundations of Differentially Oblivious Algorithms | 2023-04-27 | Paper |
| Oblivious RAM with worst-case logarithmic overhead | 2023-04-13 | Paper |
| On the adaptive security of MACs and PRFs | 2023-03-21 | Paper |
| Communication complexity of Byzantine agreement, revisited | 2023-03-14 | Paper |
| MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture | 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)}$ | 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 |
| OptORAMa: optimal oblivious RAM | 2022-03-23 | Paper |
| Secure massively parallel computation for dishonest majority | 2022-03-23 | Paper |
| Locality-preserving oblivious RAM | 2022-03-03 | Paper |
| Non-interactive anonymous router | 2021-12-08 | Paper |
| Sublinear-round Byzantine agreement under corrupt majority | 2021-12-01 | Paper |
| Expected constant round Byzantine broadcast under dishonest 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 | 2021-10-18 | Paper |
| Communication Complexity of Byzantine Agreement, Revisited | 2021-01-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 |
| Towards attribute-based encryption for RAMs from LWE: sub-linear decryption, and more | 2020-05-20 | Paper |
| Locally decodable and updatable non-malleable codes and their applications | 2020-03-03 | Paper |
| Locality-preserving oblivious RAM | 2020-02-06 | Paper |
| Lower bounds for external memory integer sorting via network coding | 2020-01-30 | Paper |
| Can We Overcome the n log n Barrier for Oblivious Sorting? | 2019-10-15 | Paper |
| Foundations of Differentially Oblivious Algorithms | 2019-10-15 | Paper |
| Oblivious network RAM and leveraging parallelism to achieve obliviousness | 2019-08-13 | Paper |
| More is less: perfectly secure oblivious algorithms in the multi-server setting | 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 | 2018-12-06 | Paper |
| Distributed Private Data Analysis | 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 |
| https://portal.mardi4nfdi.de/entity/Q4608037 | 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 | 2017-10-11 | Paper |
| Formal Abstractions for Attested Execution Secure Processors | 2017-06-13 | Paper |
| Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness | 2016-06-10 | Paper |
| Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM | 2016-04-08 | Paper |
| Constant-Round MPC with Fairness and Guarantee of Output Delivery | 2015-12-10 | Paper |
| Locally Decodable and Updatable Non-malleable Codes and Their Applications | 2015-07-06 | Paper |
| Multi-Client Verifiable Computation with Stronger Security Guarantees | 2015-07-06 | Paper |
| Multi-input Functional Encryption | 2014-05-27 | Paper |
| Verifiable Oblivious Storage | 2014-03-25 | Paper |
| Streaming Authenticated Data Structures | 2013-05-31 | Paper |
| Signatures of Correct Computation | 2013-03-18 | Paper |
| Privacy-Preserving Stream Aggregation with Fault Tolerance | 2012-11-09 | Paper |
| Optimal Lower Bound for Differentially Private Multi-party Aggregation | 2012-09-25 | Paper |
| Policy-Enhanced Private Set Intersection: Sharing Information While Enforcing Privacy Policies | 2012-07-20 | Paper |
| Oblivious RAM with O((logN)3) Worst-Case Cost | 2011-12-02 | Paper |
| Private and Continual Release of Statistics | 2010-09-07 | Paper |
| Signatures of Reputation | 2010-08-17 | Paper |
| Predicate Privacy in Encryption Systems | 2009-03-03 | Paper |
| Delegating Capabilities in Predicate Encryption Systems | 2008-08-19 | Paper |
