Add new attachment

Only authorized users are allowed to upload new attachments.

This page (revision-43) was last changed on 14-Oct-2014 14:50 by cortier

This page was created on 17-Sep-2012 10:24 by mery

Only authorized users are allowed to rename pages.

Only authorized users are allowed to delete pages.

Difference between version and

At line 6 changed 2 lines
!Tuesday, October 22, Room A008
''Chair: Michael Rusinowitch''
!Tuesday, October 14, Room B013
''Chair: Emmanuel Jeandel''
At line 9 changed one line
__9h30-10h__
__14h00-14h35__
At line 11 changed one line
Jean-Christophe Bach (Pareo) - __Langage et outil pour la transformation de modèles__
Hubert Godfroy (Carte) - __Self Modifying Machines__
We describe a new framework for self-modifying programs. Our goal is to
show how to extract program abstraction focusing on self-modifications.
On the first hand, we use a abstract machine which makes explicit some
typical behavior, such as turning data into executable code and vice
versa. Moreover memory is also separated between data (what we can read
and write) and code (what we can execute). On the other hand, we add
another level of granularity in memory location, in order to build a
more static program abstraction.
At line 14 changed one line
__10h-10h30__
__14h40-15h15__
At line 16 changed one line
Houari Mahfoud (Cassis) - __Secure and Valid Manipulation of XML Data__
Hiep Nguyen Huu (Cassis) - __Anonymizing Social Graphs via Uncertainty Semantics__
At line 18 changed 19 lines
It is increasingly common to find XML views used to enforce
access control as found in many applications and commercial
database systems. To overcome the overhead of view materialization
and maintenance, XML views are necessarily virtual. With this comes
the need for answering XML queries posed over virtual views, by rewriting
them into equivalent queries on the underlying documents.
A major concern here is that query rewriting for recursive XML views is
still an open problem, and proposed approaches deal only with non-recursive XML views.
Moreover, a small number of works have studied the access rights for updates.
In this talk, we present SVMAX (Secure and Valid MAnipulation of XML),
the first system that supports specification and enforcement of both read and update
access policies over arbitrary XML views (recursive or non). SVMAX defines general
and expressive models for controlling access to XML data using significant class of
XPath queries and in the presence of the update primitives of W3C XQuery Update Facility.
Furthermore, SVMAX features an additional module enabling efficient validation of XML
documents after primitive updates of XQuery. The wide use of W3C standards makes of
SVMAX a useful system that can be easily integrated within commercial database systems
as we will show. We give extensive experimental results, based on real-life DTDs, that show
the efficiency and scalability of our system.
Rather than anonymizing social graphs by generalizing them to super
nodes/edges or adding/removing nodes and edges to satisfy given privacy
parameters, recent methods exploit the semantics of uncertain graphs to
achieve privacy protection of participating entities and their
relationship. These techniques anonymize a deterministic graph by
converting it into an uncertain form. In this paper, we propose a
generalized obfuscation model based on uncertain adjacency matrices
that keep expected node degrees equal to those in the unanonymized
graph. We analyze two recently proposed schemes and show their fitting
into the model. We also point out disadvantages in each method and
present several elegant techniques to fill the gap between them.
Finally, to support fair comparisons, we develop a new tradeoff
quantifying framework by leveraging the concept of incorrectness in
location privacy research. Experiments on large social graphs
demonstrate the effectiveness of our schemes.
At line 39 changed 3 lines
__10h30-11h Pause café__
__11h-11h30__
__15h20-15h55__
At line 43 changed one line
Hugo Férée (Carte) - __Analyse récursive et complexité__
Éric Le-Morvan (Cassis) - __Composition sûre de protocoles cryptographiques__
At line 45 changed one line
En analyse récursive, les objets mathématiques (typiquement les nombres ou les fonctions réels) sont représentés par des objets symboliques (les entiers ou les suites d'entiers), ce qui permet d'exporter les notions de calculabilité et de complexité du discret au continu. Nous verrons dans cet exposé des exemples de l'influence de la complexité sur les propriétés analytiques des objets représentés.
La vérification de protocoles cryptographiques est essentielle à la
sécurisation des communications effectuées sur un réseau public. En
effet si la cryptographie est la brique de base utilisée pour
empêcher un attaquant de lire des messages qui ne lui sont pas
destinés, il est nécessaire de s'assurer que la cryptographie est
bien utilisée. Cependant il est difficile algorithmiquement de
garantir l'absence de faille logique dans un protocole. La tâche
s'avère de plus impraticable lorsque l'on cherche à vérifier
ensemble plusieurs protocoles à plus forte raison s'ils partagent
des données, or ce cas est très fréquent (différentes versions d'un
protocole, protocole utilisé comme sous routine d'un autre
protocole). Le but de mes travaux est d'établir un critère
syntaxique simple à vérifier dès le stade de la conception et qui
garantisse que l'on peut étudier des protocoles séparément sans
risquer d'interférences lorsqu'on les utilisera conjointement.
Le critère étudié est principalement l'adjonction de tags dans
chaque fonction cryptographique qui indique le protocole utilisé.
Sous cette hypothèse et d'autres relevant des bonnes pratiques de
conception on montre l'absence d'interférence vis-à-vis de la
préservation du secret.
At line 48 changed 3 lines
__11h30-12h__
%%(border: 1px solid #aaa; margin:1em 2.5%; padding:0.5em; background:#f9f9f9)
Hernán Vanzetto (Veridis/Mosel) - __Type Reconstruction for Set Theory__
__15h-16h Goûter__
At line 52 removed one line
/%
Version Date Modified Size Author Changes ... Change note
43 14-Oct-2014 14:50 18.288 kB cortier to previous
42 14-Oct-2014 14:45 17.414 kB cortier to previous | to last
41 14-Oct-2014 14:44 17.411 kB cortier to previous | to last
« This page (revision-43) was last changed on 14-oct.-2014 14:50 by cortier