A visualization of the primal simplex algorithm for the assignment problem. - Charalampos Papamanthou; Konstantinos Paparrizos (ITiCSE, 2003)

3D Visualization of Semantic Metadata Models and Ontologies. - Charalampos Papamanthou; Ioannis G. Tollis; Martin Doerr (GD, 2004)

Computational experience with exterior point algorithms for the transportation problem. - Charalampos Papamanthou; Konstantinos Paparrizos; Nikolaos Samaras (Appl. Math. Comput., 2004)

Applications of Parameterized st-Orientations in Graph Drawing Algorithms. - Charalampos Papamanthou; Ioannis G. Tollis (GD, 2005)

Parameterized st -Orientations of Graphs: Algorithms and Experiments. - Charalampos Papamanthou; Ioannis G. Tollis (GD, 2006)

Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures. - Charalampos Papamanthou; Roberto Tamassia (ICICS, 2007)

On the Cost of Persistence and Authentication in Skip Lists. - Michael T. Goodrich; Charalampos Papamanthou; Roberto Tamassia (WEA, 2007)

Algorithms for Location Estimation Based on RSSI Sampling. - Charalampos Papamanthou; Franco P. Preparata; Roberto Tamassia (ALGOSENSORS, 2008)

Authenticated hash tables. - Charalampos Papamanthou; Roberto Tamassia; Nikos Triandopoulos (CCS, 2008)

Graph Drawing for Security Visualization. - Roberto Tamassia; Bernardo Palazzi; Charalampos Papamanthou (GD, 2008)

Athos: Efficient Authentication of Outsourced File Systems. - Michael T. Goodrich; Charalampos Papamanthou; Roberto Tamassia; Nikos Triandopoulos (ISC, 2008)

Efficient integrity checking of untrusted network storage. - Alexander Heitzmann; Bernardo Palazzi; Charalampos Papamanthou; Roberto Tamassia (StorageSS, 2008)

Effective Visualization of File System Access-Control. - Alexander Heitzmann; Bernardo Palazzi; Charalampos Papamanthou; Roberto Tamassia (VizSEC, 2008)

Worst case examples of an exterior point algorithm for the assignment problem. - Charalampos Papamanthou; Konstantinos Paparrizos; Nikolaos Samaras; Konstantinos Stergiou 001 (Discret. Optim., 2008)

Distortion lower bounds for line embeddings. - Claire Mathieu; Charalampos Papamanthou (Inf. Process. Lett., 2008)

Algorithms for computing a parameterized st-orientation. - Charalampos Papamanthou; Ioannis G. Tollis (Theor. Comput. Sci., 2008)

Cryptographic Accumulators for Authenticated Hash Tables. - Charalampos Papamanthou; Roberto Tamassia; Nikos Triandopoulos (IACR Cryptol. ePrint Arch., 2009)

Optimal Authenticated Data Structures with Multilinear Forms. - Charalampos Papamanthou; Roberto Tamassia; Nikos Triandopoulos (Pairing, 2010)

Optimal Verification of Operations on Dynamic Sets. - Charalampos Papamanthou; Roberto Tamassia; Nikos Triandopoulos (IACR Cryptol. ePrint Arch., 2010)

On the initialization methods of an exterior point algorithm for the assignment problem. - Charalampos Papamanthou; Konstantinos Paparrizos; Nikolaos Samaras; Angelo Sifaleras (Int. J. Comput. Math., 2010)

Corrigendum: On the initialization methods of an exterior point algorithm for the assignment problem. - Charalampos Papamanthou; Konstantinos Paparrizos; Nikolaos Samaras; Angelo Sifaleras (Int. J. Comput. Math., 2010)

Applications of Parameterized st-Orientations. - Charalampos Papamanthou; Ioannis G. Tollis (J. Graph Algorithms Appl., 2010)

MOMMIE Knows Best: Systematic Optimizations for Verifiable Distributed Algorithms. - Michael Dietz; Charalampos Papamanthou (HotOS, 2011)

Publicly Verifiable Delegation of Computation. - Charalampos Papamanthou; Elaine Shi; Roberto Tamassia (IACR Cryptol. ePrint Arch., 2011)

Cryptography for Efficiency: Authenticated Data Structures Based on Lattices and Parallel Online Memory Checking. - Charalampos Papamanthou; Roberto Tamassia (IACR Cryptol. ePrint Arch., 2011)

Cryptography for Efficiency: New Directions in Authenticated Data Structures. - Charalampos Papamanthou (2011)

