Charalampos Papamanthou

Orcid: 0000-0002-1905-9403

Affiliations:
  • Yale University, USA
  • University of Maryland, College Park (former)
  • University of California at Berkeley, Computer Science Division (former)
  • Brown University, Department of Computer Science (former)


According to our database1, Charalampos Papamanthou authored at least 111 papers between 2003 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Pushing the Limits of Frequency Analysis in Leakage Abuse Attacks.
CoRR, August, 2025

Practical and Accurate Local Edge Differentially Private Graph Algorithms.
Proc. VLDB Endow., July, 2025

TACITA: Threshold Aggregation without Client Interaction.
IACR Cryptol. ePrint Arch., 2025

Towards Optimal Early Stopping Agreement Protocols.
IACR Cryptol. ePrint Arch., 2025

HydraProofs: Optimally Computing All Proofs in a Vector Commitment (With Applications to Efficient zkSNARKs Over Data from Multiple Users).
Proceedings of the IEEE Symposium on Security and Privacy, 2025

Sublinear-Round Broadcast without Trusted Setup.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024
Dynamic zk-SNARKs.
IACR Cryptol. ePrint Arch., 2024

Robust Double Auctions for Resource Allocation.
IACR Cryptol. ePrint Arch., 2024

Multi-Server Doubly Efficient PIR.
IACR Cryptol. ePrint Arch., 2024

Single Server PIR via Homomorphic Thorp Shuffles.
IACR Cryptol. ePrint Arch., 2024

Towards Optimal Parallel Broadcast under a Dishonest Majority.
IACR Cryptol. ePrint Arch., 2024

Single Pass Client-Preprocessing Private Information Retrieval.
Proceedings of the 33rd USENIX Security Symposium, 2024

Deterministic Byzantine Agreement with Adaptive <i>O</i>(<i>n</i> · <i>f</i>) Communication.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Reckle Trees: Updatable Merkle Batch Proofs with Applications.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

ThorPIR: Single Server PIR via Homomorphic Thorp Shuffles.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

Early Stopping Byzantine Agreement in (1+ε ) · f Rounds.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023
Generalized cuckoo hashing with a stash, revisited.
Inf. Process. Lett., March, 2023

GraphOS: Towards Oblivious Graph Processing.
Proc. VLDB Endow., 2023

Deterministic Byzantine Agreement with Adaptive O(n· f) Communication.
IACR Cryptol. ePrint Arch., 2023

BalanceProofs: Maintainable Vector Commitments with Fast Aggregation.
Proceedings of the 32nd USENIX Security Symposium, 2023

Near-Optimal Private Information Retrieval with Preprocessing.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Transparent Batchable Time-lock Puzzles and Applications to Byzantine Consensus.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

TreePIR: Sublinear-Time and Polylog-Bandwidth Private Information Retrieval from DDH.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

The Locality of Memory Checking.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
Single Server PIR with Sublinear Amortized Time and Polylogarithmic Bandwidth.
IACR Cryptol. ePrint Arch., 2022

Sublinear-round Broadcast without trusted setup against dishonest majority.
IACR Cryptol. ePrint Arch., 2022

Hyperproofs: Aggregating and Maintaining Proofs in Vector Commitments.
Proceedings of the 31st USENIX Security Symposium, 2022

Gossiping for Communication-Efficient Broadcast.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Batching, Aggregation, and Zero-Knowledge Proofs in Bilinear Accumulators.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

Leakage Inversion: Towards Quantifying Privacy in Searchable Encryption.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021
Indifferentiable Signatures: High Performance and Fallback Security.
IACR Cryptol. ePrint Arch., 2021

Response-Hiding Encrypted Ranges: Revisiting Security via Parametrized Leakage-Abuse Attacks.
Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

2020
Nearly Quadratic Broadcast Without Trusted Setup Under Dishonest Majority.
IACR Cryptol. ePrint Arch., 2020

Note on Generalized Cuckoo Hashing with a Stash.
CoRR, 2020

