<?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-08-14T15:21:08Z</responseDate>
  <request identifier="1415" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:1415</identifier>
        <datestamp>2024-03-06T11:07:45Z</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>Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol</dc:title>
          <dc:creator>Backes, Michael</dc:creator>
          <dc:creator>Maffei, Matteo</dc:creator>
          <dc:creator>Unruh, Dominique</dc:creator>
          <dc:subject>Language-based security</dc:subject>
          <dc:subject>zero-knowledge proofs</dc:subject>
          <dc:subject>applied pi-calculus</dc:subject>
          <dc:subject>direct anonymous attestation</dc:subject>
          <dc:description>We devise an abstraction of zero-knowledge protocols that is&#13;
accessible to a fully mechanized analysis. The abstraction is&#13;
formalized within the applied pi-calculus using a novel equational&#13;
theory that abstractly characterizes the cryptographic semantics of&#13;
zero-knowledge proofs. We present an encoding from the equational&#13;
theory into a convergent rewriting system that is suitable for the&#13;
automated protocol verifier ProVerif. The encoding is sound and fully&#13;
automated. We successfully used ProVerif to obtain the first&#13;
mechanized analysis of the Direct Anonymous Attestation (DAA)&#13;
protocol. The analysis in particular required us to devise novel&#13;
abstractions of sophisticated cryptographic security definitions based&#13;
on interactive games.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Michael Backes and Matteo Maffei and Dominique Unruh</dc:contributor>
          <dc:date>2008</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 7421, Formal Protocol Verification Applied (2008)</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/DagSemProc.07421.4</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-14153</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07421.4</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