Verifying Search Results Over Web Collections - Michael T. Goodrich; Duy Nguyen; Olga Ohrimenko; Charalampos Papamanthou; Roberto Tamassia; Nikos Triandopoulos; Cristina Videira Lopes (CoRR, 2012)

Dynamic Searchable Symmetric Encryption. - Seny Kamara; Charalampos Papamanthou; Tom Roeder (IACR Cryptol. ePrint Arch., 2012)

Efficient Verification of Web-Content Searching Through Authenticated Web Crawlers. - Michael T. Goodrich; Duy Nguyen; Olga Ohrimenko; Charalampos Papamanthou; Roberto Tamassia; Nikos Triandopoulos; Cristina Videira Lopes (Proc. VLDB Endow., 2012)

Practical dynamic proofs of retrievability. - Elaine Shi; Emil Stefanov; Charalampos Papamanthou (CCS, 2013)

Streaming Authenticated Data Structures. - Charalampos Papamanthou; Elaine Shi; Roberto Tamassia; Ke Yi 001 (EUROCRYPT, 2013)

Preserving Link Privacy in Social Network Based Systems. - Prateek Mittal; Charalampos Papamanthou; Dawn Xiaodong Song (NDSS, 2013)

Signatures of Correct Computation. - Charalampos Papamanthou; Elaine Shi; Roberto Tamassia (TCC, 2013)

Parallel and Dynamic Searchable Symmetric Encryption. - Seny Kamara; Charalampos Papamanthou (IACR Cryptol. ePrint Arch., 2013)

Practical Dynamic Searchable Encryption with Small Leakage. - Emil Stefanov; Charalampos Papamanthou; Elaine Shi (IACR Cryptol. ePrint Arch., 2013)

Computer Security. - Olga Ohrimenko; Charalampos Papamanthou; Bernardo Palazzi (Handbook of Graph Drawing and Visualization, 2013)

Streaming Authenticated Data Structures: Abstraction and Implementation. - Yi Qian; Yupeng Zhang 001; Xi Chen; Charalampos Papamanthou (CCSW, 2014)

ALITHEIA: Towards Practical Verifiable Graph Processing. - Yupeng Zhang 001; Charalampos Papamanthou; Jonathan Katz (CCS, 2014)

TRUESET: Faster Verifiable Set Computations. - Ahmed E. Kosba; Dimitrios Papadopoulos 001; Charalampos Papamanthou; Mahmoud F. Sayed; Elaine Shi; Nikos Triandopoulos (USENIX Security Symposium, 2014)

Accountable Storage. - Giuseppe Ateniese; Michael T. Goodrich; Vassilios Lekakis; Charalampos Papamanthou; Evripidis Paraskevas; Roberto Tamassia (IACR Cryptol. ePrint Arch., 2014)

TRUESET: Nearly Practical Verifiable Set Computations. - Ahmed E. Kosba; Dimitrios Papadopoulos 001; Charalampos Papamanthou; Mahmoud F. Sayed; Elaine Shi; Nikos Triandopoulos (IACR Cryptol. ePrint Arch., 2014)

IntegriDB: Verifiable SQL for Outsourced Databases. - Yupeng Zhang 001; Jonathan Katz; Charalampos Papamanthou (CCS, 2015)

On the Complexity of the Minimum Independent Set Partition Problem. - T.-H. Hubert Chan; Charalampos Papamanthou; Zhichao Zhao (COCOON, 2015)

Oblivious Network RAM. - Dana Dachman-Soled; Chang Liu 021; Charalampos Papamanthou; Elaine Shi; Uzi Vishkin (IACR Cryptol. ePrint Arch., 2015)

TWORAM: Round-Optimal Oblivious RAM with Applications to Searchable Encryption. - Sanjam Garg; Payman Mohassel; Charalampos Papamanthou (IACR Cryptol. ePrint Arch., 2015)

Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts. - Ahmed E. Kosba; Andrew Miller 001; Elaine Shi; Zikai Wen; Charalampos Papamanthou (IACR Cryptol. ePrint Arch., 2015)

How to Use SNARKs in Universally Composable Protocols. - Ahmed E. Kosba; Zhichao Zhao; Andrew Miller 001; Yi Qian; T.-H. Hubert Chan; Charalampos Papamanthou; Rafael Pass; Abhi Shelat; Elaine Shi (IACR Cryptol. ePrint Arch., 2015)

Practical Authenticated Pattern Matching with Optimal Proof Size. - Dimitrios Papadopoulos 001; Charalampos Papamanthou; Roberto Tamassia; Nikos Triandopoulos (Proc. VLDB Endow., 2015)