MIRAGE: Succinct Arguments for Randomized Algorithms with Applications to Universal zk-SNARKs.
Proceedings of the 29th USENIX Security Symposium, 2020

SEAL: Attack Mitigation for Encrypted Databases via Adjustable Leakage.
Proceedings of the 29th USENIX Security Symposium, 2020

The State of the Uniform: Attacks on Encrypted Databases Beyond the Uniform Query Distribution.
Proceedings of the 2020 IEEE Symposium on Security and Privacy, 2020

Dynamic Searchable Encryption with Small Client Storage.
Proceedings of the 27th Annual Network and Distributed System Security Symposium, 2020

2019
Data Recovery on Encrypted Databases with k-Nearest Neighbor Query Leakage.
Proceedings of the 2019 IEEE Symposium on Security and Privacy, 2019

Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Transparency Logs via Append-Only Authenticated Dictionaries.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

CCSW'19 Workshop Summary: 2019 Cloud Computing Security Workshop.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018
Practical Private Range Search in Depth.
ACM Trans. Database Syst., 2018

Verifiable Graph Processing.
ACM Trans. Priv. Secur., 2018

Efficient Searchable Encryption Through Compression.
Proc. VLDB Endow., 2018

Efficient Dynamic Searchable Encryption with Forward Privacy.
Proc. Priv. Enhancing Technol., 2018

Edrax: A Cryptocurrency with Stateless Transaction Validation.
IACR Cryptol. ePrint Arch., 2018

Privacy in decentralized cryptocurrencies.
Commun. ACM, 2018

vRAM: Faster Verifiable RAM with Program-Independent Preprocessing.
Proceedings of the 2018 IEEE Symposium on Security and Privacy, 2018

xJsnark: A Framework for Efficient Verifiable Computation.
Proceedings of the 2018 IEEE Symposium on Security and Privacy, 2018

Understanding User Tradeoffs for Search in Encrypted Communication.
Proceedings of the 2018 IEEE European Symposium on Security and Privacy, 2018

Searchable Encryption with Optimal Locality: Achieving Sublogarithmic Read Efficiency.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

New Constructions for Forward and Backward Private Symmetric Searchable Encryption.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

DATS - Data Containers for Web Applications.
Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems, 2018

2017
A Zero-Knowledge Version of vSQL.
IACR Cryptol. ePrint Arch., 2017

vSQL: Verifying Arbitrary SQL Queries over Dynamic Outsourced Databases.
Proceedings of the 2017 IEEE Symposium on Security and Privacy, 2017

Fast Searchable Encryption With Tunable Locality.
Proceedings of the 2017 ACM International Conference on Management of Data, 2017

An Expressive (Zero-Knowledge) Set Accumulator.
Proceedings of the 2017 IEEE European Symposium on Security and Privacy, 2017

Accountable Storage.
Proceedings of the Applied Cryptography and Network Security, 2017

2016
Authenticated Hash Tables Based on Cryptographic Accumulators.
Algorithmica, 2016

All Your Queries Are Belong to Us: The Power of File-Injection Attacks on Searchable Encryption.
Proceedings of the 25th USENIX Security Symposium, 2016

Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts.
Proceedings of the IEEE Symposium on Security and Privacy, 2016

TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015
Practical Authenticated Pattern Matching with Optimal Proof Size.
Proc. VLDB Endow., 2015

How to Use SNARKs in Universally Composable Protocols.
IACR Cryptol. ePrint Arch., 2015

TWORAM: Round-Optimal Oblivious RAM with Applications to Searchable Encryption.
IACR Cryptol. ePrint Arch., 2015

Oblivious Network RAM.
IACR Cryptol. ePrint Arch., 2015

On the Complexity of the Minimum Independent Set Partition Problem.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

IntegriDB: Verifiable SQL for Outsourced Databases.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014
TRUESET: Nearly Practical Verifiable Set Computations.
IACR Cryptol. ePrint Arch., 2014

TRUESET: Faster Verifiable Set Computations.
Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, USA, August 20-22, 2014., 2014

Practical Dynamic Searchable Encryption with Small Leakage.
Proceedings of the 21st Annual Network and Distributed System Security Symposium, 2014

