taken from http://www.coclouds.com/wp-content/uploads/2011/05/variety-clouds-panoramic2-2011-05-21.jpg
Research

An increasing number of businesses and individuals are adopting cloud computing as their main computing infrastructure. In fact, remote data storage (e.g., Amazon S3) and outsourcing of computation (e.g., Google docs) have become a major everyday phenomenon.

Although cloud computing provides great services to costumers, it does trigger many security concerns: Users' data is now stored at untrusted, geographically dispersed, servers and possibly untrusted applications might execute on it. Therefore users lose control of their data and programs, which could be modified or accessed by unauthorized entities. For example, sensitive information could be leaked or tampered with due to malicious or buggy cloud software, leading to undesirable situations.

My research aims at alleviating these concerns of the community, by providing integrity and privacy guarantees for cloud services, in an efficient way. Specifically it offers several types of cryptographic assurances, so that remote data and computations cannot be altered (without being detected) and data managed by cloud applications cannot leak.

Apart from research on cloud computing security, I enjoy working on cryptography, data structures and algorithm design. In the past, I spent some time working on graph algorithms and graph drawing.

Publications
    conferences
  1. Charalampos Papamanthou, Elaine Shi, Roberto Tamassia and Ke Yi. Streaming Authenticated Data Structures. In Proc. Int. Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), Athens, Greece, 2013.
  2. Seny Kamara and Charalampos Papamanthou. Searching dynamic encrypted data in parallel. In Proc. Int. Financial Cryptography and Data Security Conference (FC), Okinawa, Japan, 2013.
  3. Charalampos Papamanthou, Elaine Shi and Roberto Tamassia. Signatures of correct computation. In Proc. Int. Theory of Cryptography Conference (TCC), Tokyo, Japan, 2013.
  4. Prateek Mittal, Charalampos Papamanthou and Dawn Song. Preserving link privacy in social network based systems. In Proc. Int. Network and Distributed System Security Symposium (NDSS), San Diego CA, USA, 2013.
  5. Seny Kamara, Charalampos Papamanthou and Tom Roeder. Dynamic searchable symmetric encryption. In Proc. Int. ACM Conference on Computer and Communications Security (CCS), pages 965-976, Raleigh NC, USA, 2012.
  6. Michael T. Goodrich, Duy Nguyen, Olga Ohrimenko, Charalampos Papamanthou, Roberto Tamassia, Nikos Triandopoulos, and Cristina Videira Lopes. Efficient verification of web-content searching through authenticated web crawlers. In Proc. Int. Conference on Very Large Data Bases (VLDB), PVLDB 5(10), pages 920-931, Istanbul, Turkey, 2012.
  7. Charalampos Papamanthou, Roberto Tamassia, and Nikos Triandopoulos. Optimal verification of operations on dynamic sets. In Proc. Int. Cryptology Conference (CRYPTO), volume 6841 of Lecture Notes in Computer Science (LNCS), pages 91-110, Santa Barbara CA, USA, 2011.
  8. Petros Maniatis, Michael Dietz, and Charalampos Papamanthou. MOMMIE knows best: Systematic optimizations for verifiable distributed algorithms. In Proc. Int. Workshop on Hot Topics in Operating Systems (HotOS), Napa CA, USA, 2011.
    		9.
  9. Charalampos Papamanthou, Roberto Tamassia, and Nikos Triandopoulos. Optimal authenticated data structures with multilinear forms. In Proc. Int. Conference on Pairing-Based Cryptography (PAIRING), volume 6487 of Lecture Notes in Computer Science (LNCS), pages 246-264, Ishikawa, Japan, 2010.
  10. C. Christopher Erway, Alptekin Küpçü, Charalampos Papamanthou, and Roberto Tamassia. Dynamic provable data possession. In Proc. Int. ACM Conference on Computer and Communications Security (CCS), pages 213-222, Chicago IL, USA, 2009.
  11. Charalampos Papamanthou, Roberto Tamassia, and Nikos Triandopoulos. Authenticated hash tables. In Proc. Int. ACM Conference on Computer and Communications Security (CCS), pages 437-448, Alexandria VA, USA, 2008.
  12. Alexander Heitzmann, Bernardo Palazzi, Charalampos Papamanthou, and Roberto Tamassia. Efficient integrity checking of untrusted network storage. In Proc. Int. ACM CCS Workshop on Storage Security and Survivability (STORAGESS), pages 43-54, Alexandria VA, USA, 2008.
  13. Alexander Heitzmann, Bernardo Palazzi, Charalampos Papamanthou, and Roberto Tamassia. Effective visualization of file system access-control. In Proc. Int. Workshop on Security Visualization (VIZSEC), volume 5210 of Lecture Notes in Computer Science (LNCS), pages 18-25, Boston MA, USA, 2008.
  14. Michael T. Goodrich, Charalampos Papamanthou, Roberto Tamassia, and Nikos Triandopoulos. Athos: Efficient authentication of outsourced file systems. In Proc. Int. Information Security Conference (ISC), volume 5222 of Lecture Notes in Computer Science (LNCS), pages 80-96, Taipei, Taiwan, 2008.
  15. Charalampos Papamanthou, Franco P. Preparata, and Roberto Tamassia. Algorithms for location estimation based on RSSI sampling. In Proc. Int. ICALP Workshop on Algorithms for Sensor Networks (ALGOSENSORS), volume 5389 of Lecture Notes in Computer Science (LNCS), pages 72-86, Reykjavik, Iceland, 2008.
  16. Roberto Tamassia, Bernardo Palazzi, and Charalampos Papamanthou. Graph drawing for security visualization. In Proc. Int. Conference on Graph Drawing (GD), volume 5417 of Lecture Notes in Computer Science (LNCS), pages 2-13, Heraklion, Greece, 2008.
  17. Charalampos Papamanthou and Roberto Tamassia. Time and space efficient algorithms for two-party authenticated data structures. In Proc. Int. Conference on Information and Communications Security (ICICS), volume 4861 of Lecture Notes in Computer Science (LNCS), pages 1-15, Zhengzhou, China, 2007.
  18. Michael T. Goodrich, Charalampos Papamanthou, and Roberto Tamassia. On the cost of persistence and authentication in skip lists. In Proc. Int. Workshop on Experimental Algorithms (WEA), volume 4525 of Lecture Notes in Computer Science (LNCS), pages 94-107, Rome, Italy, 2007.
  19. Charalampos Papamanthou and Ioannis G. Tollis. Parameterized st-orientations of graphs: Algorithms and experiments. In Proc. Int. Conference on Graph Drawing (GD), volume 4372 of Lecture Notes in Computer Science (LNCS), pages 220-233, Karlsrühe, Germany, 2006.
  20. Charalampos Papamanthou and Ioannis G. Tollis. Applications of parameterized st-orientations in graph drawing algorithms. In Proc. Int. Conference on Graph Drawing (GD), volume 3843 of Lecture Notes in Computer Science (LNCS), pages 355-367, Limerick, Ireland, 2005.
  21. Charalampos Papamanthou, Ioannis G. Tollis, and Martin Doerr. 3D visualization of semantic metadata models and ontologies. In Proc. Int. Conference on Graph Drawing (GD), volume 3383 of Lecture Notes in Computer Science (LNCS), pages 377-388, New York City NY, USA, 2004.
  22. Charalampos Papamanthou and Konstantinos Paparrizos. A visualization of the primal simplex algorithm for the assignment problem. In Proc. Int. ACM Conference on Innovation and Technology in Computer Science Education (ITICSE), page 267, Thessaloniki, Greece, 2003.
    23. journals
  23. Charalampos Papamanthou, Konstantinos Paparrizos, Nikolaos Samaras, and Angelo Sifaleras. On the initialization methods of an exterior point algorithm for the assignment problem. International Journal of Computer Mathematics, 87(8):1831-1846, 2010.
  24. Charalampos Papamanthou and Ioannis G. Tollis. Applications of parameterized st-orientations. Journal of Graph Algorithms and Applications, 14(2):337-365, 2010.
  25. Claire Mathieu and Charalampos Papamanthou. Distortion lower bounds for line embeddings. Information Processing Letters, 108(4):175-178, 2008.
  26. Charalampos Papamanthou and Ioannis G. Tollis. Algorithms for computing a parameterized st-orientation. Theoretical Computer Science, 408:224-240, 2008.
  27. Charalampos Papamanthou, Konstantinos Paparrizos, Nikolaos Samaras, and Konstantinos Stergiou. Worst case examples of an exterior point algorithm for the assignment problem. Discrete Optimization, 5(3):605-614, 2008.
  28. Charalampos Papamanthou, Konstantinos Paparrizos, and Nikolaos Samaras. A parametric visualization software for the assignment problem. Yugoslav Journal of Operations Research, 15(1):147-158, 2005.
  29. Charalampos Papamanthou, Konstantinos Paparrizos, and Nikolaos Samaras. Computational experience with exterior point algorithms for the transportation problem. Journal of Applied Mathematics and Computation, 158:459-475, 2004.
    30. other
  30. Charalampos Papamanthou. Cryptography for Efficiency: New Directions in Authenticated Data Structures. PhD thesis, Brown University, Providence RI, USA, May 2011.
  31. Charalampos Papamanthou. Computing Longest Path Parameterized st-Orientations of Graphs: Algorithms and Applications. Master's thesis, University of Crete, Heraklion, Greece, July 2005.
  32. Charalampos Papamanthou. Effective Programming, Computational Study and Internet Visualization of Network Programming Problems Algorithms. Bachelor's thesis, University of Macedonia, Thessaloniki, Greece, September 2003.