Ioannis Demertzis

Orcid: 0009-0000-4710-7823

According to our database1, Ioannis Demertzis authored at least 13 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Distributed & Scalable Oblivious Sorting and Shuffling.
IACR Cryptol. ePrint Arch., 2024

I/O-Efficient Dynamic Searchable Encryption meets Forward & Backward Privacy.
Proceedings of the 33rd USENIX Security Symposium, 2024

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

2022
Dynamic Searchable Encryption with Optimal Search in the Presence of Deletions.
IACR Cryptol. ePrint Arch., 2022

2021
Snoopy: Surpassing the Scalability Bottleneck of Oblivious Storage.
IACR Cryptol. ePrint Arch., 2021

2020
Improving Efficiency, Expressiveness and Security of Searchable Encryption.
PhD thesis, 2020

2019
SEAL: Attack Mitigation for Encrypted Databases via Adjustable Leakage.
IACR Cryptol. ePrint Arch., 2019

Dynamic Searchable Encryption with Small Client Storage.
IACR Cryptol. ePrint Arch., 2019

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

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

2017
Searchable Encryption with Optimal Locality: Achieving Sublogarithmic Read Efficiency.
IACR Cryptol. ePrint Arch., 2017

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

2016
Practical Private Range Search Revisited.
Proceedings of the 2016 International Conference on Management of Data, 2016


  Loading...