ALITHEIA: Towards Practical Verifiable Graph Processing.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

Streaming Authenticated Data Structures: Abstraction and Implementation.
Proceedings of the 6th edition of the ACM Workshop on Cloud Computing Security, 2014

2013
Computer Security.
Proceedings of the Handbook on Graph Drawing and Visualization., 2013

Signatures of Correct Computation.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Preserving Link Privacy in Social Network Based Systems.
Proceedings of the 20th Annual Network and Distributed System Security Symposium, 2013

Parallel and Dynamic Searchable Symmetric Encryption.
Proceedings of the Financial Cryptography and Data Security, 2013

Streaming Authenticated Data Structures.
Proceedings of the Advances in Cryptology, 2013

Practical dynamic proofs of retrievability.
Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

2012
Efficient Verification of Web-Content Searching Through Authenticated Web Crawlers.
Proc. VLDB Endow., 2012

Verifying Search Results Over Web Collections
CoRR, 2012

Dynamic searchable symmetric encryption.
Proceedings of the ACM Conference on Computer and Communications Security, 2012

2011
Cryptography for Efficiency: New Directions in Authenticated Data Structures.
PhD thesis, 2011

Cryptography for Efficiency: Authenticated Data Structures Based on Lattices and Parallel Online Memory Checking.
IACR Cryptol. ePrint Arch., 2011

Publicly Verifiable Delegation of Computation.
IACR Cryptol. ePrint Arch., 2011

MOMMIE Knows Best: Systematic Optimizations for Verifiable Distributed Algorithms.
Proceedings of the 13th Workshop on Hot Topics in Operating Systems, 2011

Optimal Verification of Operations on Dynamic Sets.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010
Applications of Parameterized st-Orientations.
J. Graph Algorithms Appl., 2010

Corrigendum: On the initialization methods of an exterior point algorithm for the assignment problem.
Int. J. Comput. Math., 2010

On the initialization methods of an exterior point algorithm for the assignment problem.
Int. J. Comput. Math., 2010

Optimal Authenticated Data Structures with Multilinear Forms.
Proceedings of the Pairing-Based Cryptography - Pairing 2010, 2010

2009
Cryptographic Accumulators for Authenticated Hash Tables.
IACR Cryptol. ePrint Arch., 2009

Dynamic provable data possession.
Proceedings of the 2009 ACM Conference on Computer and Communications Security, 2009

2008
Algorithms for computing a parameterized st-orientation.
Theor. Comput. Sci., 2008

Distortion lower bounds for line embeddings.
Inf. Process. Lett., 2008

Worst case examples of an exterior point algorithm for the assignment problem.
Discret. Optim., 2008

Effective Visualization of File System Access-Control.
Proceedings of the 5th International Workshop on Visualization for Computer Security, 2008

Efficient integrity checking of untrusted network storage.
Proceedings of the 2008 ACM Workshop On Storage Security And Survivability, 2008

Athos: Efficient Authentication of Outsourced File Systems.
Proceedings of the Information Security, 11th International Conference, 2008

Graph Drawing for Security Visualization.
Proceedings of the Graph Drawing, 16th International Symposium, 2008

Authenticated hash tables.
Proceedings of the 2008 ACM Conference on Computer and Communications Security, 2008

Algorithms for Location Estimation Based on RSSI Sampling.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2008

2007
On the Cost of Persistence and Authentication in Skip Lists.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures.
Proceedings of the Information and Communications Security, 9th International Conference, 2007

2006
Parameterized <i>st</i> -Orientations of Graphs: Algorithms and Experiments.
Proceedings of the Graph Drawing, 14th International Symposium, 2006

2005
Applications of Parameterized <i>st</i>-Orientations in Graph Drawing Algorithms.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

2004
Computational experience with exterior point algorithms for the transportation problem.
Appl. Math. Comput., 2004

3D Visualization of Semantic Metadata Models and Ontologies.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

2003
A visualization of the primal simplex algorithm for the assignment problem.
Proceedings of the 8th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2003


  Loading...