Dynamic Provable Data Possession. - C. Christopher Erway; Alptekin Küpçü; Charalampos Papamanthou; Roberto Tamassia (ACM Trans. Inf. Syst. Secur., 2015)

TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption. - Sanjam Garg; Payman Mohassel; Charalampos Papamanthou (CRYPTO (3), 2016)

Authenticated Hash Tables Based on Cryptographic Accumulators. - Charalampos Papamanthou; Roberto Tamassia; Nikos Triandopoulos (Algorithmica, 2016)

All Your Queries Are Belong to Us: The Power of File-Injection Attacks on Searchable Encryption. - Yupeng Zhang 001; Jonathan Katz; Charalampos Papamanthou (IACR Cryptol. ePrint Arch., 2016)

An Expressive (Zero-Knowledge) Set Accumulator. - Yupeng Zhang 001; Jonathan Katz; Charalampos Papamanthou (EuroS&P, 2017)

Fast Searchable Encryption With Tunable Locality. - Ioannis Demertzis; Charalampos Papamanthou (SIGMOD Conference, 2017)

Searchable Encryption with Optimal Locality: Achieving Sublogarithmic Read Efficiency. - Ioannis Demertzis; Dimitrios Papadopoulos 001; Charalampos Papamanthou (IACR Cryptol. ePrint Arch., 2017)

vSQL: Verifying Arbitrary SQL Queries over Dynamic Outsourced Databases. - Yupeng Zhang 001; Daniel Genkin; Jonathan Katz; Dimitrios Papadopoulos 001; Charalampos Papamanthou (IACR Cryptol. ePrint Arch., 2017)

A Zero-Knowledge Version of vSQL. - Yupeng Zhang 001; Daniel Genkin; Jonathan Katz; Dimitrios Papadopoulos 001; Charalampos Papamanthou (IACR Cryptol. ePrint Arch., 2017)

DATS - Data Containers for Web Applications. - Casen Hunger; Lluís Vilanova; Charalampos Papamanthou; Yoav Etsion; Mohit Tiwari (ASPLOS, 2018)

New Constructions for Forward and Backward Private Symmetric Searchable Encryption. - Javad Ghareh Chamani; Dimitrios Papadopoulos 001; Charalampos Papamanthou; Rasool Jalili (CCS, 2018)

Understanding User Tradeoffs for Search in Encrypted Communication. - Wei Bai 004; Ciara Lynton; Charalampos Papamanthou; Michelle L. Mazurek (EuroS&P, 2018)

xJsnark: A Framework for Efficient Verifiable Computation. - Ahmed E. Kosba; Charalampos Papamanthou; Elaine Shi (IEEE Symposium on Security and Privacy, 2018)

vRAM: Faster Verifiable RAM with Program-Independent Preprocessing. - Yupeng Zhang 001; Daniel Genkin; Jonathan Katz; Dimitrios Papadopoulos 001; Charalampos Papamanthou (IEEE Symposium on Security and Privacy, 2018)

Privacy in decentralized cryptocurrencies. - Daniel Genkin; Dimitrios Papadopoulos 001; Charalampos Papamanthou (Commun. ACM, 2018)

Edrax: A Cryptocurrency with Stateless Transaction Validation. - Alexander Chepurnoy; Charalampos Papamanthou; Yupeng Zhang 001 (IACR Cryptol. ePrint Arch., 2018)

Data Recovery on Encrypted Databases With k-Nearest Neighbor Query Leakage. - Evgenios M. Kornaropoulos; Charalampos Papamanthou; Roberto Tamassia (IACR Cryptol. ePrint Arch., 2018)

Transparency Logs via Append-only Authenticated Dictionaries. - Alin Tomescu; Vivek Bhupatiraju; Dimitrios Papadopoulos 001; Charalampos Papamanthou; Nikos Triandopoulos; Srinivas Devadas (IACR Cryptol. ePrint Arch., 2018)

Efficient Dynamic Searchable Encryption with Forward Privacy. - Mohammad Etemad; Alptekin Küpçü; Charalampos Papamanthou; David Evans 001 (Proc. Priv. Enhancing Technol., 2018)

Efficient Searchable Encryption Through Compression. - Ioannis Demertzis; Charalampos Papamanthou; Rajdeep Talapatra (Proc. VLDB Endow., 2018)

Verifiable Graph Processing. - Yupeng Zhang 001; Charalampos Papamanthou; Jonathan Katz (ACM Trans. Priv. Secur., 2018)

