Evgenios M. Kornaropoulos

Orcid: 0000-0002-9982-6536

According to our database1, Evgenios M. Kornaropoulos authored at least 22 papers between 2011 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Algorithmic Complexity Attacks on Dynamic Learned Indexes.
Proc. VLDB Endow., December, 2023

Breach Extraction Attacks: Exposing and Addressing the Leakage in Second Generation Compromised Credential Checking Services.
IACR Cryptol. ePrint Arch., 2023

2022
The Price of Tailoring the Index to Your Data: Poisoning Attacks on Learned Index Structures.
Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

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

2021
Response-Hiding Encrypted Ranges: Revisiting Security via Parametrized Leakage-Abuse Attacks.
IACR Cryptol. ePrint Arch., 2021

Adversarial Examples for k-Nearest Neighbor Classifiers Based on Higher-Order Voronoi Diagrams.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
BeeTrace: A Unified Platform for Secure Contact Tracing that Breaks Data Silos.
IEEE Data Eng. Bull., 2020

2019
Information Leakage in Encrypted Systems Through an Algorithmic Lens.
PhD thesis, 2019

The State of the Uniform: Attacks on Encrypted Databases Beyond the Uniform Query Distribution.
IACR Cryptol. ePrint Arch., 2019

The Case of Adversarial Inputs for Secure Similarity Approximation Protocols.
Proceedings of the IEEE European Symposium on Security and Privacy, 2019

2018
Data Recovery on Encrypted Databases With k-Nearest Neighbor Query Leakage.
IACR Cryptol. ePrint Arch., 2018

A Visualization Framework and User Studies for Overloaded Orthogonal Drawings.
Comput. Graph. Forum, 2018

2017
Breaking and Fixing Secure Similarity Approximations: Dealing with Adversarially Perturbed Inputs.
IACR Cryptol. ePrint Arch., 2017

2016
Algorithms for Overloaded Orthogonal Drawings.
J. Graph Algorithms Appl., 2016

Auditable Data Structures.
IACR Cryptol. ePrint Arch., 2016

More Practical and Secure History-Independent Hash Tables.
IACR Cryptol. ePrint Arch., 2016

Fast approximation of betweenness centrality through sampling.
Data Min. Knowl. Discov., 2016

2015
Optimizing Static and Adaptive Probing Schedules for Rapid Event Detection.
Proceedings of the Combinatorial Optimization and Applications, 2015

2012
Weak Dominance Drawings for Directed Acyclic Graphs.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

DAGView: An Approach for Visualizing Large Graphs.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011
Weak Dominance Drawings and Linear Extension Diameter
CoRR, 2011

Overloaded Orthogonal Drawings.
Proceedings of the Graph Drawing - 19th International Symposium, 2011


  Loading...