activity
20172023
most citedA Least Squares Approach to the Static Traffic Analysis of High-Latency Anonymous Communication Systems

15 citations · 31 across the 7 of their papers we have counts for

collaborators
Showing cs.CRShow all

11 papers · 1 filter

cs.CR2023

PEPSI: Practically Efficient Private Set Intersection in the Unbalanced Setting

Rasoul Akhavan Mahdavi, Nils Lukas, Faezeh Ebrahimianghazani +7

Two parties with private data sets can find shared elements using a Private Set Intersection (PSI) protocol without revealing any information beyond the intersection. Circuit PSI p…

cs.CR2023

Fast and Private Inference of Deep Neural Networks by Co-designing Activation Functions

Abdulrahman Diaa, Lucas Fenaux, Thomas Humphries +9

Machine Learning as a Service (MLaaS) is an increasingly popular design where a company with abundant computing resources trains a deep neural network and offers query access for t…

cs.CR20214 cited

Generalization Techniques Empirically Outperform Differential Privacy against Membership Inference

Jiaxiang Liu, Simon Oya, Florian Kerschbaum

Differentially private training algorithms provide protection against one of the most popular attacks in machine learning: the membership inference attack. However, these privacy a…

cs.CR20212 cited

Obfuscated Access and Search Patterns in Searchable Encryption

Zhiwei Shang, Simon Oya, Andreas Peter +1

Searchable Symmetric Encryption (SSE) allows a data owner to securely outsource its encrypted data to a cloud server while maintaining the ability to search over it and retrieve ma…

cs.CR2020

Hiding the Access Pattern is Not Enough: Exploiting Search Pattern Leakage in Searchable Encryption

Simon Oya, Florian Kerschbaum

Recent Searchable Symmetric Encryption (SSE) schemes enable secure searching over an encrypted database stored in a server while limiting the information leaked to the server. Thes…

cs.CR2019

Filter Design for Delay-Based Anonymous Communications

Simon Oya, Fernando Pérez-González, Carmela Troncoso

In this work, we address the problem of designing delay-based anonymous communication systems. We consider a timed mix where an eavesdropper wants to learn the communication patter…