Practical Private Range Search in Depth. - Ioannis Demertzis; Stavros Papadopoulos 001; Odysseas Papapetrou; Antonios Deligiannakis; Minos N. Garofalakis; Charalampos Papamanthou (ACM Trans. Database Syst., 2018)

CCSW'19 Workshop Summary: 2019 Cloud Computing Security Workshop. - Radu Sion; Charalampos Papamanthou (CCS, 2019)

Dynamic Searchable Encryption with Small Client Storage. - Ioannis Demertzis; Javad Ghareh Chamani; Dimitrios Papadopoulos 001; Charalampos Papamanthou (IACR Cryptol. ePrint Arch., 2019)

SEAL: Attack Mitigation for Encrypted Databases via Adjustable Leakage. - Ioannis Demertzis; Dimitrios Papadopoulos 001; Charalampos Papamanthou; Saurabh Shintre (IACR Cryptol. ePrint Arch., 2019)

The State of the Uniform: Attacks on Encrypted Databases Beyond the Uniform Query Distribution. - Evgenios M. Kornaropoulos; Charalampos Papamanthou; Roberto Tamassia (IACR Cryptol. ePrint Arch., 2019)

Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation. - Tiancheng Xie; Jiaheng Zhang; Yupeng Zhang 001; Charalampos Papamanthou; Dawn Song (IACR Cryptol. ePrint Arch., 2019)

Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness. - Dana Dachman-Soled; Chang Liu 021; Charalampos Papamanthou; Elaine Shi; Uzi Vishkin (J. Cryptol., 2019)

Note on Generalized Cuckoo Hashing with a Stash. - Brice Minaud; Charalampos Papamanthou (CoRR, 2020)

MIRAGE: Succinct Arguments for Randomized Algorithms with Applications to Universal zk-SNARKs. - Ahmed E. Kosba; Dimitrios Papadopoulos 001; Charalampos Papamanthou; Dawn Song (IACR Cryptol. ePrint Arch., 2020)

Nearly Quadratic Broadcast Without Trusted Setup Under Dishonest Majority. - Georgios Tsimos; Julian Loss; Charalampos Papamanthou (IACR Cryptol. ePrint Arch., 2020)

Response-Hiding Encrypted Ranges: Revisiting Security via Parametrized Leakage-Abuse Attacks. - Evgenios M. Kornaropoulos; Charalampos Papamanthou; Roberto Tamassia (IACR Cryptol. ePrint Arch., 2021)

Indifferentiable Signatures: High Performance and Fallback Security. - Charalampos Papamanthou; Cong Zhang; Hong-Sheng Zhou (IACR Cryptol. ePrint Arch., 2021)

Hyperproofs: Aggregating and Maintaining Proofs in Vector Commitments. - Shravan Srinivasan; Alexander Chepurnoy; Charalampos Papamanthou; Alin Tomescu; Yupeng Zhang 001 (IACR Cryptol. ePrint Arch., 2021)

Leakage Inversion: Towards Quantifying Privacy in Searchable Encryption. - Evgenios M. Kornaropoulos; Nathaniel Moyer; Charalampos Papamanthou; Alexandros Psomas 001 (CCS, 2022)

Gossiping for Communication-Efficient Broadcast. - Georgios Tsimos; Julian Loss; Charalampos Papamanthou (CRYPTO (3), 2022)

Sublinear-round Broadcast without trusted setup against dishonest majority. - Andreea B. Alexandru; Julian Loss; Charalampos Papamanthou; Giorgos Tsimos (IACR Cryptol. ePrint Arch., 2022)

Single Server PIR with Sublinear Amortized Time and Polylogarithmic Bandwidth. - Arthur Lazzaretti; Charalampos Papamanthou (IACR Cryptol. ePrint Arch., 2022)

Batching, Aggregation, and Zero-Knowledge Proofs in Bilinear Accumulators. - Shravan Srinivasan; Ioanna Karantaidou; Foteini Baldimtsi; Charalampos Papamanthou (IACR Cryptol. ePrint Arch., 2022)

Transparent Batchable Time-lock Puzzles and Applications to Byzantine Consensus. - Shravan Srinivasan; Julian Loss; Giulio Malavolta; Kartik Nayak; Charalampos Papamanthou; Sri Aravinda Krishnan Thyagarajan (IACR Cryptol. ePrint Arch., 2022)

BalanceProofs: Maintainable Vector Commitments with Fast Aggregation. - Weijie Wang; Annie Ulichney; Charalampos Papamanthou (IACR Cryptol. ePrint Arch., 2022)

