Personne

Rafik Chaabouni

Cette personne n’est plus à l’EPFL

Publications associées (13)

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

Enhancing Privacy Protection

Rafik Chaabouni

Privacy has recently gained an importance beyond the field of cryptography. In that regard, the main goal behind this thesis is to enhance privacy protection. All of the necessary mathematical and cryptographic preliminaries are introduced at the start of ...

EPFL2017

Solving Terminal Revocation in EAC by Augmenting Terminal Authentication

Rafik Chaabouni

In this paper we propose a solution to enable an accurate terminal revocation in the Extended Access Control (EAC). Chaabouni and Vaudenay in [CV09] pointed out the need for an accurate revocation procedure, but failed to provide a complete solution descri ...

Gesellschaft für Informatik2013

A Non-interactive Range Proof with Constant Communication

Rafik Chaabouni, Helger Lipmaa

In a range proof, the prover convinces the verifier in zero-knowledge that he has encrypted or committed to a value a ∈ [0,H] where H is a public constant. Most of the previous non-interactive range proofs have been proven secure in the random oracle model ...

Springer Berlin Heidelberg2012

Establishing Trusted Identities

Rafik Chaabouni

Many online transactions require the sharing of identity information, even though this sharing poses substantial trust challenges, both for the sender and the receiver. For this reason, Internet must provide channels to ensure a secure, reliable, private, ...

2012

Short introduction on eID. ...

2012

A method and apparatus for proving and a method and apparatus for verifying that a secret value is a member of a predetermined set of values. The proving mechanism receives a set of signatures which has respective values in the predetermined set signed usi ...

2011

Additive Combinatorics and Discrete Logarithm Based Range Protocols

Rafik Chaabouni, Helger Lipmaa

We show how to express an arbitrary integer interval

I = [0, H]

as a sumset

I = \sum_{i=1}^\ell G_i * [0, u - 1] + [0, H']

of smaller integer intervals for some small values

\ell

u

, and

H' < u - 1

, where

b * A = \{b a : a \in A\}

and $A + B = ...

Springer2010

The Extended Access Control for Machine Readable Travel Documents

Rafik Chaabouni

Machine Readable travel documents have been rapidly put in place since 2004. The initial standard was made by the ICAO and it has been quickly followed by the Extended Access Control (EAC). In this presentation, we discuss about the evolution of these stan ...

2010

Methods for efficient certificate revocation list compression

Serge Vaudenay, Imad Aad, Valtteri Niemi, Rafik Chaabouni, Atefeh Mashatan

A method for providing efficient management of certificate revocation may comprise storing a list of identifiers of digital certificates including a revocation list defining a list of revoked certificates in an accumulator, storing a witness value in assoc ...

2010

The Extended Access Control for Machine Readable Travel Documents

Serge Vaudenay, Rafik Chaabouni

Machine Readable travel documents have been rapidly put in place since 2004. The initial standard was made by the ICAO and it has been quickly followed by the Extended Access Control (EAC). In this paper we discuss about the evolution of these standards an ...

Gesellschaft für Informatik (GI)2009

Additive Combinatorics and Discrete Logarithm Based Range Protocols

Rafik Chaabouni, Helger Lipmaa

We show how to express an arbitrary integer interval

I = [0, H]

as a sumset

I = \sum_{i=1}^\ell G_i * [0, u - 1] + [0, H']

of smaller integer intervals for some small values

\ell

u

, and

H' < u - 1

, where

b * A = \{b a : a \in A\}

and $A + B = ...

Springer2010