<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-24T01:45:27Z</responseDate>
  <request identifier="2316" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2316</identifier>
        <datestamp>2024-03-06T10:33:17Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Simulation based security in the applied pi calculus</dc:title>
          <dc:creator>Delaune, Stéphanie</dc:creator>
          <dc:creator>Kremer, Steve</dc:creator>
          <dc:creator>Pereira, Olivier</dc:creator>
          <dc:subject>Simulation based security</dc:subject>
          <dc:subject>applied pi calculus</dc:subject>
          <dc:subject>joint state theorem</dc:subject>
          <dc:subject>authentication protocols</dc:subject>
          <dc:description>We present a symbolic framework for refinement and composition of&#13;
  security protocols. The framework uses the notion of ideal&#13;
  functionalities. These are abstract systems which are secure by&#13;
  construction and which can be combined into larger systems. They can&#13;
  be separately refined in order to obtain concrete protocols&#13;
  implementing them.  Our work builds on ideas from the ``trusted&#13;
  party paradigm'' used in computational cryptography models. The&#13;
  underlying language we use is the applied pi calculus which is a&#13;
  general language for specifying security protocols. In our framework&#13;
  we can express the different standard flavours of simulation-based&#13;
  security which happen to all coincide.  We illustrate our framework&#13;
  on an authentication functionality which can be realized using the&#13;
  Needham-Schroeder-Lowe protocol.  For this we need to define an&#13;
  ideal functionality for asymmetric encryption and its&#13;
  realization. We show a joint state result for this&#13;
  functionality which allows composition (even though the same key&#13;
  material is reused) using a tagging mechanism.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Stéphanie Delaune and Steve Kremer and Olivier Pereira</dc:contributor>
          <dc:date>2009</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 4, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.FSTTCS.2009.2316</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-23163</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2316</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