Near-Optimal Private Information Retrieval with Preprocessing. - Arthur Lazzaretti; Charalampos Papamanthou (TCC (2), 2023)

Deterministic Byzantine Agreement with Adaptive O(n· f) Communication. - Fatima Elsheimy; Giorgos Tsimos; Charalampos Papamanthou (IACR Cryptol. ePrint Arch., 2023)

TreePIR: Sublinear-Time and Polylog-Bandwidth Private Information Retrieval from DDH. - Arthur Lazzaretti; Charalampos Papamanthou (IACR Cryptol. ePrint Arch., 2023)

The Locality of Memory Checking. - Weijie Wang; Yujie Lu; Charalampos Papamanthou; Fan Zhang 022 (IACR Cryptol. ePrint Arch., 2023)

GraphOS: Towards Oblivious Graph Processing. - Javad Ghareh Chamani; Ioannis Demertzis; Dimitrios Papadopoulos 001; Charalampos Papamanthou; Rasool Jalili (Proc. VLDB Endow., 2023)

Generalized cuckoo hashing with a stash, revisited. - Brice Minaud; Charalampos Papamanthou (Inf. Process. Lett., 2023)

ThorPIR: Single Server PIR via Homomorphic Thorp Shuffles. - Ben Fisch; Arthur Lazzaretti; Zeyu Liu 004; Charalampos Papamanthou (CCS, 2024)

Deterministic Byzantine Agreement with Adaptive O(n · f) Communication. - Fatima Elsheimy; Giorgos Tsimos; Charalampos Papamanthou (SODA, 2024)

Sublinear-Round Broadcast without Trusted Setup. - Andreea B. Alexandru; Julian Loss; Charalampos Papamanthou; Giorgos Tsimos; Benedikt Wagner (IACR Cryptol. ePrint Arch., 2024)

Towards Optimal Parallel Broadcast under a Dishonest Majority. - Daniel Collins 001; Sisi Duan; Julian Loss; Charalampos Papamanthou; Giorgos Tsimos; Haochen Wang (IACR Cryptol. ePrint Arch., 2024)

Early Stopping Byzantine Agreement in (1+ε)· f Rounds. - Fatima Elsheimy; Julian Loss; Charalampos Papamanthou (IACR Cryptol. ePrint Arch., 2024)

Single Server PIR via Homomorphic Thorp Shuffles. - Ben Fisch; Arthur Lazzaretti; Zeyu Liu 004; Charalampos Papamanthou (IACR Cryptol. ePrint Arch., 2024)

Multi-Server Doubly Efficient PIR. - Arthur Lazzaretti; Zeyu Liu 004; Ben Fisch; Charalampos Papamanthou (IACR Cryptol. ePrint Arch., 2024)

Single Pass Client-Preprocessing Private Information Retrieval. - Arthur Lazzaretti; Charalampos Papamanthou (IACR Cryptol. ePrint Arch., 2024)

Robust Double Auctions for Resource Allocation. - Arthur Lazzaretti; Charalampos Papamanthou; Ismael Hishon-Rezaizadeh (IACR Cryptol. ePrint Arch., 2024)

Reckle Trees: Updatable Merkle Batch Proofs with Applications. - Charalampos Papamanthou; Shravan Srinivasan; Nicolas Gailly; Ismael Hishon-Rezaizadeh; Andrus Salumets; Stjepan Golemac (IACR Cryptol. ePrint Arch., 2024)

Dynamic zk-SNARKs. - Weijie Wang; Charalampos Papamanthou; Shravan Srinivasan; Dimitrios Papadopoulos 001 (IACR Cryptol. ePrint Arch., 2024)

Towards Optimal Early Stopping Agreement Protocols. - Fatima Elsheimy; Julian Loss; Charalampos Papamanthou (IACR Cryptol. ePrint Arch., 2025)

HydraProofs: Optimally Computing All Proofs in a Vector Commitment (with applications to efficient zkSNARKs over data from multiple users). - Christodoulos Pappas; Dimitrios Papadopoulos 001; Charalampos Papamanthou (IACR Cryptol. ePrint Arch., 2025)

Practical and Accurate Local Edge Differentially Private Graph Algorithms. - Pranay Mundra; Charalampos Papamanthou; Julian Shun; Quanquan C. Liu (CoRR, 2025)

Pushing the Limits of Frequency Analysis in Leakage Abuse Attacks. - Nathaniel Moyer; Charalampos Papamanthou; Evgenios M. Kornaropoulos (CoRR, 2025)