Iraklis Leontiadis

dblp:138/9027 · DBLP profile ↗
← Back
10ranked-venue papers
6as first author
4since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 9 · 5 first-author · 4 since 2021Computer networks · 1 · 1 first-author
YearPublicationVenuePosition
2023 Private Message Franking with After Opening Privacy
Iraklis Leontiadis, Serge Vaudenay
ICICS1
2023 FastReach: A system for privacy-preserving reachability queries over location data
Hanyu Quan, Boyang Wang 0001, Ming Li 0003, Iraklis Leontiadis
Comput. Secur.4
2023 Manticore: A Framework for Efficient Multiparty Computation Supporting Real Number and Boolean Arithmetic
Mariya Georgieva, Sergiu Carpov, Kevin Deforth, Dimitar Jetchev, Abson Sae-Tang, Marius Vuille, Nicolas Gama, Jonathan Katz, Iraklis Leontiadis
J. Cryptol.9
2021 A Message Franking Channel
Loïs Huguenin-Dumittan, Iraklis Leontiadis
Inscrypt2
2019 Auditable Compressed Storage
Iraklis Leontiadis, Reza Curtmola
ISC1
2018 Secure Storage with Replication and Transparent Deduplication
abstract
We seek to answer the following question: To what extent can we deduplicate replicated storage? To answer this question, we design ReDup, a secure storage system that provides users with strong integrity, reliability, and transparency guarantees about data that is outsourced at cloud storage providers. Users store multiple replicas of their data at different storage servers, and the data at each storage server is deduplicated across users. Remote data integrity mechanisms are used to check the integrity of replicas. We consider a strong adversarial model, in which collusions are allowed between storage servers and also between storage servers and dishonest users of the system. A cloud storage provider (CSP) could store less replicas than agreed upon by contract, unbeknownst to honest users. ReDup defends against such adversaries by making replica generation to be time consuming so that a dishonest CSP cannot generate replicas on the fly when challenged by the users.
Iraklis Leontiadis, Reza Curtmola
CODASPY1
2016 SecReach: Secure Reachability Computation on Encrypted Location Check-in Data
Hanyu Quan, Boyang Wang 0001, Iraklis Leontiadis, Ming Li 0003, Yuqing Zhang 0001
CANS3
2015 PUDA - Privacy and Unforgeability for Data Aggregation
Iraklis Leontiadis, Kaoutar Elkhiyaoui, Melek Önen, Refik Molva
CANS1
2014 Private and Dynamic Time-Series Data Aggregation with Trust Relaxation
Iraklis Leontiadis, Kaoutar Elkhiyaoui, Refik Molva
CANS1
2014 A P2P based usage control enforcement scheme resilient to re-injection attacks
abstract
Existing privacy controls based on access control techniques do not prevent massive dissemination of private data by unauthorized users. We suggest a usage control enforcement scheme that allows users to gain control over their data during its entire lifetime. The scheme is based on a peer-to-peer architecture whereby a different set of peers is randomly selected for data assignment. Usage control is achieved based on the assumption that at least t out of any set of n peers will not behave maliciously. Such a system would still suffer from re-injection attacks whereby attackers can gain ownership of data and the usage policy thereof by simply re-storing data after slight modification of the content. In order to cope with re-injection attacks the scheme relies on a similarity detection mechanism. The robustness of the scheme has been evaluated in an experimental setting using a variety of re-injection attacks.
Iraklis Leontiadis, Refik Molva, Melek Önen
WoWMoM1