Charalampos “Babis” Papamanthou is an assistant professor of electrical and computer engineering and a member of the Maryland Cybersecurity Center.
Papamanthou’s research focuses on computer security, applied cryptography and the design and analysis of algorithms. His work emphasizes technologies, systems and theory providing secure computations in the cloud, while at the same time ensuring privacy, integrity and authenticity.
Papamanthou received his doctorate in computer science from Brown University in 2011. After earning his doctorate, Papamanthou was a postdoctoral researcher for two years at the University of California, Berkeley, before joining the University of Maryland.
2013. Streaming Authenticated Data Structures. Advances in Cryptology – EUROCRYPT 2013. :353-370.
2013. Practical Dynamic Proofs of Retrievability. CCS '13 Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security . :325-336.
2013. Signatures of Correct Computation. Theory of Cryptography. :222-242.
2013. Parallel and Dynamic Searchable Symmetric Encryption. Financial Cryptography and Data Security. :258-274.
2012. Dynamic Searchable Symmetric Encryption. CCS '12 Proceedings of the 2012 ACM Conference on Computer and Communications Security . :965-976.
2012. Verifying Search Results Over Web Collections. arXiv:1204.5446 [cs].
2012. Preserving Link Privacy in Social Network Based Systems. arXiv:1208.6189 [cs].
2012. Efficient Verification of Web-content Searching Through Authenticated Web Crawlers. Proc. VLDB Endow.. 5(10):920-931.
2011. Optimal Verification of Operations on Dynamic Sets. Advances in Cryptology – CRYPTO 2011. :91-110.
2011. MOMMIE Knows Best: Systematic Optimizations for Verifiable Distributed Algorithms. HotOS'13 Proceedings of the 13th USENIX Conference on Hot Topics in Operating Systems . :30-30.
2010. On the initialization methods of an exterior point algorithm for the assignment problem. International Journal of Computer Mathematics. 87(8):1831-1846.
2010. Optimal Authenticated Data Structures with Multilinear Forms. Pairing-Based Cryptography - Pairing 2010. :246-264.
2010. Applications of Parameterized st-Orientations. Journal of Graph Algorithms and Applications. 14(2):337-365.
2009. Dynamic Provable Data Possession. CCS '09 Proceedings of the 16th ACM Conference on Computer and Communications Security . :213-222.
2009. Graph Drawing for Security Visualization. Graph Drawing. :2-13.
2008. Authenticated Hash Tables. CCS '08 Proceedings of the 15th ACM Conference on Computer and Communications Security . :437-448.
2008. Distortion lower bounds for line embeddings. Information Processing Letters. 108(4):175-178.
2008. Worst case examples of an exterior point algorithm for the assignment problem. Discrete Optimization. 5(3):605-614.
2008. Efficient Integrity Checking of Untrusted Network Storage. StorageSS '08 Proceedings of the 4th ACM International Workshop on Storage Security and Survivability . :43-54.
2008. Algorithms for Location Estimation Based on RSSI Sampling. Algorithmic Aspects of Wireless Sensor Networks. :72-86.
2008. Athos: Efficient Authentication of Outsourced File Systems: Information Security. Lecture Notes in Computer Science. :80-96.
2008. Effective Visualization of File System Access-Control. Visualization for Computer Security. :18-25.
2008. Algorithms for computing a parameterized st-orientation. Theoretical Computer Science. 408(2–3):224-240.
2007. On the Cost of Persistence and Authentication in Skip Lists. Experimental Algorithms. :94-107.
2007. Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures. Information and Communications Security. :1-15.
2007. Parameterized st-Orientations of Graphs: Algorithms and Experiments. Graph Drawing. :220-233.
2006. Applications of Parameterized st-Orientations in Graph Drawing Algorithms. Graph Drawing. :355-367.
2005. A parametric visualization software for the assignment problem. Yugoslav Journal of Operations Research. 15(1):147-158.
2005. 3D Visualization of Semantic Metadata Models and Ontologies. Graph Drawing. :377-388.
2004. Computational experience with exterior point algorithms for the transportation problem. Applied Mathematics and Computation. 158(2):459-475.
2003. A Visualization of the Primal Simplex Algorithm for the Assignment Problem. ITiCSE '03 Proceedings of the 8th Annual Conference on Innovation and Technology in Computer Science Education . :267-267.