Publication

Integrity and Metadata Protection in Data Retrieval

Publications associées (61)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

On Secure Cloud Computing for Genomic Data: From Storage to Analysis

Zhicong Huang

Although privacy is generally considered to be the right of an individual or group to control information about themselves, such a right has become challenging to protect in the digital era, this is exemplified by the case of cloud-based genomic computing. ...

EPFL2018

ClaimChain: Improving the Security and Privacy of In-band Key Distribution for Messaging

Carmela González Troncoso, Bogdan Kulynych, Wouter Lueks

The social demand for email end-to-end encryption is barely supported by mainstream service providers. Autocrypt is a new community -driven open specification for e-mail encryption that attempts to respond to this demand. In Autocrypt the encryption keys a ...

ACM2018

Formal Analysis of Distance Bounding with Secure Hardware

Serge Vaudenay, Handan Kilinç Alper

A distance bounding (DB) protocol is a two-party authentication protocol between a prover and a verifier which is based on the distance between the prover and the verifier. It aims to defeat threats by malicious provers who try to convince that they are cl ...

2018

, , , ,

A method of sharing private and/or sensitive data from plurality of data providers to a data user, the data user having a private key and a public key, the method comprising the steps of providing a first data set and encrypting the first data set at a ter ...

2018

Consensual and Privacy-Preserving Sharing of Multi-Subject and Interdependent Data

Jean-Pierre Hubaux, Kévin Clément Huguenin, Italo Ivan Dacosta Petrocelli, Alexandra-Mihaela Olteanu

Individuals share increasing amounts of personal data online. This data often involves–or at least has privacy implications for–data subjects other than the individual who shares it (e.g., photos, genomic data) and the data is shared without their consent. ...

2018

Oblivious Dynamic Searchable Encryption on Distributed Cloud Systems

Fatma Betül Durak

Dynamic Searchable Symmetric Encryption (DSSE) allows search/update operations over encrypted data via an encrypted index. However, DSSE has been shown to be vulnerable to statistical inference attacks, which can extract a significant amount of information ...

SPRINGER INTERNATIONAL PUBLISHING AG2018

, , , , , , ,

Current solutions for privacy-preserving data sharing among multiple parties either depend on a centralized authority that must be trusted and provides only weakest-link security (e.g., the entity that manages private/secret cryptographic keys), or leverag ...

2017

Linking Online Misuse-Resistant Authenticated Encryption and Blockwise Attack Models

Damian Vizár

Real-world applications of authenticated encryption often require the encryption to be computable online, e.g. to compute the ith block of ciphertext after having processed the first i blocks of plaintext. A significant line of research was dedicated to id ...

2017

Clever Arbiters Versus Malicious Adversaries

Serge Vaudenay

When moving from known-input security to chosen-input security, some generic attacks sometimes become possible and must be discarded by a specific set of rules in the threat model. Similarly, common practices consist of fixing security systems, once an exp ...

Springer Berlin Heidelberg2016

Authenticated Encryption with Variable Stretch

Serge Vaudenay, Damian Vizár, Reza Reyhanitabar

In conventional authenticated-encryption (AE) schemes, the ciphertext expansion, a.k.a.stretch or tag length, is a constant or a parameter of the scheme that must be fixed per key. However, using variable-length tags per key can be desirable in practice or ...

Springer-Verlag Berlin2016