<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE raweb PUBLIC "-//INRIA//DTD " "raweb2.dtd">
<raweb xml:lang="en" year="2011">
  <identification id="smis" isproject="true">
    <shortname>SMIS</shortname>
    <projectName>Secured and Mobile Information Systems</projectName>
    <theme-de-recherche>Knowledge and Data Representation and Management</theme-de-recherche>
    <domaine-de-recherche>Perception, Cognition, Interaction</domaine-de-recherche>
    <structure_exterieure type="Labs">
      <libelle>Parallelisme, réseaux, systèmes, modélisation (PRISM)</libelle>
    </structure_exterieure>
    <structure_exterieure type="Organism">
      <libelle>CNRS</libelle>
    </structure_exterieure>
    <structure_exterieure type="Organism">
      <libelle>Université Versailles Saint-Quentin</libelle>
    </structure_exterieure>
    <UR name="Rocquencourt"/>
    <keywords>
      <term>Databases</term>
      <term>Privacy</term>
      <term>Ubiquitous Computing</term>
      <term>Distributed System</term>
      <term>Information Indexing And Retrieval</term>
    </keywords>
    <moreinfo/>
  </identification>
  <team id="uid1">
    <person key="smis-2006-idm390881517648">
      <firstname>Philippe</firstname>
      <lastname>Pucheral</lastname>
      <affiliation>UnivFr</affiliation>
      <categoryPro>Enseignant</categoryPro>
      <research-centre>Rocquencourt</research-centre>
      <moreinfo>Team leader, Professor - UVSQ</moreinfo>
      <hdr>oui</hdr>
    </person>
    <person key="smis-2006-idm390881513888">
      <firstname>Luc</firstname>
      <lastname>Bouganim</lastname>
      <affiliation>INRIA</affiliation>
      <categoryPro>Chercheur</categoryPro>
      <research-centre>Rocquencourt</research-centre>
      <moreinfo>Senior Researcher - INRIA</moreinfo>
      <hdr>oui</hdr>
    </person>
    <person key="smis-2006-idm390881510208">
      <firstname>Nicolas</firstname>
      <lastname>Anciaux</lastname>
      <affiliation>INRIA</affiliation>
      <categoryPro>Chercheur</categoryPro>
      <research-centre>Rocquencourt</research-centre>
      <moreinfo>Junior Researcher - INRIA</moreinfo>
    </person>
    <person key="smis-2010-idm523361807232">
      <firstname>Benjamin</firstname>
      <lastname>Nguyen</lastname>
      <affiliation>UnivFr</affiliation>
      <categoryPro>Enseignant</categoryPro>
      <research-centre>Rocquencourt</research-centre>
      <moreinfo>Associate Professor - UVSQ</moreinfo>
    </person>
    <person key="imedia-2006-idm544971854176">
      <firstname>Laurence</firstname>
      <lastname>Bourcier</lastname>
      <affiliation>INRIA</affiliation>
      <categoryPro>Assistant</categoryPro>
      <research-centre>Rocquencourt</research-centre>
    </person>
    <person key="smis-2006-idm390881482064">
      <firstname>Tristan</firstname>
      <lastname>Allard</lastname>
      <affiliation>UnivFr</affiliation>
      <categoryPro>PhD</categoryPro>
      <research-centre>Rocquencourt</research-centre>
      <moreinfo>UVSQ, MESR</moreinfo>
    </person>
    <person key="smis-2009-idm306842376240">
      <firstname>Yanli</firstname>
      <lastname>Guo</lastname>
      <affiliation>INRIA</affiliation>
      <categoryPro>PhD</categoryPro>
      <research-centre>Rocquencourt</research-centre>
      <moreinfo>UVSQ, CORDI INRIA</moreinfo>
    </person>
    <person key="smis-2009-idm306842382288">
      <firstname>Lionel</firstname>
      <lastname>Le Folgoc</lastname>
      <affiliation>INRIA</affiliation>
      <categoryPro>PhD</categoryPro>
      <research-centre>Rocquencourt</research-centre>
      <moreinfo>UVSQ, CORDI</moreinfo>
    </person>
    <person key="smis-2006-idm390881476752">
      <firstname>Shaoyi</firstname>
      <lastname>Yin</lastname>
      <affiliation>INRIA</affiliation>
      <categoryPro>PhD</categoryPro>
      <research-centre>Rocquencourt</research-centre>
      <moreinfo>UVSQ, CORDI</moreinfo>
    </person>
    <person key="smis-2010-idm523361777136">
      <firstname>Alexei</firstname>
      <lastname>Troussov</lastname>
      <affiliation>INRIA</affiliation>
      <categoryPro>Technique</categoryPro>
      <research-centre>Rocquencourt</research-centre>
      <moreinfo>Senior Software Engineer</moreinfo>
    </person>
  </team>
  <presentation id="uid2">
    <bodyTitle>Overall Objectives</bodyTitle>
    <subsection id="uid3" level="1">
      <bodyTitle>Introduction</bodyTitle>
      <p>The research work within the project-team is devoted to the design and analysis of core database techniques dedicated to the definition of secured and mobile information systems.</p>
      <p>Ubiquitous computing and ambient intelligence entail embedding data in increasingly light and specialized devices (chips, sensors and electronic appliances for smart buildings, telephony,
      transportation, health, etc.). These devices exhibit severe hardware constraints to match size, security, power consumption and also production costs requirements. At the same time, they could
      highly benefit from embedded database functionalities to store data, analyze it, query it and protect it. This raises a first question “
      <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>Q</mi><mn>1</mn></msub></math></formula>: 
      <i>How to make powerful data management techniques compatible with highly constrained hardware platforms?</i>”. To tackle this question, SMIS contributes to the design and validation of new
      storage and indexing models, query execution and optimization techniques, and transaction protocols. The relevance of this research goes beyond embedded databases and may have potential
      applications for database servers running on advanced hardware.</p>
      <p>By making information more accessible and by multiplying –often transparently– the means of acquiring it, ubiquitous computing involves new threats for data privacy. The second question
      addressed by the project-team is then “
      <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>Q</mi><mn>2</mn></msub></math></formula>: 
      <i>How to make smart objects less intrusive?</i>”. New access and usage control models have to be devised to help individuals keep a better control on the acquisition and sharing conditions of
      their data. This means integrating privacy principles like user’s consent, limited collection and limited retention in the access and usage control policy definition. This also means designing
      appropriate mechanisms to enforce this control and provide accountability with strong security guarantees.</p>
      <p>In parallel, thanks to a high degree of decentralization and to the emergence of low cost tamper-resistant hardware, ubiquitous computing contains the seeds for new ways of managing
      personal/sensitive data. The third question driving the research of the project-team is therefore “
      <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><msub><mi>Q</mi><mn>3</mn></msub></math></formula>: 
      <i>How to build privacy-by-design architectures based on trusted smart objects?</i>”. The objective is to capitalize on embedded data management techniques, privacy-preserving mechanisms,
      trusted devices and cryptographic protocols to define an integrated framework dedicated to the secure management of personal/sensitive data. The expectation is showing that credible
      alternatives to a systematic centralization of personal/sensitive data on servers can be devised and validating the approach through real case experiments.</p>
    </subsection>
    <subsection id="uid4" level="1">
      <bodyTitle>Highlights</bodyTitle>
      <best>
        <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid0" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>
      </best>
    </subsection>
  </presentation>
  <fondements id="uid5">
    <bodyTitle>Scientific Foundations</bodyTitle>
    <subsection id="uid6" level="1">
      <bodyTitle>Embedded Data Management</bodyTitle>
      <p>The challenge tackled is this research action is twofold: (1) to design embedded database techniques matching the hardware constraints of (current and future) smart objects and (2) to set up
      co-design rules helping hardware manufacturers to calibrate their future platforms to match the requirements of data driven applications. While a large body of work has been conducted on data
      management techniques for high-end servers (storage, indexation and query optimization models minimizing the I/O bottleneck, parallel DBMS, main memory DBMS, etc.), less research efforts have
      been placed on embedded database techniques. Light versions of popular DBMS have been designed for powerful handheld devices yet DBMS vendors have never addressed the complex problem of
      embedding database components into chips. Proposals dedicated to databases embedded on chip usually consider small databases, stored in the non-volatile memory of the microcontroller –hundreds
      of kilobytes– and rely on NOR Flash or EEPROM technologies. Conversely, SMIS is pioneering the combination of microcontrollers and NAND Flash constraints to manage Gigabyte(s) size embedded
      databases. We present below the positioning of SMIS with respect to international teams conducting research on topics which may be connected to the addressed problem, namely work on electronic
      stable storage, RAM consumption and specific hardware platforms.</p>
      <p>Major database teams are investigating data management issues related to hardware advances (EPFL: A. Ailamaki, CWI: M. Kersten, U. Of Wisconsin: J. M. Patel, Columbia: K. Ross, UCSB: A. El
      Abbadi, IBM Almaden: C. Mohan, etc.). While there are obvious links with our research on embedded databases, these teams target high-end computers and do not consider highly constrained
      architectures with non traditional hardware resources balance. At the other extreme, sensors (ultra-light computing devices) are considered by several research teams (e.g., UC Berkeley: D.
      Culler, ITU: P. Bonnet, Johns Hopkins University: A. Terzis, MIT: S. Madden, etc.). The focus is on the processing of continuous streams of collected data. Although the devices we consider
      share some hardware constraints with sensors, the objectives of both environments strongly diverge in terms of data cardinality and complexity, query complexity and data confidentiality
      requirements. Several teams are looking at efficient indexes on flash (HP LABS: G. Graefe, U. Minnesota: B. Debnath, U. Massachusetts: Y. Diao, Microsoft: S. Nath, etc.). Some studies try to
      minimize the RAM consumption, but the considered RAM/stable storage ratio is quite large compared to the constraints of the embedded context. Finally, a large number of teams have focused on
      the impact of flash memory on database system design (we presented an exhaustive state of the art in a VLDB tutorial 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid1" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>). The work conducted in the SMIS team on bi-modal flash devices takes
      the opposite direction, proposing to influence the design of flash devices by the expression of database requirements instead of running after the constantly evolving flash device
      technology.</p>
    </subsection>
    <subsection id="uid7" level="1">
      <bodyTitle>Access and Usage Control Models</bodyTitle>
      <p>Access control management has been deeply studied for decades. Different models have been proposed to declare and administer access control policies, like DAC, MAC, RBAC, TMAC, and OrBAC.
      While access control management is well established, new models are being defined to cope with privacy requirements. Privacy management distinguishes itself from traditional access control is
      the sense that the data to be protected is personal. Hence, the user's consent must be reflected in the access control policies, as well as the usage of the data, its collection rules and its
      retention period, which are principles safeguarded by law and must be controlled carefully.</p>
      <p>The research community working on privacy models is broad, and involves many teams worldwide including in France ENST-B, LIRIS, INRIA LICIT, and LRI, and at the international level IBM
      Almaden, Purdue Univ., Politecnico di Milano and Univ. of Milano, George Mason Univ., Univ. of Massachusetts, Univ. of Texas and Colorado State Univ. to cite a few. Pioneer attempts towards
      privacy wary systems include the P3P Platform for Privacy Preservation 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid2" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>and Hippocratic databases 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid3" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. In the last years, many other policy languages have been proposed for
      different application scenarios, including EPAL 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid4" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, XACML 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid5" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>and WSPL 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid6" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. Hippocratic databases are inspired by the axiom that databases should
      be responsible for the privacy preservation of the data they manage. The architecture of a Hippocratic database is based on ten guiding principles derived from privacy laws.</p>
      <p>The trend worldwide has been to propose enhanced access control policies to capture finer behaviour and bridge the gap with privacy policies. To cite a few, Ardagna 
      <i>et al.</i>(Univ. Milano) enables actions to be performed after data collection (like notification or removal), purpose binding features have been studied by Lefevre 
      <i>et al.</i>(IBM Almaden), and Ni 
      <i>et al.</i>(Purdue Univ.) have proposed obligations and have extended the widely used RBAC model to support privacy policies.</p>
      <p>The positioning of the SMIS team within this broad area is rather (1) to focus on intuitive or automatic tools helping the individual to control some facets of her privacy (e.g., data
      retention, minimal collection) instead of increasing the expressiveness but also the complexity of privacy models and (2) to push concrete models enriched by real-case (e.g., medical) scenarios
      and by a joint work with researchers in Law.</p>
    </subsection>
    <subsection id="uid8" level="1">
      <bodyTitle>Tamper-resistant Data Management</bodyTitle>
      <p>Tamper-resistance refers to the capacity of a system to defeat confidentiality and integrity attacks. This problem is complementary to access control management while being (mostly)
      orthogonal to the way access control policies are defined. Security surveys regularly point out the vulnerability of database servers against external (i.e., by intruders) and internal (i.e.,
      by employees) attacks. Several attempts have been made in commercial DBMSs to strengthen server-based security, e.g., by separating the duty between DBA and DSA (Data Security Administrator),
      by encrypting the database footprint and by securing the cryptographic material using Hardware Security Modules (HSM) 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid7" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. To face internal attacks, client-based security approaches have been
      investigated where the data is stored encrypted on the server and is decrypted only on the client side. Several contributions have been made in this direction, notably by U. of California
      Irvine (S. Mehrotra, Database Service Provider model), IBM Almaden (R. Agrawal, computation on encrypted data), U. of Milano (E. Damiani, encryption schemes), Purdue U. (E. Bertino, XML secure
      publication), U. of Washington (D. Suciu, provisional access) to cite a few seminal works. An alternative, recently promoted by Stony Brook Univ. (R. Sion), is to augment the security of the
      server by associating it with a tamper-resistant hardware module in charge of the security aspects. Contrary to traditional HSM, this module takes part in the query computation and performs all
      data decryption operations. SMIS investigates another direction based on the use of a tamper-resistant hardware module on the client side. Most of our contributions in this area are based on
      exploiting the tamper-resistance of secure tokens to build new data protection schemes.</p>
      <p>While our work on Privacy-Preserving data Publishing (PPDP) is still related to tamper-resistance, a complementary positioning is required for this specific topic. The primary goal of PPDP
      is to anonymize/sanitize microdata sets before publishing them to serve statistical analysis purposes. PPDP (and privacy in databases in general) is a hot topic since 2000, when it was
      introduced by IBM Research (R. Agrawal : IBM Almaden, C.C. Aggarwal: IBM Watson), and many teams, mostly north American universities or research centres, study this topic (e.g., PORTIA
      DB-Privacy project regrouping universities such as Stanford with H. Garcia-Molina). Much effort has been devoted by the scientific community to the definition of privacy models exhibiting
      better privacy guarantees or better utility or a balance of both (such as differential privacy studied by C. Dwork : Microsoft Research or D. Kifer : Penn-State Univ and J. Gehrke : Cornell
      Univ) and thorough surveys exist that provide a large overview of existing PPDP models and mechanisms 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid8" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. These works are however orthogonal to our approach in that they make
      the hypothesis of a trustworthy central server that can execute the anonymization process. In our work, this is not the case. We consider an architecture composed of a large population of
      tamper-resistant devices weakly connected to an untrusted infrastructure and study how to compute PPDP problems in this context. Hence, our work has some connections with the works done on
      Privacy Preserving Data Collection (R.N.Wright : Stevens Institute of Tech. / Rutgers Univ, NJ, V. Shmatikov : Univ Austin Texas), on Secure Multi-party Computing for Privacy Preserving Data
      Mining (J. Vaidya : Rutgers Univ, C. Clifton : Purdue Univ) and on distributed PPDP algorithms (D. DeWitt : Univ Wisconsin, K. Lefevre : Univ Michigan, J. Vaidya : Rutgers Univ, C. Clifton :
      Purdue Univ) while none of them share the same architectural hypothesis as us.</p>
    </subsection>
  </fondements>
  <domaine id="uid9">
    <bodyTitle>Application Domains</bodyTitle>
    <subsection id="uid10" level="1">
      <bodyTitle>Application Domains</bodyTitle>
      <p>Our work addresses varied application domains. Typically, data management techniques on chip are required each time data-driven applications have to be embedded in ultra-light computing
      devices. This situation occurs for example in healthcare applications where medical folders are embedded into smart tokens (e.g., smart cards, secured USB keys), in telephony applications where
      personal data (address book, agenda, etc.) is embedded into cellular phones, in sensor networks where sensors log row measurements and perform local computation on them, in smart-home
      applications where a collection of smart appliances gather information about the occupants to provide them a personalized service, and more generally in most applications related to ambient
      intelligence.</p>
      <p>Safeguarding data confidentiality has become a primary concern for citizens, administrations and companies, broadening the application domains of our work on access control policies
      definition and enforcement. The threat on data confidentiality is manifold: external and internal attacks on the data at rest, on the data on transit, on the data hosted in untrusted
      environments (e.g., Database Service Providers, Web-hosting companies) and subject to illegal usage, insidious gathering of personal data in an ambient intelligence surrounding. Hence, new
      access control models and security mechanisms are required to accurately declare and safely control who is granted access to which data and for which purpose.</p>
      <p>While the application domain mentioned above is rather large, one application is today more specifically targeted by the SMIS project. This application deals with privacy preservation in EHR
      (Electronic Health Record) systems. Several countries (including France) launched recently ambitious EHR programs where medical folders will be centralized and potentially hosted by private
      Database Service Providers. Centralization and hosting increase the risk of privacy violation. In 2007, we launched two projects (PlugDB and DMSP) tackling precisely this issue, with the final
      objective to experiment our technologies in the field. In 2011, we launched a new project (KISS) capitalizing on the previous ones and extending their scope towards the protection of any
      personal data delivered to individuals in an electronic form.</p>
    </subsection>
  </domaine>
  <logiciels id="uid11">
    <bodyTitle>Software</bodyTitle>
    <subsection id="uid12" level="1">
      <bodyTitle>Introduction</bodyTitle>
      <p>In our research domain, developing software prototypes is mandatory to validate research solutions and is an important vector for publications, demonstrations at conferences and exhibitions
      as well as for cooperations with industry. This prototyping task is however difficult because it requires specialized hardware platforms (e.g., new generations of smart tokens), themselves
      sometimes at an early stage of development.</p>
      <p>For a decade, we have developed successive prototypes addressing different application domains, introducing different technical challenges and relying on different hardware platforms.
      PicoDBMS was our first attempt to design a full-fledged DBMS embedded in a smart card 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid9" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid10" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. Chip-Secured Data Access (C-SDA) embedded a reduced SQL query engine
      and access right controller in a secure chip and acted as an incorruptible mediator between a client and an untrusted server hosting encrypted data 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid11" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. Chip-Secured XML Access (C-SXA) was an XML-based access rights
      controller embedded in a smart card 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid12" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. Prototypes of C-SXA have been the recipient of the e-gate open 2004
      Silver Award and SIMagine 2005 Gold award, two renowned international software contests. The next subsections details the two prototypes we are focusing on today.</p>
    </subsection>
    <subsection id="uid13" level="1">
      <bodyTitle>PlugDB engine</bodyTitle>
      <participants>
        <person key="smis-2006-idm390881510208">
          <firstname>Nicolas</firstname>
          <lastname>Anciaux</lastname>
        </person>
        <p>[correspondent], LucBouganim, 
        <person><firstname>Philippe</firstname><lastname>Pucheral</lastname></person>
        <person><firstname>Shaoyi</firstname><lastname>Yin</lastname></person>
        <person><firstname>Yanli</firstname><lastname>Guo</lastname></person>
        <person><firstname>Lionel</firstname><lastname>Le Folgoc</lastname></person>
        <person><firstname>Alexei</firstname><lastname>Troussov</lastname></person></p>
      </participants>
      <p>More than a stand-alone prototype, PlugDB is part of a complete architecture dedicated to a secure and ubiquitous management of personal data. PlugDB aims at providing an alternative to a
      systematic centralization of personal data. To meet this objective, the PlugDB architecture lies on a new kind of hardware device called Secure Portable Token (SPT). Roughly speaking, a SPT
      combines a secure microcontroller (similar to a smart card chip) with a large external Flash memory (Gigabyte sized). The SPT can host data on Flash (e.g., a personal folder) and safely run
      code embedded in the secure microcontroller. PlugDB engine is the cornerstone of this embedded code. PlugDB engine manages the database on Flash (tackling the peculiarities of NAND Flash
      storage), enforces the access control policy defined on this database, protects the data at rest against piracy and tampering, executes queries (tackling low RAM constraint) and ensures
      transaction atomicity. Part of the on-board data can be replicated on a server (then synchronized) and shared among a restricted circle of trusted parties through crypto-protected interactions.
      PlugDB engine has been registered at APP (Agence de Protection des Programmes) in 2009 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid13" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>and its Flash-based indexing system has been patented by INRIA and
      Gemalto 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid14" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. It has been demonstrated in a dozen of national and international
      events including JavaOne and SIGMOD. It is being experimented in the field to implement a secure and portable medical-social folder helping the coordination of medical care and social services
      provided at home to dependent people.</p>
      <p>Link: 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://www-smis.inria.fr/EcontratPlugDB.html" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://
      <allowbreak/>www-smis.
      <allowbreak/>inria.
      <allowbreak/>fr/
      <allowbreak/>Econtrat_PlugDB.
      <allowbreak/>html</ref>.</p>
    </subsection>
    <subsection id="uid14" level="1">
      <bodyTitle>uFLIP Benchmark</bodyTitle>
      <participants>
        <person key="smis-2006-idm390881513888">
          <firstname>Luc</firstname>
          <lastname>Bouganim</lastname>
        </person>
        <p>[correspondent], PhilippeBonnet, 
        <person><firstname>Bjorn</firstname><lastname>Jónsson</lastname></person>
        <person><firstname>Lionel</firstname><lastname>Le Folgoc</lastname></person></p>
      </participants>
      <p>It is amazingly easy to produce meaningless results when measuring flash devices, partly because of the peculiarity of flash memory, but primarily because their behavior is determined by
      layers of complex, proprietary, and undocumented software and hardware. uFLIP is a component benchmark for measuring the response time distribution of flash IO patterns, defined as the
      distribution of IOs in space and time. uFLIP includes a benchmarking methodology which takes into account the particular characteristics of flash devices. The source code of uFLIP, available on
      the web (700 downloads, 4000 distinct visitors), was registered at APP in 2009 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid15" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. It has been demonstrated at SIGMOD.</p>
      <p>Link: 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://www.uflip.org" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://
      <allowbreak/>www.
      <allowbreak/>uflip.
      <allowbreak/>org</ref>.</p>
    </subsection>
  </logiciels>
  <resultats id="uid15">
    <bodyTitle>New Results</bodyTitle>
    <subsection id="uid16" level="1">
      <bodyTitle>Embedded data management</bodyTitle>
      <participants>
        <person key="smis-2006-idm390881510208">
          <firstname>Nicolas</firstname>
          <lastname>Anciaux</lastname>
        </person>
        <person key="smis-2006-idm390881513888">
          <firstname>Luc</firstname>
          <lastname>Bouganim</lastname>
        </person>
        <person key="smis-2009-idm306842376240">
          <firstname>Yanli</firstname>
          <lastname>Guo</lastname>
        </person>
        <person key="smis-2009-idm306842382288">
          <firstname>Lionel</firstname>
          <lastname>Le Folgoc</lastname>
        </person>
        <person key="smis-2006-idm390881517648">
          <firstname>Philippe</firstname>
          <lastname>Pucheral</lastname>
        </person>
        <person key="smis-2006-idm390881476752">
          <firstname>Shaoyi</firstname>
          <lastname>Yin</lastname>
        </person>
      </participants>
      <p>Inspired by low cost economic models, this work draws the idea of a one-dollar database machine, with the objective to disseminate databases everywhere, up to the lightest smart objects. In
      contrast to traditional database machines relying on massively parallel architectures, the one-dollar database machine considers the cheapest form of computer available today: a microcontroller
      equipped with GBs size (external) Flash storage. Designing such a database machine is very challenging due to a combination of conflicting RAM and NAND Flash constraints. To tackle this
      challenge, this work proposes a new paradigm based on database serialization (managing all database structures in a pure sequential way) and stratification (restructuring them into strata when
      a scalability limit is reached). We show that a complete DBMS engine can be designed according to this paradigm and demonstrate the effectiveness of the approach through a performance
      evaluation.</p>
      <p>This work capitalizes on previous results related to the indexing of Flash resident data 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid16" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>and has also obvious connections with the more general study we are
      conducting on Flash-based data management (see Section 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#uid17" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>). Partial elements of this solution have been demonstrated at 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid17" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
    </subsection>
    <subsection id="uid17" level="1">
      <bodyTitle>Flash-based Data Management</bodyTitle>
      <participants>
        <person key="smis-2006-idm390881513888">
          <firstname>Luc</firstname>
          <lastname>Bouganim</lastname>
        </person>
        <p>PhilippeBonnet</p>
      </participants>
      <p><b>Bimodal flash devices.</b>While disks have offered a stable behavior for decades, thus guaranteeing the timelessness of many database design decisions, flash devices keep on mutating. Many
      researchers have proposed to adapt database algorithms to existing flash devices. However, today, there is no reference DBMS design based on solid assumptions of flash devices behavior,
      precisely because flash device behavior varies across models, across firmware updates and possibly over time for the same model: database researchers are running after flash memory technology.
      In this study, we took the reverse approach and defined how flash devices should support database management. We advocated that flash devices should provide guarantees to a DBMS so that it can
      devise stable and efficient IO management mechanisms. Based on the characteristics of flash chips, we defined a bimodal FTL that distinguishes between a minimal mode where sequential writes,
      sequential reads and random reads are optimal while updates and random writes are forbidden, and a mode where updates and random writes are supported at the cost of sub-optimal IO performance.
      This work started at the end of 2010 and was published at CIDR'11 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid18" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, in cooperation with the IT University of Copenhagen. DBMS/Flash
      device co-design considerations were the focus of a tutorial on flash devices given recently at VLDB 2011 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid1" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
    </subsection>
    <subsection id="uid18" level="1">
      <bodyTitle>Privacy-Preserving Data Publishing</bodyTitle>
      <participants>
        <person key="smis-2006-idm390881482064">
          <firstname>Tristan</firstname>
          <lastname>Allard</lastname>
        </person>
        <person key="smis-2010-idm523361807232">
          <firstname>Benjamin</firstname>
          <lastname>Nguyen</lastname>
        </person>
        <person key="smis-2006-idm390881517648">
          <firstname>Philippe</firstname>
          <lastname>Pucheral</lastname>
        </person>
      </participants>
      <p>While most PPDP works make the assumption of a trusted central publisher, this study advocates a decentralized way of publishing anonymized datasets. More precisely, our work concerns the
      proof of feasibility of adapting traditional PPDP schemes, such as 
      <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>k</mi></math></formula>-anonymity, 
      <formula type="inline"><math xmlns="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mi>ℓ</mi></math></formula>-diversity or differential privacy to encompass the use of secure portable devices. In the applications we consider, each secure device is a data provider with weak computing
      capacities and weak connectivity (frequency and duration of connections are unpredictable)
      <footnote id="uid19" id-text="1">E.g., in the e-health context, patients may have their medical folder embedded in a secure device and connect it sporadically when they visit their physician or
      when they want to consult it at home.</footnote>. Weak connectivity precludes any P2P solution to the problem. A server allowing asynchronous communications between the devices becomes
      necessary to implement a distributed PPDP mechanism but this server does not benefit from the same trustworthiness as the participating devices. Our work aims to provide a generic method to
      adapt an important subclass of PPDP algorithms to this context, using both the limited secure computation capacities of each device (but taking advantage of their number) and the powerful
      computation abilities of an untrusted server available 24/7. Our proposal is based on a meta algorithm divided in three phases: (1) a collection phase where encrypted data is collected by the
      untrusted server, (2) a construction phase where the untrusted server performs a sound computation of a given privacy mechanism to generate sanitization rules and (3) a sanitization phase where
      the encrypted data is decrypted then sanitized by the devices to produce a final clear-text result. The last phase can be distributed using many different devices for better efficiency. In 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid0" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid19" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, we showed how it is possible to transform existing anonymity
      mechanisms into decentralized ones using secure devices, while maintaining equivalent security guarantees against honest-but-curious and weakly malicious adversaries. In 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid20" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, we studied the (unlikely) event that some secure devices might be
      compromised, and can collude with the untrusted server. We provided schemes to detect the compromised devices with a probability that can be fixed as close to 1 as desired (the trade-off being
      the latency of the protocol).</p>
    </subsection>
    <subsection id="uid20" level="1">
      <bodyTitle>Minimal Exposure</bodyTitle>
      <participants>
        <person key="smis-2006-idm390881510208">
          <firstname>Nicolas</firstname>
          <lastname>Anciaux</lastname>
        </person>
        <person key="smis-2010-idm523361807232">
          <firstname>Benjamin</firstname>
          <lastname>Nguyen</lastname>
        </person>
      </participants>
      <p>When users request a service, the service provider usually asks for personal documents to tailor its service to the specific situation of the applicant. For example, the rate and duration of
      consumer's loans are usually adapted depending on the risk based on the income, assets or past lines of credits of the borrower. In practice, an excessive amount of personal data is collected
      and stored. Indeed, a paradox is at the root of this problem: service providers require users to expose data in order to determine whether that data is needed or not to achieve the purpose of
      the service. We currently explore a reverse approach, where service providers would publicly describe the data they require to complete their task, and where the applicants would confront those
      descriptions with their own data to determine 
      <i>themselves</i>the minimal subset of information to expose. We have first investigated solutions for simplistic tasks (e.g., evaluating a decision tree to determine the loan rate and duration
      a given applicant can claim), and we plan to address more complex ones (e.g., building the profile of customers, mining association rules, etc.) in the short term. The work on Minimal Exposure
      has just started and a first paper is under evaluation.</p>
    </subsection>
    <subsection id="uid21" level="1">
      <bodyTitle>Experiment in the medical field</bodyTitle>
      <participants>
        <person key="smis-2006-idm390881510208">
          <firstname>Nicolas</firstname>
          <lastname>Anciaux</lastname>
        </person>
        <person key="smis-2006-idm390881513888">
          <firstname>Luc</firstname>
          <lastname>Bouganim</lastname>
        </person>
        <person key="smis-2009-idm306842382288">
          <firstname>Lionel</firstname>
          <lastname>Le Folgoc</lastname>
        </person>
        <person key="smis-2006-idm390881517648">
          <firstname>Philippe</firstname>
          <lastname>Pucheral</lastname>
        </person>
        <person key="smis-2010-idm523361777136">
          <firstname>Alexei</firstname>
          <lastname>Troussov</lastname>
        </person>
      </participants>
      <p>The PlugDB engine is being experimented in the field since September 2011 to implement a secure and portable medical-social folder. The objective is to improve the coordination of medical
      care and social services provided at home for dependent people. Details related to this experiment conducted with about 120 practitioners and patients are given in Section 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#uid24" location="intern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>. While this action did not generate new academic results (though it helped us
      validating some previous results), it imposed us a strong investment in terms of test and optimization for our prototype and in terms of communication to promote this experiment at the regional
      level.</p>
    </subsection>
  </resultats>
  <contrats id="uid22">
    <bodyTitle>Contracts and Grants with Industry</bodyTitle>
    <subsection id="uid23" level="1">
      <bodyTitle>Industrial collaborations</bodyTitle>
      <p noindent="true">The SMIS project has a long lasting cooperation with Axalto, recently merged with Gemplus to form Gemalto, the world's leading providers of microprocessor cards. Gemalto
      provides SMIS with advanced hardware and software smart card platforms which are essential to validate numbers of our research results. In return, SMIS provides Gemalto with application
      requirements and technical feedbacks that help them adapting their future platforms towards data intensive applications. SMIS has also a growing cooperation with Santeos, an Atos Origin company
      developing software platforms of on-line medical services. Santeos is member of the consortium selected by the French Ministry of Health to host the French DMP (the national Personal Medical
      Folder initiative) . This cooperation helps us tackling one of our targeted applications, namely the protection of medical folders.</p>
    </subsection>
    <subsection id="uid24" level="1">
      <bodyTitle>DMSP Yvelines District grant (Nov 2010 - Apr. 2012)</bodyTitle>
      <p>Partners: INRIA-SMIS (coordinator), Gemalto, UVSQ, Santeos</p>
      <p noindent="true">SMIS funding : 75k€</p>
      <p noindent="true">
        <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://www-smis.inria.fr/~DMSP/accueil.php" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://
        <allowbreak/>www-smis.
        <allowbreak/>inria.
        <allowbreak/>fr/
        <allowbreak/>~DMSP/
        <allowbreak/>accueil.
        <allowbreak/>php</ref>
      </p>
      <p noindent="true">Electronic Health Record (EHR) projects have been launched in most developed countries to increase the quality of care while decreasing its cost. Despite their unquestionable
      benefits, patients are reluctant to abandon their control of highly sensitive data to a distant server. The objective of the DMSP project is to complement a traditional EHR server with a secure
      and mobile personal medical folder (1) to protect and share highly sensitive data among trusted parties and (2) to provide a seamless access to the data even in disconnected mode. The DMSP
      architecture builds upon the technology designed in the PlugDB project (see above). It is currently experimented in the context of a medical-social network providing care and services at home
      for elderly people. The experiment in the field started in September 2011 with a population of 120 volunteer patients and practitioners in the Yvelines district.</p>
    </subsection>
  </contrats>
  <international id="uid25">
    <bodyTitle>Partnerships and Cooperations</bodyTitle>
    <subsection id="uid26" level="1">
      <bodyTitle>National Initiatives</bodyTitle>
      <subsection id="uid27" level="2">
        <bodyTitle>ANR DEMOTIS (Feb. 2009 - Feb. 2012)</bodyTitle>
        <p>Partners: SopinSpace (coordinator), INRIA (SMIS, SECRET), CECOGI</p>
        <p noindent="true">SMIS funding: 85k€</p>
        <p noindent="true">
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://www.demotis.org/" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://
          <allowbreak/>www.
          <allowbreak/>demotis.
          <allowbreak/>org/
          <allowbreak/></ref>
        </p>
        <p noindent="true">The design and implementation of large-scale infrastructure for sensitive and critical data (e.g., electronic health records) have to face a tangle of legal provisions,
        technical standards, and societal concerns and expectations. DEMOTIS project aims to understand how the intrication between legal and technical domains constrains the design of such data
        infrastructures. DEMOTIS consists of two interdependent facets: legal (health law, privacy law, intellectual property law) and computer science (database security, cryptographic techniques).
        Combining expertise of researchers in Law and computer scientists should help to better assess whether law statements can be actually put in practice, to characterize the related
        technological challenges when mismatches are detected and, when possible, to suggest preliminary solutions.</p>
      </subsection>
      <subsection id="uid28" level="2">
        <bodyTitle>ANR KISS (Dec. 2011 - Dec. 2015)</bodyTitle>
        <p noindent="true">Partners: INRIA-SMIS (coordinator), INRIA-SECRET, LIRIS, Univ. of Versailles, CryptoExperts, Gemalto, Yvelines district</p>
        <p noindent="true">SMIS funding: 230k€</p>
        <p noindent="true">The idea promoted in KISS is to embed, in trusted devices, software components capable of acquiring, storing and managing securely various forms of personal data (e.g.,
        salary forms, invoices, banking statements, geolocation data, depending on the applications). These software components form a Personal Data Server which can remain under the holder’s
        control. The scientific challenges include: embedded data management issues tackling regular, streaming and spatio-temporal data (e.g., geolocation data), data provenance-based privacy
        models, crypto-protected distributed protocols to implement private communications and secure global computations.</p>
      </subsection>
    </subsection>
    <subsection id="uid29" level="1">
      <bodyTitle>European Initiatives</bodyTitle>
      <subsection id="uid30" level="2">
        <bodyTitle>Collaborations in European Programs, except FP7</bodyTitle>
        <sanspuceslist>
          <li id="uid31">
            <p noindent="true">Program: Danish Council for Independent Research (FTP call)</p>
          </li>
          <li id="uid32">
            <p noindent="true">Project acronym: CLyDE</p>
          </li>
          <li id="uid33">
            <p noindent="true">Project title: Cross-LaYer optimized Database Engine</p>
          </li>
          <li id="uid34">
            <p noindent="true">Duration: 10/2011 - 10/2014</p>
          </li>
          <li id="uid35">
            <p noindent="true">Coordinator: Philippe Bonnet (ITU of Copenhagen)</p>
          </li>
          <li id="uid36">
            <p noindent="true">Other partners: IT University of Copenhagen - Denmark</p>
          </li>
          <li id="uid37">
            <p noindent="true">Abstract: The goal is to explore how flash devices, operating system and database system can be designed together to improve overall performance. Such a co-design is
            particularly important for the next generation database appliances, or cloud-based relational database systems for which well-suited flash components must be specified. More generally,
            our goal is to influence the evolution of flash devices and commodity database systems for the benefit of data intensive applications. The project should result in two complementary
            open-source software systems: (i) a bimodal flash device software component based on the idea from 
            <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid18" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, and (ii) a database system optimized for bimodal flash devices.
            The project funding will be managed by the IT University of Copenhagen and will cover the expenses for two co-supervised PhD students (including regular visits to and from Denmark</p>
          </li>
        </sanspuceslist>
        <p>The SMIS members have developed tight european cooperations with the following persons/teams:</p>
        <simplelist>
          <li id="uid38">
            <p noindent="true">P.M.G. Apers (Professor at the University of Twente, The Netherlands): collaboration on data confidentiality issues.</p>
          </li>
          <li id="uid39">
            <p noindent="true">Michalis Vazirgiannis (Athens University of Economics and Business): collaboration on Minimal Exposure in the context of Michalis' Digiteo Chair at LIX (Ecole
            Polytechnique).</p>
          </li>
          <li id="uid40">
            <p noindent="true">P. Bonnet (Associate Professor at the University of Copenhagen, Denmark): collaboration on Flash-based data management for high-end servers. The study of flash devices
            started during a short sabbatical of Luc Bouganim (from April to August 2008) in Copenhagen. The uFLIP study has been conducted in close cooperation with Philippe Bonnet from IT
            University of Copenhagen and Björn Þór Jónsson from Reykjavík University. The cooperation with Copenhagen is very active and led to the second study on bimodal flash devices. A masters
            student has started a PhD thesis, co-supervised by Luc Bouganim and Philippe Bonnet on bimodal flash devices. Philippe Bonnet has planned a 1 year visit to SMIS in 2012-2013.</p>
          </li>
        </simplelist>
      </subsection>
    </subsection>
    <subsection id="uid41" level="1">
      <bodyTitle>International Initiatives</bodyTitle>
      <p>The SMIS members have developed tight international cooperations with the following persons/teams:</p>
      <simplelist>
        <li id="uid42">
          <p noindent="true">Dennis Shasha (Professor at the University of New-York, USA): collaboration on tamper-resistant data management issues. Dennis Shasha has done a one year sabbatical stay
          in SMIS (July 2006 to June 2007).</p>
        </li>
        <li id="uid43">
          <p noindent="true">Xiaofeng Meng (Professor at Renmin University, Beijing, China): collaboration on embedded data management issues, partly funded by a Franco-Chinese research program (PRA
          SI-05604).</p>
        </li>
        <li id="uid44">
          <p noindent="true">I. Ray and I.Ray (Professors at Colorado State University, USA): collaboration on data privacy and usage control (Indrajit and Indrakshi Ray have visited SMIS from
          September 2009 up to February 2010).</p>
        </li>
      </simplelist>
    </subsection>
  </international>
  <diffusion id="uid45">
    <bodyTitle>Dissemination</bodyTitle>
    <subsection id="uid46" level="1">
      <bodyTitle>Animation of the scientific community</bodyTitle>
      <simplelist>
        <li id="uid47">
          <p noindent="true">Philippe Pucheral</p>
          <simplelist>
            <li id="uid48">
              <p noindent="true">Area Editor of the Information Systems international journal (2007-now).</p>
            </li>
            <li id="uid49">
              <p noindent="true">Scientific evaluation for ANR (programmes Blanc and Emergence) since 2009.</p>
            </li>
            <li id="uid50">
              <p noindent="true">PC member of MOBIWIS'11, CODAPSY’11, EDBT’11.</p>
            </li>
            <li id="uid51">
              <p noindent="true">Member of the recruiting committees of UVSQ and ENSIMAG.</p>
            </li>
            <li id="uid52">
              <p noindent="true">Co-founder of the bi-annual French Summer School “Masses de Données Distribuées” and co-organiser of this school in2010 and 2012.</p>
            </li>
            <li id="uid53">
              <p noindent="true">Referee for the PhD thesis M. Jawad (U. Nantes, 2011) , M. Tlili (U. Nantes, 2011).</p>
            </li>
          </simplelist>
        </li>
        <li id="uid54">
          <p noindent="true">Luc Bouganim</p>
          <simplelist>
            <li id="uid55">
              <p noindent="true">Tutorial on Data Management in Flash Memories, given at VLDB 2011 
              <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid1" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
            </li>
            <li id="uid56">
              <p noindent="true">President of the INRIA Post-Doc and Delegation Commission</p>
            </li>
            <li id="uid57">
              <p noindent="true">PC member of EDBT’11, FlashDB’11, MobiWIS’11, VLDB’11 PhD WS.</p>
            </li>
            <li id="uid58">
              <p noindent="true">PC chair of BDA 2011 (Bases de Données Avancées).</p>
            </li>
            <li id="uid59">
              <p noindent="true">Reviewer for the “Digital engineering &amp; security” program of the French research agency (ANR) (2011).</p>
            </li>
            <li id="uid60">
              <p noindent="true">Member of the Commission PES (Prime d’Excellence Scientifique) for computer science at UVSQ (since 2010).</p>
            </li>
            <li id="uid61">
              <p noindent="true">Referee for the PhD thesis of Brice Chardin (INSA Lyon) and Stéphane Jacob (Univ. Paris 6) in 2012</p>
            </li>
          </simplelist>
        </li>
        <li id="uid62">
          <p noindent="true">Nicolas Anciaux</p>
          <simplelist>
            <li id="uid63">
              <p noindent="true">PC member of ICDE’11.</p>
            </li>
            <li id="uid64">
              <p noindent="true">Member of the Editorial Board of TSI Journal (Technique et Science Informatiques) (2007 – now).</p>
            </li>
            <li id="uid65">
              <p noindent="true">Jury member of the PhD thesis of S. Yin (UVSQ) in 2011.</p>
            </li>
          </simplelist>
        </li>
        <li id="uid66">
          <p noindent="true">Benjamin Nguyen</p>
          <simplelist>
            <li id="uid67">
              <p noindent="true">Co-author of a book on the introduction of Computer Science in high school 
              <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid21" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
            </li>
            <li id="uid68">
              <p noindent="true">Member of the Advisory Committee of the W3C for the UVSQ, of the W3C XQuery Working Group (Test Suite Editor) and of the W3C Social Web Interest Group.</p>
            </li>
            <li id="uid69">
              <p noindent="true">PC member of ICDE 2011, EDA 2011, ECML-PKDD 2011, BDA 2011.</p>
            </li>
            <li id="uid70">
              <p noindent="true">Coach of the UVSQ H.E.O. student team that reached the French finals (top 5 teams) of Microsoft Imagine Cup (Software Design Category).</p>
            </li>
            <li id="uid71">
              <p noindent="true">Member of the Selection Committee of UVSQ (since 2009), of U. Paris-X Nanterre (since 2007), and of U. Paris-XI (in 2011).</p>
            </li>
            <li id="uid72">
              <p noindent="true">Elected member of the Scientific Committee of the Science Faculty of UVSQ.</p>
            </li>
            <li id="uid73">
              <p noindent="true">Member of the INRIA Post-Doc Commission since 2010.</p>
            </li>
          </simplelist>
        </li>
      </simplelist>
      <subsection id="uid74" level="2">
        <bodyTitle>General Audience Actions</bodyTitle>
        <p>SMIS members have an important dissemination activity, motivated both by the popularity of the addressed research domain (security/privacy) and of the targeted applications (e.g., personal
        medical folder), leading to</p>
        <simplelist>
          <li id="uid75">
            <p noindent="true">interactions with different institutions, for instance, the French Deputy Chamber, The Parliamentary Office for Evaluation of Scientific and Technological Options
            (OPECST), or the French Network and Information Security Agency.</p>
          </li>
          <li id="uid76">
            <p noindent="true">interviews resulting in articles in large audience magazine like “La Recherche”, the CNRS Journal or BBC news, as well as participation in debates 
            <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid22" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
          </li>
          <li id="uid77">
            <p noindent="true">talks and demonstrations targeting industrials in wide audience conferences like JavaOne, or e-Smart or meetings with industrials like “Les rendez-vous Carnot” and
            others 
            <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid23" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>.</p>
          </li>
          <li id="uid78">
            <p noindent="true">invited talks in conference or workshops with broad audience: targeting physicians 
            <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#smis-2011-bid24" location="biblio" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest"/>, Researchers in law or keynote speech at UbiMob.</p>
          </li>
          <li id="uid79">
            <p noindent="true">actions targeting students like the organization of the French Summer School “Masses de Données Distribuées” in 2010 and 2012 or interventions at IBM France for
            developer training.</p>
          </li>
        </simplelist>
      </subsection>
    </subsection>
    <subsection id="uid80" level="1">
      <bodyTitle>Teaching</bodyTitle>
      <p>SMIS is a joint project-team with University of Versailles St-Quentin (UVSQ) and CNRS. Hence SMIS members are naturally deeply involved in teaching.</p>
      <simplelist>
        <li id="uid81">
          <p noindent="true">P. Pucheral: (120h/y)</p>
          <simplelist>
            <li id="uid82">
              <p noindent="true">Full professor at UVSQ.</p>
            </li>
            <li id="uid83">
              <p noindent="true">Director of the research Master COSY (UVSQ).</p>
            </li>
            <li id="uid84">
              <p noindent="true">Member of the HDR committee of the STV doctoral school.</p>
            </li>
            <li id="uid85">
              <p noindent="true">Courses on databases, DBMS architecture and security in Master1, Master2 and engineer school ISTY.</p>
            </li>
          </simplelist>
        </li>
        <li id="uid86">
          <p noindent="true">B. Nguyen: (192h/y)</p>
          <simplelist>
            <li id="uid87">
              <p noindent="true">Associate professor at UVSQ.</p>
            </li>
            <li id="uid88">
              <p noindent="true">Courses on object programing, databases, XML in undergraduate and Master2.</p>
            </li>
            <li id="uid89">
              <p noindent="true">Courses on Teaching CS courses for High School teachers.</p>
            </li>
          </simplelist>
        </li>
        <li id="uid90">
          <p noindent="true">L. Bouganim: (90h/y)</p>
          <simplelist>
            <li id="uid91">
              <p noindent="true">Courses on DBMS architecture, data security, database technology in Master1 and Master2 (AFTI, Orsay) and in engineering school (ENST Paris).</p>
            </li>
          </simplelist>
        </li>
        <li id="uid92">
          <p noindent="true">N. Anciaux: (90h/y)</p>
          <simplelist>
            <li id="uid93">
              <p noindent="true">Courses on DBMS internal mechanisms, database technology in Master1 and Master2 (UVSQ), and in engineering school (ENSTA Paris).</p>
            </li>
          </simplelist>
        </li>
        <li id="uid94">
          <p noindent="true">T. Allard: (64h/y)</p>
          <simplelist>
            <li id="uid95">
              <p noindent="true">Courses on Database concepts, System Programming in undergraduate and Masters 1 (UVSQ).</p>
            </li>
          </simplelist>
        </li>
        <li id="uid96">
          <p noindent="true">L. Le Folgoc: (64h/y)</p>
          <simplelist>
            <li id="uid97">
              <p noindent="true">Courses on Relational Database Concepts and SQL, system programming in Masters 1 (UVSQ).</p>
            </li>
          </simplelist>
        </li>
        <li id="uid98">
          <p noindent="true">S. Yin: (51h/y)</p>
          <simplelist>
            <li id="uid99">
              <p noindent="true">Courses on Relational Database Concepts and SQL, Embedded DBMS in Master1 and 2 (UVSQ and CNAM).</p>
            </li>
          </simplelist>
        </li>
      </simplelist>
      <p>PhD &amp; HdR:</p>
      <sanspuceslist>
        <li id="uid100">
          <p noindent="true">Shaoyi Yin. Un modèle de stockage et d'indexation pour des données embarquées en mémoire flash. PhD Thesis University of Versailles Saint-Quentin-en-Yvelines (UVSQ), June
          2011, Supervized by Philippe Pucheral.</p>
        </li>
        <li id="uid101">
          <p noindent="true">Yanli Guo.Confidentialité et intégrité de bases de données embarquées. PhD Thesis University of Versailles Saint-Quentin-en-Yvelines (UVSQ), December 2011, Co-supervized
          by Luc Bouganim and Nicolas Anciaux</p>
        </li>
        <li id="uid102">
          <p noindent="true">Tristan Allard. Sanitizing Microdata Without Leak: A Decentralized Approach. PhD Thesis University of Versailles Saint-Quentin-en-Yvelines (UVSQ), December 2011,
          Co-supervized by Philippe Pucheral and Benjamin Nguyen</p>
        </li>
        <li id="uid103">
          <p noindent="true">PhD in progress : Lionel Le Folgoc, October 2009, Co-supervized by Luc Bouganim and Nicolas Anciaux</p>
        </li>
        <li id="uid104">
          <p noindent="true">PhD in progress : Matias Bjørling, December 2011, Co-supervized by Philippe Bonnet and Luc Bouganim</p>
        </li>
      </sanspuceslist>
    </subsection>
  </diffusion>
  <biblio id="bibliography" html="bibliography" numero="10" titre="Bibliography">
    <biblStruct id="smis-2011-bid37" type="article" rend="refer" n="refercite:AGP02">
      <analytic>
        <title level="a">Dictatorial Transaction Processing : Atomic Commitment without Veto Right</title>
        <author>
          <persName>
            <foreName>M.</foreName>
            <surname>Abdallah</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>R.</foreName>
            <surname>Guerraoui</surname>
            <initial>R.</initial>
          </persName>
          <persName key="smis-2006-idm390881517648">
            <foreName>Philippe</foreName>
            <surname>Pucheral</surname>
            <initial>P.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Distributed and Parallel Database Journal (DAPD)</title>
        <imprint>
          <biblScope type="volume">11</biblScope>
          <biblScope type="number">3</biblScope>
          <dateStruct>
            <year>2002</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="smis-2011-bid36" type="inproceedings" rend="refer" n="refercite:ABBPS07">
      <analytic>
        <title level="a">GhostDB: querying visible and hidden data without leaks</title>
        <author>
          <persName key="smis-2006-idm390881510208">
            <foreName>N.</foreName>
            <surname>Anciaux</surname>
            <initial>N.</initial>
          </persName>
          <persName key="smis-2006-idm390881493984">
            <foreName>M.</foreName>
            <surname>Benzine</surname>
            <initial>M.</initial>
          </persName>
          <persName key="smis-2006-idm390881513888">
            <foreName>L.</foreName>
            <surname>Bouganim</surname>
            <initial>L.</initial>
          </persName>
          <persName key="smis-2006-idm390881517648">
            <foreName>Philippe</foreName>
            <surname>Pucheral</surname>
            <initial>P.</initial>
          </persName>
          <persName key="smis-2006-idm390881503232">
            <foreName>D.</foreName>
            <surname>Shasha</surname>
            <initial>D.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">26th International Conference on Management of Data (SIGMOD)</title>
        <imprint>
          <dateStruct>
            <month>June</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="smis-2011-bid32" type="article" rend="refer" n="refercite:ABB+09">
      <analytic>
        <title level="a">Revelation on Demand</title>
        <author>
          <persName key="smis-2006-idm390881510208">
            <foreName>N.</foreName>
            <surname>Anciaux</surname>
            <initial>N.</initial>
          </persName>
          <persName key="smis-2006-idm390881493984">
            <foreName>M.</foreName>
            <surname>Benzine</surname>
            <initial>M.</initial>
          </persName>
          <persName key="smis-2006-idm390881513888">
            <foreName>L.</foreName>
            <surname>Bouganim</surname>
            <initial>L.</initial>
          </persName>
          <persName key="smis-2006-idm390881517648">
            <foreName>Philippe</foreName>
            <surname>Pucheral</surname>
            <initial>P.</initial>
          </persName>
          <persName key="smis-2006-idm390881503232">
            <foreName>D.</foreName>
            <surname>Shasha</surname>
            <initial>D.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Distributed and Parallel Database Journal (DAPD)</title>
        <imprint>
          <biblScope type="volume">25</biblScope>
          <biblScope type="number">1-2</biblScope>
          <dateStruct>
            <month>April</month>
            <year>2009</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="smis-2011-bid38" type="inproceedings" rend="refer" n="refercite:ABP03b">
      <analytic>
        <title level="a">Memory Requirements for Query Execution in Highly Constrained Devices</title>
        <author>
          <persName key="smis-2006-idm390881510208">
            <foreName>N.</foreName>
            <surname>Anciaux</surname>
            <initial>N.</initial>
          </persName>
          <persName key="smis-2006-idm390881513888">
            <foreName>L.</foreName>
            <surname>Bouganim</surname>
            <initial>L.</initial>
          </persName>
          <persName key="smis-2006-idm390881517648">
            <foreName>Philippe</foreName>
            <surname>Pucheral</surname>
            <initial>P.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">Proc. of the 29th Int. Conf. on Very Large Data Bases (VLDB)</title>
        <imprint>
          <dateStruct>
            <year>2003</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="smis-2011-bid35" type="article" rend="refer" n="refercite:ABP+08">
      <analytic>
        <title level="a">DiSC: Benchmarking Secure Chip DBMS</title>
        <author>
          <persName key="smis-2006-idm390881510208">
            <foreName>N.</foreName>
            <surname>Anciaux</surname>
            <initial>N.</initial>
          </persName>
          <persName key="smis-2006-idm390881513888">
            <foreName>L.</foreName>
            <surname>Bouganim</surname>
            <initial>L.</initial>
          </persName>
          <persName key="smis-2006-idm390881517648">
            <foreName>Philippe</foreName>
            <surname>Pucheral</surname>
            <initial>P.</initial>
          </persName>
          <persName key="atlas-2006-idm26992091216">
            <foreName>P.</foreName>
            <surname>Valduriez</surname>
            <initial>P.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">IEEE Transactions on Knowledge and Data Engineering (IEEE TKDE)</title>
        <imprint>
          <biblScope type="volume">20</biblScope>
          <biblScope type="number">10</biblScope>
          <dateStruct>
            <month>October</month>
            <year>2008</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="smis-2011-bid31" type="article" rend="refer" n="refercite:BDPu08">
      <analytic>
        <title level="a">Dynamic Access-Control Policies on XML Encrypted Data</title>
        <author>
          <persName key="smis-2006-idm390881513888">
            <foreName>L.</foreName>
            <surname>Bouganim</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>F.</foreName>
            <surname>Dang-Ngoc</surname>
            <initial>F.</initial>
          </persName>
          <persName key="smis-2006-idm390881517648">
            <foreName>Philippe</foreName>
            <surname>Pucheral</surname>
            <initial>P.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">ACM Transactions on Information and System Security (ACM TISSEC)</title>
        <imprint>
          <biblScope type="volume">10</biblScope>
          <biblScope type="number">4</biblScope>
          <dateStruct>
            <month>January</month>
            <year>2008</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="smis-2011-bid34" type="inproceedings" rend="refer" n="refercite:uFLIP09">
      <analytic>
        <title level="a">uFLIP: Understanding Flash IO Patterns</title>
        <author>
          <persName key="smis-2006-idm390881513888">
            <foreName>L.</foreName>
            <surname>Bouganim</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>B.</foreName>
            <surname>Jónsson</surname>
            <initial>B.</initial>
          </persName>
          <persName>
            <foreName>P.</foreName>
            <surname>Bonnet</surname>
            <initial>P.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">4th Biennial Conference on Innovative Data Systems Research (CIDR)</title>
        <loc>Asilomar, California, USA</loc>
        <imprint>
          <dateStruct>
            <month>January</month>
            <year>2009</year>
          </dateStruct>
        </imprint>
      </monogr>
      <note type="bnote">best paper award</note>
    </biblStruct>
    <biblStruct id="smis-2011-bid12" type="inproceedings" rend="refer" n="refercite:BDP04">
      <analytic>
        <title level="a">Client-Based Access Control Management for XML Documents</title>
        <author>
          <persName key="smis-2006-idm390881513888">
            <foreName>L.</foreName>
            <surname>Bouganim</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>F.</foreName>
            <surname>Dang-Ngoc</surname>
            <initial>F.</initial>
          </persName>
          <persName key="smis-2006-idm390881517648">
            <foreName>Philippe</foreName>
            <surname>Pucheral</surname>
            <initial>P.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">Proc. of the 30th Int. Conf. on Very Large Databases (VLDB)</title>
        <imprint>
          <dateStruct>
            <year>2004</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="smis-2011-bid9" type="article" rend="refer" n="refercite:PBV+01">
      <analytic>
        <title level="a">PicoDBMS : Scaling down Database Techniques for the Smartcard</title>
        <author>
          <persName key="smis-2006-idm390881517648">
            <foreName>Philippe</foreName>
            <surname>Pucheral</surname>
            <initial>P.</initial>
          </persName>
          <persName key="smis-2006-idm390881513888">
            <foreName>L.</foreName>
            <surname>Bouganim</surname>
            <initial>L.</initial>
          </persName>
          <persName key="atlas-2006-idm26992091216">
            <foreName>P.</foreName>
            <surname>Valduriez</surname>
            <initial>P.</initial>
          </persName>
          <persName>
            <foreName>C.</foreName>
            <surname>Bobineau</surname>
            <initial>C.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Very Large Data Bases Journal (VLDBJ), Best Paper Award VLDB'2000</title>
        <imprint>
          <biblScope type="volume">10</biblScope>
          <biblScope type="number">2-3</biblScope>
          <dateStruct>
            <year>2001</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="smis-2011-bid33" type="inproceedings" rend="refer" n="refercite:YPMe09a">
      <analytic>
        <title level="a">A Sequential Indexing Scheme for Flash-Based Embedded Systems</title>
        <author>
          <persName key="smis-2006-idm390881476752">
            <foreName>S.</foreName>
            <surname>Yin</surname>
            <initial>S.</initial>
          </persName>
          <persName key="smis-2006-idm390881517648">
            <foreName>Philippe</foreName>
            <surname>Pucheral</surname>
            <initial>P.</initial>
          </persName>
          <persName>
            <foreName>X.</foreName>
            <surname>Meng</surname>
            <initial>X.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">Proc. of the International Conference on Extending Database Technology (EDBT)</title>
        <loc>Saint-Petersburg, Russia</loc>
        <imprint>
          <dateStruct>
            <month>March</month>
            <year>2009</year>
          </dateStruct>
        </imprint>
      </monogr>
      <affiliation>
        <country>CN</country>
      </affiliation>
    </biblStruct>
    <biblStruct dedoublkey="1869" id="smis-2011-bid21" type="book" rend="year" n="cite:dowek">
      <monogr>
        <title level="m">Une introduction à la science informatique: Pour les enseignants de la discipline informatique au lycée</title>
        <author>
          <persName>
            <foreName>Jean-Pierre</foreName>
            <surname>Archambault</surname>
            <initial>J.-P.</initial>
          </persName>
          <persName key="hipercom-2006-idm328444108544">
            <foreName>Emmanuel</foreName>
            <surname>Baccelli</surname>
            <initial>E.</initial>
          </persName>
          <persName key="proval-2006-idm410174308976">
            <foreName>Sylvie</foreName>
            <surname>Boldo</surname>
            <initial>S.</initial>
          </persName>
          <persName>
            <foreName>Denis</foreName>
            <surname>Bouhineau</surname>
            <initial>D.</initial>
          </persName>
          <persName>
            <foreName>Patrick</foreName>
            <surname>Cégielski</surname>
            <initial>P.</initial>
          </persName>
          <persName key="hipercom-2006-idm328444099744">
            <foreName>Thomas</foreName>
            <surname>Clausen</surname>
            <initial>T.</initial>
          </persName>
          <persName key="logical-2006-idm356512403456">
            <foreName>Gilles</foreName>
            <surname>Dowek</surname>
            <initial>G.</initial>
          </persName>
          <persName>
            <foreName>Irène</foreName>
            <surname>Guessarian</surname>
            <initial>I.</initial>
          </persName>
          <persName>
            <foreName>Stéphane</foreName>
            <surname>Lopès</surname>
            <initial>S.</initial>
          </persName>
          <persName>
            <foreName>Laurent</foreName>
            <surname>Mounier</surname>
            <initial>L.</initial>
          </persName>
          <persName key="smis-2010-idm523361807232">
            <foreName>Benjamin</foreName>
            <surname>Nguyen</surname>
            <initial>B.</initial>
          </persName>
          <persName>
            <foreName>Franck</foreName>
            <surname>Quessette</surname>
            <initial>F.</initial>
          </persName>
          <persName>
            <foreName>Anne</foreName>
            <surname>Rasse</surname>
            <initial>A.</initial>
          </persName>
          <persName key="grand-large-2006-idm343610693808">
            <foreName>Brigitte</foreName>
            <surname>Rozoy</surname>
            <initial>B.</initial>
          </persName>
          <persName>
            <foreName>Claude</foreName>
            <surname>Timsit</surname>
            <initial>C.</initial>
          </persName>
          <persName key="odyssee-2006-idm405611886032">
            <foreName>Thierry</foreName>
            <surname>Viéville</surname>
            <initial>T.</initial>
          </persName>
          <persName key="mescal-2006-idm111690843248">
            <foreName>Jean-Marc</foreName>
            <surname>Vincent</surname>
            <initial>J.-M.</initial>
          </persName>
        </author>
        <imprint>
          <publisher>
            <orgName>CNDP-CRDP Eds.</orgName>
          </publisher>
          <dateStruct>
            <year>2011</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="5488" id="smis-2011-bid27" type="phdthesis" rend="year" n="cite:ta">
      <monogr>
        <title level="m">Sanitizing Microdata Without Leak: A Decentralized Approach</title>
        <author>
          <persName key="smis-2006-idm390881482064">
            <foreName>Tristan</foreName>
            <surname>Allard</surname>
            <initial>T.</initial>
          </persName>
        </author>
        <imprint>
          <publisher>
            <orgName type="school">University of Versailles</orgName>
          </publisher>
          <dateStruct>
            <year>2011</year>
          </dateStruct>
        </imprint>
      </monogr>
      <note type="typdoc">Ph. D. Thesis</note>
    </biblStruct>
    <biblStruct dedoublkey="5305" id="smis-2011-bid26" type="phdthesis" rend="year" n="cite:yg">
      <monogr>
        <title level="m">Confidentialité et intégrité de bases de données embarquées</title>
        <author>
          <persName key="smis-2009-idm306842376240">
            <foreName>Y.</foreName>
            <surname>Guo</surname>
            <initial>Y.</initial>
          </persName>
        </author>
        <imprint>
          <publisher>
            <orgName type="school">University of Versailles</orgName>
          </publisher>
          <dateStruct>
            <year>2011</year>
          </dateStruct>
        </imprint>
      </monogr>
      <note type="typdoc">Ph. D. Thesis</note>
    </biblStruct>
    <biblStruct dedoublkey="5536" id="smis-2011-bid25" type="phdthesis" rend="year" n="cite:sy">
      <monogr>
        <title level="m">Un modèle de stockage et d’indexation pour des données embarquées en mémoire flash</title>
        <author>
          <persName key="smis-2006-idm390881476752">
            <foreName>S.</foreName>
            <surname>Yin</surname>
            <initial>S.</initial>
          </persName>
        </author>
        <imprint>
          <publisher>
            <orgName type="school">University of Versailles</orgName>
          </publisher>
          <dateStruct>
            <year>2011</year>
          </dateStruct>
        </imprint>
      </monogr>
      <note type="typdoc">Ph. D. Thesis</note>
    </biblStruct>
    <biblStruct dedoublkey="2212" id="smis-2011-bid30" type="incollection" rend="year" n="cite:bedini:2011:hal-00623913:1">
      <identifiant type="hal" value="hal-00623913"/>
      <analytic>
        <title level="a">Semantic technologies and e-business</title>
        <author>
          <persName>
            <foreName>Ivan</foreName>
            <surname>Bedini</surname>
            <initial>I.</initial>
          </persName>
          <persName>
            <foreName>Georges</foreName>
            <surname>Gardarin</surname>
            <initial>G.</initial>
          </persName>
          <persName key="smis-2010-idm523361807232">
            <foreName>Benjamin</foreName>
            <surname>Nguyen</surname>
            <initial>B.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <editor role="editor">
          <persName>
            <foreName>Ejub</foreName>
            <surname>Kajan</surname>
            <initial>E.</initial>
          </persName>
        </editor>
        <title level="m">Electronic Business Interoperability : Concepts, Opportunities and Challenges</title>
        <imprint>
          <publisher>
            <orgName>IGI Global Publishing</orgName>
          </publisher>
          <dateStruct>
            <year>2011</year>
          </dateStruct>
          <biblScope type="pages">243-278</biblScope>
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://hal.inria.fr/hal-00623913/en" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://
          <allowbreak/>hal.
          <allowbreak/>inria.
          <allowbreak/>fr/
          <allowbreak/>hal-00623913/
          <allowbreak/>en</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="1797" id="smis-2011-bid28" type="article" rend="year" n="cite:nguyen:2011:hal-00616613:1">
      <identifiant type="hal" value="hal-00616613"/>
      <identifiant type="doi" value="10.1177/0759106311417540"/>
      <analytic>
        <title level="a">XML content warehousing: Improving sociological studies of mailing lists and web data</title>
        <author>
          <persName key="smis-2010-idm523361807232">
            <foreName>Benjamin</foreName>
            <surname>Nguyen</surname>
            <initial>B.</initial>
          </persName>
          <persName>
            <foreName>Antoine</foreName>
            <surname>Vion</surname>
            <initial>A.</initial>
          </persName>
          <persName>
            <foreName>François-Xavier</foreName>
            <surname>Dudouet</surname>
            <initial>F.-X.</initial>
          </persName>
          <persName key="leo-2010-idm524946194480">
            <foreName>Dario</foreName>
            <surname>Colazzo</surname>
            <initial>D.</initial>
          </persName>
          <persName key="gemo-2006-idm416490941472">
            <foreName>Ioana</foreName>
            <surname>Manolescu</surname>
            <initial>I.</initial>
          </persName>
          <persName key="gemo-2006-idm416489866096">
            <foreName>Pierre</foreName>
            <surname>Senellart</surname>
            <initial>P.</initial>
          </persName>
        </author>
      </analytic>
      <monogr id="rid00300" x-editorial-board="yes" x-international-audience="yes">
        <idno type="issn">0759-1063</idno>
        <title level="j">Bulletin of Sociological Methodology/Bulletin de Méthodologie Sociologique</title>
        <imprint>
          <biblScope type="volume">112</biblScope>
          <biblScope type="number">1</biblScope>
          <dateStruct>
            <month>October</month>
            <year>2011</year>
          </dateStruct>
          <biblScope type="pages">5-31</biblScope>
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://hal.inria.fr/hal-00616613/en" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://
          <allowbreak/>hal.
          <allowbreak/>inria.
          <allowbreak/>fr/
          <allowbreak/>hal-00616613/
          <allowbreak/>en</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="smis-2011-bid0" type="inproceedings" rend="best" n="cite:PST11">
      <identifiant type="hal" value="hal-00624043"/>
      <analytic>
        <title level="a">Safe Realization of the Generalization Privacy Mechanism</title>
        <author>
          <persName key="smis-2006-idm390881482064">
            <foreName>Tristan</foreName>
            <surname>Allard</surname>
            <initial>T.</initial>
          </persName>
          <persName key="smis-2010-idm523361807232">
            <foreName>Benjamin</foreName>
            <surname>Nguyen</surname>
            <initial>B.</initial>
          </persName>
          <persName key="smis-2006-idm390881517648">
            <foreName>Philippe</foreName>
            <surname>Pucheral</surname>
            <initial>P.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-international-audience="yes" x-proceedings="yes">
        <title level="m">Privacy, Security and Trust</title>
        <loc>Montreal, Canada</loc>
        <imprint>
          <dateStruct>
            <year>2011</year>
          </dateStruct>
          <biblScope type="pages">1-8</biblScope>
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://hal.inria.fr/hal-00624043/en" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://
          <allowbreak/>hal.
          <allowbreak/>inria.
          <allowbreak/>fr/
          <allowbreak/>hal-00624043/
          <allowbreak/>en</ref>
        </imprint>
        <meeting id="cid623762">
          <title>Annual International Conference on Privacy, Security and Trust</title>
          <num>9</num>
          <abbr type="sigle">PST</abbr>
        </meeting>
      </monogr>
      <note type="bnote">Best Paper Award</note>
    </biblStruct>
    <biblStruct dedoublkey="4455" id="smis-2011-bid20" type="inproceedings" rend="year" n="cite:ISPEC11">
      <identifiant type="hal" value="hal-00624047"/>
      <analytic>
        <title level="a">Sanitizing Microdata Without Leak: Combining Preventive and Curative Actions</title>
        <author>
          <persName key="smis-2006-idm390881482064">
            <foreName>Tristan</foreName>
            <surname>Allard</surname>
            <initial>T.</initial>
          </persName>
          <persName key="smis-2010-idm523361807232">
            <foreName>Benjamin</foreName>
            <surname>Nguyen</surname>
            <initial>B.</initial>
          </persName>
          <persName key="smis-2006-idm390881517648">
            <foreName>Philippe</foreName>
            <surname>Pucheral</surname>
            <initial>P.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-international-audience="yes" x-proceedings="yes">
        <title level="m">ISPEC 2011 - Information Security Practice and Experience Conference</title>
        <loc>Gangzhou, China</loc>
        <imprint>
          <dateStruct>
            <year>2011</year>
          </dateStruct>
          <biblScope type="pages">333-342</biblScope>
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://hal.inria.fr/hal-00624047/en" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://
          <allowbreak/>hal.
          <allowbreak/>inria.
          <allowbreak/>fr/
          <allowbreak/>hal-00624047/
          <allowbreak/>en</ref>
        </imprint>
        <meeting id="cid105015">
          <title>Information Security Practice and Experience Conference</title>
          <num>2011</num>
          <abbr type="sigle">ISPEC</abbr>
        </meeting>
      </monogr>
      <note type="bnote">10 pages</note>
    </biblStruct>
    <biblStruct dedoublkey="4796" id="smis-2011-bid19" type="inproceedings" rend="year" n="cite:MDM-PHD11">
      <analytic>
        <title level="a">Towards a Safe Realization of Privacy-Preserving Data Publishing Mechanisms</title>
        <author>
          <persName key="smis-2006-idm390881482064">
            <foreName>Tristan</foreName>
            <surname>Allard</surname>
            <initial>T.</initial>
          </persName>
          <persName key="smis-2010-idm523361807232">
            <foreName>Benjamin</foreName>
            <surname>Nguyen</surname>
            <initial>B.</initial>
          </persName>
          <persName key="smis-2006-idm390881517648">
            <foreName>Philippe</foreName>
            <surname>Pucheral</surname>
            <initial>P.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-international-audience="yes" x-proceedings="yes">
        <title level="m">Ph. D. colloquium of the 12th IEEE International Conference on Mobile Data Management (MDM)</title>
        <loc>Luleå, Sweden</loc>
        <imprint>
          <dateStruct>
            <year>2011</year>
          </dateStruct>
          <biblScope type="pages">1–4</biblScope>
        </imprint>
        <meeting id="cid292240">
          <title>International Conference on Mobile Data Management</title>
          <num>12</num>
          <abbr type="sigle">MDM</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="4852" id="smis-2011-bid29" type="inproceedings" rend="year" n="cite:bedini:2011:hal-00624055:1">
      <identifiant type="hal" value="hal-00624055"/>
      <analytic>
        <title level="a">Transforming XML schema to OWL using patterns</title>
        <author>
          <persName>
            <foreName>Ivan</foreName>
            <surname>Bedini</surname>
            <initial>I.</initial>
          </persName>
          <persName>
            <foreName>Christopher</foreName>
            <surname>Matheus</surname>
            <initial>C.</initial>
          </persName>
          <persName>
            <foreName>Peter</foreName>
            <surname>Patel-Schneider</surname>
            <initial>P.</initial>
          </persName>
          <persName>
            <foreName>Aidan</foreName>
            <surname>Boran</surname>
            <initial>A.</initial>
          </persName>
          <persName key="smis-2010-idm523361807232">
            <foreName>Benjamin</foreName>
            <surname>Nguyen</surname>
            <initial>B.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-international-audience="yes" x-proceedings="yes">
        <title level="m">ICSC 2011 - 5th IEEE International Conference on Semantic Computing</title>
        <loc>Palo Alto, United States</loc>
        <imprint>
          <dateStruct>
            <year>2011</year>
          </dateStruct>
          <biblScope type="pages">1-8</biblScope>
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://hal.inria.fr/hal-00624055/en" location="extern" xlink:type="simple" xlink:show="replace" xlink:actuate="onRequest">http://
          <allowbreak/>hal.
          <allowbreak/>inria.
          <allowbreak/>fr/
          <allowbreak/>hal-00624055/
          <allowbreak/>en</ref>
        </imprint>
        <meeting id="cid498482">
          <title>IEEE International Conference on Semantic Computing</title>
          <num>5</num>
          <abbr type="sigle">ICSC</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="3356" id="smis-2011-bid18" type="inproceedings" rend="year" n="cite:CIDR11">
      <analytic>
        <title level="a">Flash Device Support for Database Management</title>
        <author>
          <persName>
            <foreName>P.</foreName>
            <surname>Bonnet</surname>
            <initial>P.</initial>
          </persName>
          <persName key="smis-2006-idm390881513888">
            <foreName>L.</foreName>
            <surname>Bouganim</surname>
            <initial>L.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-international-audience="yes" x-proceedings="yes">
        <title level="m">5th Biennial Conference on Innovative Data Systems Research (CIDR)</title>
        <loc>Asilomar, California, USA</loc>
        <imprint>
          <dateStruct>
            <month>January</month>
            <year>2011</year>
          </dateStruct>
          <biblScope type="pages">1-8</biblScope>
        </imprint>
        <meeting id="cid47980">
          <title>Conference on Innovative Data Systems Research</title>
          <num>5</num>
          <abbr type="sigle">CIDR</abbr>
        </meeting>
      </monogr>
      <affiliation>
        <country>DK</country>
      </affiliation>
    </biblStruct>
    <biblStruct dedoublkey="4689" id="smis-2011-bid1" type="inproceedings" rend="year" n="cite:bouganim2011flashtutorial">
      <analytic>
        <title level="a">System Co-Design and Data Management for Flash Devices</title>
        <author>
          <persName>
            <foreName>P.</foreName>
            <surname>Bonnet</surname>
            <initial>P.</initial>
          </persName>
          <persName key="smis-2006-idm390881513888">
            <foreName>L.</foreName>
            <surname>Bouganim</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>I.</foreName>
            <surname>Koltsidas</surname>
            <initial>I.</initial>
          </persName>
          <persName>
            <foreName>S.D.</foreName>
            <surname>Viglas</surname>
            <initial>S.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-international-audience="yes" x-proceedings="yes">
        <title level="m">Very Large Data Bases Tutorial</title>
        <imprint>
          <dateStruct>
            <year>2011</year>
          </dateStruct>
        </imprint>
        <meeting id="cid303747">
          <title>International Conference on Very Large Data Bases</title>
          <num>37</num>
          <abbr type="sigle">VLDB</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="5214" id="smis-2011-bid23" type="misc" rend="year" n="cite:LB4">
      <monogr x-international-audience="no" x-proceedings="no">
        <title level="m">Serveurs portables et sécurisés de données personnelles : Application aux données médicales</title>
        <author>
          <persName key="smis-2006-idm390881513888">
            <foreName>L.</foreName>
            <surname>Bouganim</surname>
            <initial>L.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>June</month>
            <year>2011</year>
          </dateStruct>
        </imprint>
      </monogr>
      <note type="howpublished">Les Rencontres des Tuileries, INRIA Paris-Rocquencourt</note>
    </biblStruct>
    <biblStruct dedoublkey="5214" id="smis-2011-bid24" type="misc" rend="year" n="cite:LB3">
      <monogr x-international-audience="no" x-proceedings="no">
        <title level="m">Serveurs portables et sécurisés de données personnelles : Application aux données médicales</title>
        <author>
          <persName key="smis-2006-idm390881513888">
            <foreName>L.</foreName>
            <surname>Bouganim</surname>
            <initial>L.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>May</month>
            <year>2011</year>
          </dateStruct>
        </imprint>
      </monogr>
      <note type="howpublished">18 emes journées de la SFIM@R</note>
    </biblStruct>
    <biblStruct dedoublkey="5154" id="smis-2011-bid22" type="misc" rend="year" n="cite:BN3">
      <monogr x-international-audience="no" x-proceedings="no">
        <title level="m">Le droit à l’oubli sur Internet est-il possible ?</title>
        <author>
          <persName>
            <foreName>D.</foreName>
            <surname>Cardon</surname>
            <initial>D.</initial>
          </persName>
          <persName>
            <foreName>G.</foreName>
            <surname>Desgens-Pasanau</surname>
            <initial>G.</initial>
          </persName>
          <persName key="smis-2010-idm523361807232">
            <foreName>Benjamin</foreName>
            <surname>Nguyen</surname>
            <initial>B.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>February</month>
            <year>2011</year>
          </dateStruct>
        </imprint>
      </monogr>
      <note type="howpublished">Conférence débat au Café des techniques, Musée des arts et métiers, Paris</note>
    </biblStruct>
    <biblStruct id="smis-2011-bid3" type="inproceedings" rend="foot" n="footcite:AKS02">
      <analytic>
        <title level="a">Hippocratic Databases</title>
        <author>
          <persName>
            <foreName>R.</foreName>
            <surname>Agrawal</surname>
            <initial>R.</initial>
          </persName>
          <persName>
            <foreName>J.</foreName>
            <surname>Kiernan</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>R.</foreName>
            <surname>Srikant</surname>
            <initial>R.</initial>
          </persName>
          <persName key="clime-2006-idm142980323616">
            <foreName>Y.</foreName>
            <surname>Xu</surname>
            <initial>Y.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">Proc. of the Int. Conf. on Very Large Data Bases (VLDB)</title>
        <imprint>
          <dateStruct>
            <year>2002</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="smis-2011-bid10" type="inproceedings" rend="foot" n="footcite:ABB+01">
      <analytic>
        <title level="a">PicoDBMS : Validation and Experience</title>
        <author>
          <persName key="smis-2006-idm390881510208">
            <foreName>N.</foreName>
            <surname>Anciaux</surname>
            <initial>N.</initial>
          </persName>
          <persName>
            <foreName>C.</foreName>
            <surname>Bobineau</surname>
            <initial>C.</initial>
          </persName>
          <persName key="smis-2006-idm390881513888">
            <foreName>L.</foreName>
            <surname>Bouganim</surname>
            <initial>L.</initial>
          </persName>
          <persName key="smis-2006-idm390881517648">
            <foreName>Philippe</foreName>
            <surname>Pucheral</surname>
            <initial>P.</initial>
          </persName>
          <persName key="atlas-2006-idm26992091216">
            <foreName>P.</foreName>
            <surname>Valduriez</surname>
            <initial>P.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">Proc. of the Int. Conf. on Very Large Data Bases (VLDB)</title>
        <imprint>
          <dateStruct>
            <year>2001</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="smis-2011-bid17" type="inproceedings" rend="foot" n="footcite:10-16">
      <analytic>
        <title level="a">Pluggable personal data servers</title>
        <author>
          <persName key="smis-2006-idm390881510208">
            <foreName>N.</foreName>
            <surname>Anciaux</surname>
            <initial>N.</initial>
          </persName>
          <persName key="smis-2006-idm390881513888">
            <foreName>L.</foreName>
            <surname>Bouganim</surname>
            <initial>L.</initial>
          </persName>
          <persName key="smis-2009-idm306842376240">
            <foreName>Y.</foreName>
            <surname>Guo</surname>
            <initial>Y.</initial>
          </persName>
          <persName key="smis-2006-idm390881517648">
            <foreName>Philippe</foreName>
            <surname>Pucheral</surname>
            <initial>P.</initial>
          </persName>
          <persName>
            <foreName>J-J.</foreName>
            <surname>Vandewalle</surname>
            <initial>J.-J.</initial>
          </persName>
          <persName key="smis-2006-idm390881476752">
            <foreName>S.</foreName>
            <surname>Yin</surname>
            <initial>S.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">Proceedings of the 36th International Conference on the Management of Data (SIGMOD)</title>
        <imprint>
          <dateStruct>
            <year>2010</year>
          </dateStruct>
          <biblScope type="pages">1235-1238</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="smis-2011-bid13" type="misc" rend="foot" n="footcite:APP09">
      <monogr>
        <title level="m">Logiciel PlugDB-engine version 2, enregistré à l'Agence pour la Protection des Programmes (APP) sous le numéro IDDN.FR.001.280004.000.S.C.2008.0000.10000 en date du 27 avril
        2009</title>
        <author>
          <persName key="smis-2006-idm390881510208">
            <foreName>N.</foreName>
            <surname>Anciaux</surname>
            <initial>N.</initial>
          </persName>
          <persName key="smis-2006-idm390881513888">
            <foreName>L.</foreName>
            <surname>Bouganim</surname>
            <initial>L.</initial>
          </persName>
          <persName key="smis-2006-idm390881517648">
            <foreName>Philippe</foreName>
            <surname>Pucheral</surname>
            <initial>P.</initial>
          </persName>
          <persName key="smis-2006-idm390881476752">
            <foreName>S.</foreName>
            <surname>Yin</surname>
            <initial>S.</initial>
          </persName>
          <persName key="smis-2006-idm390881493984">
            <foreName>M.</foreName>
            <surname>Benzine</surname>
            <initial>M.</initial>
          </persName>
          <persName key="smis-2007-idm82415589408">
            <foreName>K.</foreName>
            <surname>Jacquemin</surname>
            <initial>K.</initial>
          </persName>
          <persName key="smis-2006-idm390881503232">
            <foreName>D.</foreName>
            <surname>Shasha</surname>
            <initial>D.</initial>
          </persName>
          <persName key="smis-2006-idm390881485360">
            <foreName>C.</foreName>
            <surname>Salperwyck</surname>
            <initial>C.</initial>
          </persName>
          <persName>
            <foreName>M. El</foreName>
            <surname>Kholy</surname>
            <initial>M. E.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>April</month>
            <year>2009</year>
          </dateStruct>
        </imprint>
      </monogr>
      <affiliation>
        <country>US</country>
      </affiliation>
    </biblStruct>
    <biblStruct id="smis-2011-bid6" type="inproceedings" rend="foot" n="footcite:Anderson04">
      <analytic>
        <title level="a">An introduction to the web services policy language (WSPL)</title>
        <author>
          <persName>
            <foreName>A.H.</foreName>
            <surname>Anderson</surname>
            <initial>A.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">IEEE Computer Society</title>
        <imprint>
          <dateStruct>
            <year>2004</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="smis-2011-bid15" type="misc" rend="foot" n="footcite:09-29">
      <monogr>
        <title level="m">Logiciel uFLIP version 2.1, enregistré à l'Agence pour la Protection des Programmes (APP) sous le numéro IDDN.FR.001.110020.000.S.P.2009.0000.10000 en date du 10 mars
        2009</title>
        <author>
          <persName key="smis-2006-idm390881513888">
            <foreName>L.</foreName>
            <surname>Bouganim</surname>
            <initial>L.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>March</month>
            <year>2009</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="smis-2011-bid7" type="inbook" rend="foot" n="footcite:09-27">
      <analytic>
        <author>
          <persName key="smis-2006-idm390881513888">
            <foreName>L.</foreName>
            <surname>Bouganim</surname>
            <initial>L.</initial>
          </persName>
          <persName key="smis-2009-idm306842376240">
            <foreName>Y.</foreName>
            <surname>Guo</surname>
            <initial>Y.</initial>
          </persName>
        </author>
        <title level="a">Database Encryption</title>
      </analytic>
      <monogr>
        <title level="m">Encyclopedia of Cryptography and Security</title>
        <editor role="editor">
          <persName>
            <foreName>S.</foreName>
            <surname>Jajodia</surname>
            <initial>S.</initial>
          </persName>
          <persName>
            <foreName>H.</foreName>
            <surname>van Tilborg</surname>
            <initial>H.</initial>
          </persName>
        </editor>
        <imprint>
          <publisher>
            <orgName>Springer</orgName>
          </publisher>
          <dateStruct>
            <year>2009</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="smis-2011-bid11" type="inproceedings" rend="foot" n="footcite:BoP02">
      <analytic>
        <title level="a">Chip-Secured Data Access : Confidential Data on Untrusted Servers</title>
        <author>
          <persName key="smis-2006-idm390881513888">
            <foreName>L.</foreName>
            <surname>Bouganim</surname>
            <initial>L.</initial>
          </persName>
          <persName key="smis-2006-idm390881517648">
            <foreName>Philippe</foreName>
            <surname>Pucheral</surname>
            <initial>P.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">Proc. of the 28th Int. Conf. on Very Large Data Bases (VLDB)</title>
        <imprint>
          <dateStruct>
            <year>2002</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="smis-2011-bid2" type="book" rend="foot" n="footcite:Cranor02">
      <monogr>
        <title level="m">Web Privacy with P3P</title>
        <author>
          <persName>
            <foreName>L.F.</foreName>
            <surname>Cranor</surname>
            <initial>L.</initial>
          </persName>
        </author>
        <imprint>
          <publisher>
            <orgName>O'Reilly Media</orgName>
          </publisher>
          <dateStruct>
            <year>2002</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="smis-2011-bid8" type="article" rend="foot" n="footcite:Fung10">
      <analytic>
        <title level="a">Privacy-preserving data publishing: A survey of recent developments</title>
        <author>
          <persName>
            <foreName>B.</foreName>
            <surname>Fung</surname>
            <initial>B.</initial>
          </persName>
          <persName key="rccm-2008-idm328620229120">
            <foreName>K.</foreName>
            <surname>Wang</surname>
            <initial>K.</initial>
          </persName>
          <persName>
            <foreName>R.</foreName>
            <surname>Chen</surname>
            <initial>R.</initial>
          </persName>
          <persName>
            <foreName>P.S.</foreName>
            <surname>Yu</surname>
            <initial>P.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">ACM Computing Surveys (CSUR)</title>
        <imprint>
          <biblScope type="volume">42</biblScope>
          <biblScope type="number">4</biblScope>
          <dateStruct>
            <year>2010</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="smis-2011-bid5" type="inproceedings" rend="foot" n="footcite:Moses05">
      <analytic>
        <title level="a">Extensible access control markup language (XACML) version 2.0</title>
        <author>
          <persName>
            <foreName>T.</foreName>
            <surname>Moses</surname>
            <initial>T.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">Oasis Standard 200502</title>
        <imprint>
          <dateStruct>
            <year>2005</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="smis-2011-bid14" type="misc" rend="foot" n="footcite:07-22">
      <monogr>
        <title level="m">System and Method of Managing Indexation of Flash Memory</title>
        <author>
          <persName key="smis-2006-idm390881517648">
            <foreName>Philippe</foreName>
            <surname>Pucheral</surname>
            <initial>P.</initial>
          </persName>
          <persName key="smis-2006-idm390881476752">
            <foreName>S.</foreName>
            <surname>Yin</surname>
            <initial>S.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>May</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
      <note type="bnote">Dépôt par Gemalto et INRIA du brevet européen nr 07290567.2</note>
    </biblStruct>
    <biblStruct id="smis-2011-bid4" type="inproceedings" rend="foot" n="footcite:Schunter03">
      <analytic>
        <title level="a">Enterprise privacy authorization language (EPAL 1.1)</title>
        <author>
          <persName>
            <foreName>M.</foreName>
            <surname>Schunter</surname>
            <initial>M.</initial>
          </persName>
          <persName>
            <foreName>C.</foreName>
            <surname>Powers</surname>
            <initial>C.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">IBM</title>
        <imprint>
          <dateStruct>
            <year>2003</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct id="smis-2011-bid16" type="inproceedings" rend="foot" n="footcite:09-19">
      <analytic>
        <title level="a">A Sequential Indexing Scheme for Flash-Based Embedded Systems</title>
        <author>
          <persName key="smis-2006-idm390881476752">
            <foreName>S.</foreName>
            <surname>Yin</surname>
            <initial>S.</initial>
          </persName>
          <persName key="smis-2006-idm390881517648">
            <foreName>Philippe</foreName>
            <surname>Pucheral</surname>
            <initial>P.</initial>
          </persName>
          <persName>
            <foreName>X.</foreName>
            <surname>Meng</surname>
            <initial>X.</initial>
          </persName>
        </author>
      </analytic>
      <monogr x-international-audience="yes" x-proceedings="yes">
        <title level="m">Proceedings of the 12th International Conference on Extending Data Base Technology (EDBT)</title>
        <loc>Saint-Petersburg, Russia</loc>
        <imprint>
          <dateStruct>
            <month>March</month>
            <year>2009</year>
          </dateStruct>
          <biblScope type="pages">588-599</biblScope>
        </imprint>
      </monogr>
      <affiliation>
        <country>CN</country>
      </affiliation>
    </biblStruct>
  </biblio>
</raweb>
