Charalampos Papamanthou
Artificial Intelligence · 2009–2019
A researcher in the Science corpus: 10 papers; trusts 64 researchers and is trusted by 33 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 126 citations into it; #5,090 of 35,345 by trust here, #4,682 by citations
- Computational Theory and Mathematics — 43 citations into it; #3,881 of 12,182 by trust here, #4,199 by citations
- Information Systems — 42 citations into it; #1,401 of 8,771 by trust here, #510 by citations
- Computer Networks and Communications — 26 citations into it; #7,864 of 9,886 by trust here, #9,214 by citations
- Privacy & Security — 24 citations into it; #628 of 709 by trust here, #681 by citations
- Computer Vision and Pattern Recognition — 23 citations into it; #7,397 of 21,575 by trust here, #13,815 by citations
- Program Analysis & Verification — 11 citations into it
- Algorithms & Complexity — 7 citations into it
Whom Charalampos Papamanthou trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Rafail M. Ostrovsky
- Oded Goldreich
- Seny Kamara
- Dan Boneh
- Eu-Jin Goh
- Melissa Chase
- Craig Gentry
- Yan-Cheng Chang
- Eli Ben-Sasson
- Silvio Micali
Who trusts Charalampos Papamanthou overall
- Raphael Bost
- Zhihua Xia
- Muhammad Naveed
- Lei Yang
- Jiale Zhang
- Seny Kamara
- David Cash
- Brice Minaud
- Emil Stefanov
- Florian Tramèr
Papers from Charalampos Papamanthou's perspective
Ordered by how strongly the researchers Charalampos Papamanthou trusts endorse each paper. Same corpus, a different order for every researcher.
- Software protection and simulation on oblivious RAMs
- Fully homomorphic encryption using ideal lattices
- Public Key Encryption with Keyword Search (International Conference on the Theory and Application of Cryptographic Techniques)
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems
- Practical techniques for searches on encrypted data (Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000)
- The Knowledge Complexity of Interactive Proof Systems
- Random oracles are practical: a paradigm for designing efficient protocols
- Conjunctive, Subset, and Range Queries on Encrypted Data (Theory of Cryptography Conference)
- Protocols for secure computations
- Secure Indexes (IACR Cryptology ePrint Archive)
Their papers
- Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation (2019) — 292 citations
- ALITHEIA: Towards Practical Verifiable Graph Processing (2014) — 31 citations
- Dynamic searchable symmetric encryption (2012) — 1,156 citations
- Preserving Link Privacy in Social Network Based Systems (2012) — 111 citations
- All Your Queries Are Belong to Us: The Power of File-Injection Attacks on Searchable Encryption (2016) — 526 citations
- Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts (2016) — 2,218 citations
- Practical Dynamic Searchable Encryption with Small Leakage (2014) — 653 citations
- TRUESET: Nearly Practical Verifiable Set Computations (2014) — 9 citations
- Parallel and Dynamic Searchable Symmetric Encryption (2013) — 547 citations
- Dynamic provable data possession (2009) — 1,434 citations