| Towards Optimal Parallel Broadcast under a Dishonest Majority D Collins, S Duan, J Loss, C Papamanthou, G Tsimos, H Wang Cryptology ePrint Archive, 2024 | | 2024 |
| Multi-Server Doubly Efficient PIR A Lazzaretti, Z Liu, B Fisch, C Papamanthou Cryptology ePrint Archive, 2024 | | 2024 |
| Early Stopping Byzantine Agreement in Rounds F Elsheimy, J Loss, C Papamanthou Cryptology ePrint Archive, 2024 | | 2024 |
| Sublinear-Round Broadcast without Trusted Setup AB Alexandru, J Loss, C Papamanthou, G Tsimos, B Wagner Cryptology ePrint Archive, 2024 | | 2024 |
| Reckle Trees: Updatable Merkle Batch Proofs with Applications C Papamanthou, S Srinivasan, N Gailly, I Hishon-Rezaizadeh, ... Cryptology ePrint Archive, 2024 | | 2024 |
| Single server pir via homomorphic thorp shuffles B Fisch, A Lazzaretti, Z Liu, C Papamanthou Cryptology ePrint Archive, 2024 | 3 | 2024 |
| Single Pass Client-Preprocessing Private Information Retrieval. A Lazzaretti, C Papamanthou IACR Cryptol. ePrint Arch. 2024, 303, 2024 | 2 | 2024 |
| Graphos: Towards oblivious graph processing JG Chamani, I Demertzis, D Papadopoulos, C Papamanthou, R Jalili Cryptology ePrint Archive, 2024 | 4 | 2024 |
| Deterministic Byzantine Agreement with Adaptive O(n · f) Communication F Elsheimy, G Tsimos, C Papamanthou Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 3 | 2024 |
| Near-optimal private information retrieval with preprocessing A Lazzaretti, C Papamanthou Theory of Cryptography Conference, 406-435, 2023 | 7 | 2023 |
| The locality of memory checking W Wang, Y Lu, C Papamanthou, F Zhang Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications …, 2023 | 3 | 2023 |
| Treepir: Sublinear-time and polylog-bandwidth private information retrieval from ddh A Lazzaretti, C Papamanthou Annual International Cryptology Conference, 284-314, 2023 | 16 | 2023 |
| Transparent batchable time-lock puzzles and applications to byzantine consensus S Srinivasan, J Loss, G Malavolta, K Nayak, C Papamanthou, ... IACR International Conference on Public-Key Cryptography, 554-584, 2023 | 13 | 2023 |
| Generalized cuckoo hashing with a stash, revisited B Minaud, C Papamanthou Information Processing Letters 181, 106356, 2023 | 3 | 2023 |
| {BalanceProofs}: Maintainable vector commitments with fast aggregation W Wang, A Ulichney, C Papamanthou 32nd USENIX Security Symposium (USENIX Security 23), 4409-4426, 2023 | 15 | 2023 |
| Leakage inversion: Towards quantifying privacy in searchable encryption EM Kornaropoulos, N Moyer, C Papamanthou, A Psomas Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications …, 2022 | 23 | 2022 |
| Batching, aggregation, and zero-knowledge proofs in bilinear accumulators S Srinivasan, I Karantaidou, F Baldimtsi, C Papamanthou Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications …, 2022 | 17 | 2022 |
| Gossiping for communication-efficient broadcast G Tsimos, J Loss, C Papamanthou Annual International Cryptology Conference, 439-469, 2022 | 23 | 2022 |
| Sublinear-round broadcast without trusted setup against dishonest majority AB Alexandru, J Loss, C Papamanthou, G Tsimos Cryptology ePrint Archive, 2022 | 7 | 2022 |
| Single Server PIR with Sublinear Amortized Time and Polylogarithmic Bandwidth. A Lazzaretti, C Papamanthou IACR Cryptol. ePrint Arch. 2022, 830, 2022 | 6 | 2022 |
Roberto TamassiaPlastech Professor of Computer Science, Brown UniversityVerified email at cs.brown.edu