Computationally Sound Implementations of Equational Theories Against Passive Adversaries
Identifieur interne : 006280 ( Main/Curation ); précédent : 006279; suivant : 006281Computationally Sound Implementations of Equational Theories Against Passive Adversaries
Auteurs : Mathieu Baudet [France] ; Véronique Cortier [France] ; Steve Kremer [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Cryptographie.
English descriptors
- KwdEn :
Abstract
Abstract: In this paper we study the link between formal and cryptographic models for security protocols in the presence of a passive adversary. In contrast to other works, we do not consider a fixed set of primitives but aim at results for an arbitrary equational theory. We define a framework for comparing a cryptographic implementation and its idealization w.r.t. various security notions. In particular, we concentrate on the computational soundness of static equivalence, a standard tool in cryptographic pi calculi. We present a soundness criterion, which for many theories is not only sufficient but also necessary. Finally, we establish new soundness results for the exclusive OR and a theory of ciphers and lists.
Url:
DOI: 10.1007/11523468_53
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :002144
- to stream Istex, to step Curation: Pour aller vers cette notice dans l'étape Curation :002116
- to stream Istex, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :001594
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :006505
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000545
- to stream PascalFrancis, to step Curation: Pour aller vers cette notice dans l'étape Curation :000493
- to stream PascalFrancis, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :000508
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :006645
Links to Exploration step
ISTEX:8FA9AAF36F1E6E7F2E162AD416A8D9E7B6C09B51Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Computationally Sound Implementations of Equational Theories Against Passive Adversaries</title>
<author><name sortKey="Baudet, Mathieu" sort="Baudet, Mathieu" uniqKey="Baudet M" first="Mathieu" last="Baudet">Mathieu Baudet</name>
</author>
<author><name sortKey="Cortier, Veronique" sort="Cortier, Veronique" uniqKey="Cortier V" first="Véronique" last="Cortier">Véronique Cortier</name>
</author>
<author><name sortKey="Kremer, Steve" sort="Kremer, Steve" uniqKey="Kremer S" first="Steve" last="Kremer">Steve Kremer</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:8FA9AAF36F1E6E7F2E162AD416A8D9E7B6C09B51</idno>
<date when="2005" year="2005">2005</date>
<idno type="doi">10.1007/11523468_53</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-8R40M8QJ-0/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">002144</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002144</idno>
<idno type="wicri:Area/Istex/Curation">002116</idno>
<idno type="wicri:Area/Istex/Checkpoint">001594</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001594</idno>
<idno type="wicri:doubleKey">0302-9743:2005:Baudet M:computationally:sound:implementations</idno>
<idno type="wicri:Area/Main/Merge">006505</idno>
<idno type="wicri:source">INIST</idno>
<idno type="RBID">Pascal:05-0338042</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000545</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000493</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000508</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000508</idno>
<idno type="wicri:doubleKey">0302-9743:2005:Baudet M:computationally:sound:implementations</idno>
<idno type="wicri:Area/Main/Merge">006645</idno>
<idno type="wicri:Area/Main/Curation">006280</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Computationally Sound Implementations of Equational Theories Against Passive Adversaries</title>
<author><name sortKey="Baudet, Mathieu" sort="Baudet, Mathieu" uniqKey="Baudet M" first="Mathieu" last="Baudet">Mathieu Baudet</name>
<affiliation wicri:level="1"><country xml:lang="fr">France</country>
<wicri:regionArea>LSV, CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS Cachan</wicri:regionArea>
<wicri:noRegion>CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS Cachan</wicri:noRegion>
<wicri:noRegion>CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS Cachan</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Cortier, Veronique" sort="Cortier, Veronique" uniqKey="Cortier V" first="Véronique" last="Cortier">Véronique Cortier</name>
<affiliation wicri:level="1"><country xml:lang="fr">France</country>
<wicri:regionArea>Loria, CNRS UMR 7503 & INRIA Lorraine projet Cassis</wicri:regionArea>
<wicri:noRegion>CNRS UMR 7503 & INRIA Lorraine projet Cassis</wicri:noRegion>
<wicri:noRegion>CNRS UMR 7503 & INRIA Lorraine projet Cassis</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Kremer, Steve" sort="Kremer, Steve" uniqKey="Kremer S" first="Steve" last="Kremer">Steve Kremer</name>
<affiliation wicri:level="1"><country xml:lang="fr">France</country>
<wicri:regionArea>LSV, CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS Cachan</wicri:regionArea>
<wicri:noRegion>CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS Cachan</wicri:noRegion>
<wicri:noRegion>CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS Cachan</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Automaton</term>
<term>Cryptography</term>
<term>Equational theory</term>
<term>Formal specification</term>
<term>List processing</term>
<term>Safety</term>
<term>Transmission protocol</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Automate</term>
<term>Cryptographie</term>
<term>Protocole transmission</term>
<term>Spécification formelle</term>
<term>Sécurité</term>
<term>Théorie équationnelle</term>
<term>Traitement liste</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Cryptographie</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: In this paper we study the link between formal and cryptographic models for security protocols in the presence of a passive adversary. In contrast to other works, we do not consider a fixed set of primitives but aim at results for an arbitrary equational theory. We define a framework for comparing a cryptographic implementation and its idealization w.r.t. various security notions. In particular, we concentrate on the computational soundness of static equivalence, a standard tool in cryptographic pi calculi. We present a soundness criterion, which for many theories is not only sufficient but also necessary. Finally, we establish new soundness results for the exclusive OR and a theory of ciphers and lists.</div>
</front>
</TEI>
<double idat="0302-9743:2005:Baudet M:computationally:sound:implementations"><INIST><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Computationally sound implementations of equational theories against passive adversaries</title>
<author><name sortKey="Baudet, Mathieu" sort="Baudet, Mathieu" uniqKey="Baudet M" first="Mathieu" last="Baudet">Mathieu Baudet</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LSV/ CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS</s1>
<s2>Cachan</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>Cachan</wicri:noRegion>
<wicri:noRegion>LSV/ CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS</wicri:noRegion>
<wicri:noRegion>LSV/ CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Cortier, Veronique" sort="Cortier, Veronique" uniqKey="Cortier V" first="Véronique" last="Cortier">Véronique Cortier</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Loria/CNRS UMR 7503 & INRIA Lorraine projet</s1>
<s2>Cassis</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>Cassis</wicri:noRegion>
<wicri:noRegion>Loria/CNRS UMR 7503 & INRIA Lorraine projet</wicri:noRegion>
<wicri:noRegion>Loria/CNRS UMR 7503 & INRIA Lorraine projet</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Kremer, Steve" sort="Kremer, Steve" uniqKey="Kremer S" first="Steve" last="Kremer">Steve Kremer</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LSV/ CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS</s1>
<s2>Cachan</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>Cachan</wicri:noRegion>
<wicri:noRegion>LSV/ CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS</wicri:noRegion>
<wicri:noRegion>LSV/ CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS</wicri:noRegion>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">05-0338042</idno>
<date when="2005">2005</date>
<idno type="stanalyst">PASCAL 05-0338042 INIST</idno>
<idno type="RBID">Pascal:05-0338042</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000545</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000493</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000508</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000508</idno>
<idno type="wicri:doubleKey">0302-9743:2005:Baudet M:computationally:sound:implementations</idno>
<idno type="wicri:Area/Main/Merge">006645</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Computationally sound implementations of equational theories against passive adversaries</title>
<author><name sortKey="Baudet, Mathieu" sort="Baudet, Mathieu" uniqKey="Baudet M" first="Mathieu" last="Baudet">Mathieu Baudet</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LSV/ CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS</s1>
<s2>Cachan</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>Cachan</wicri:noRegion>
<wicri:noRegion>LSV/ CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS</wicri:noRegion>
<wicri:noRegion>LSV/ CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Cortier, Veronique" sort="Cortier, Veronique" uniqKey="Cortier V" first="Véronique" last="Cortier">Véronique Cortier</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Loria/CNRS UMR 7503 & INRIA Lorraine projet</s1>
<s2>Cassis</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>Cassis</wicri:noRegion>
<wicri:noRegion>Loria/CNRS UMR 7503 & INRIA Lorraine projet</wicri:noRegion>
<wicri:noRegion>Loria/CNRS UMR 7503 & INRIA Lorraine projet</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Kremer, Steve" sort="Kremer, Steve" uniqKey="Kremer S" first="Steve" last="Kremer">Steve Kremer</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LSV/ CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS</s1>
<s2>Cachan</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>Cachan</wicri:noRegion>
<wicri:noRegion>LSV/ CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS</wicri:noRegion>
<wicri:noRegion>LSV/ CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS</wicri:noRegion>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2005">2005</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Automaton</term>
<term>Cryptography</term>
<term>Equational theory</term>
<term>Formal specification</term>
<term>List processing</term>
<term>Safety</term>
<term>Transmission protocol</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Théorie équationnelle</term>
<term>Spécification formelle</term>
<term>Protocole transmission</term>
<term>Cryptographie</term>
<term>Sécurité</term>
<term>Traitement liste</term>
<term>Automate</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Cryptographie</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">In this paper we study the link between formal and cryptographic models for security protocols in the presence of a passive adversary. In contrast to other works, we do not consider a fixed set of primitives but aim at results for an arbitrary equational theory. We define a framework for comparing a cryptographic implementation and its idealization w.r.t. various security notions. In particular, we concentrate on the computational soundness of static equivalence, a standard tool in cryptographic pi calculi. We present a soundness criterion, which for many theories is not only sufficient but also necessary. Finally, we establish new soundness results for the exclusive OR and a theory of ciphers and lists.</div>
</front>
</TEI>
</INIST>
<ISTEX><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Computationally Sound Implementations of Equational Theories Against Passive Adversaries</title>
<author><name sortKey="Baudet, Mathieu" sort="Baudet, Mathieu" uniqKey="Baudet M" first="Mathieu" last="Baudet">Mathieu Baudet</name>
</author>
<author><name sortKey="Cortier, Veronique" sort="Cortier, Veronique" uniqKey="Cortier V" first="Véronique" last="Cortier">Véronique Cortier</name>
</author>
<author><name sortKey="Kremer, Steve" sort="Kremer, Steve" uniqKey="Kremer S" first="Steve" last="Kremer">Steve Kremer</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:8FA9AAF36F1E6E7F2E162AD416A8D9E7B6C09B51</idno>
<date when="2005" year="2005">2005</date>
<idno type="doi">10.1007/11523468_53</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-8R40M8QJ-0/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">002144</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002144</idno>
<idno type="wicri:Area/Istex/Curation">002116</idno>
<idno type="wicri:Area/Istex/Checkpoint">001594</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001594</idno>
<idno type="wicri:doubleKey">0302-9743:2005:Baudet M:computationally:sound:implementations</idno>
<idno type="wicri:Area/Main/Merge">006505</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Computationally Sound Implementations of Equational Theories Against Passive Adversaries</title>
<author><name sortKey="Baudet, Mathieu" sort="Baudet, Mathieu" uniqKey="Baudet M" first="Mathieu" last="Baudet">Mathieu Baudet</name>
<affiliation wicri:level="1"><country xml:lang="fr">France</country>
<wicri:regionArea>LSV, CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS Cachan</wicri:regionArea>
<wicri:noRegion>CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS Cachan</wicri:noRegion>
<wicri:noRegion>CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS Cachan</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Cortier, Veronique" sort="Cortier, Veronique" uniqKey="Cortier V" first="Véronique" last="Cortier">Véronique Cortier</name>
<affiliation wicri:level="1"><country xml:lang="fr">France</country>
<wicri:regionArea>Loria, CNRS UMR 7503 & INRIA Lorraine projet Cassis</wicri:regionArea>
<wicri:noRegion>CNRS UMR 7503 & INRIA Lorraine projet Cassis</wicri:noRegion>
<wicri:noRegion>CNRS UMR 7503 & INRIA Lorraine projet Cassis</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Kremer, Steve" sort="Kremer, Steve" uniqKey="Kremer S" first="Steve" last="Kremer">Steve Kremer</name>
<affiliation wicri:level="1"><country xml:lang="fr">France</country>
<wicri:regionArea>LSV, CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS Cachan</wicri:regionArea>
<wicri:noRegion>CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS Cachan</wicri:noRegion>
<wicri:noRegion>CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS Cachan</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: In this paper we study the link between formal and cryptographic models for security protocols in the presence of a passive adversary. In contrast to other works, we do not consider a fixed set of primitives but aim at results for an arbitrary equational theory. We define a framework for comparing a cryptographic implementation and its idealization w.r.t. various security notions. In particular, we concentrate on the computational soundness of static equivalence, a standard tool in cryptographic pi calculi. We present a soundness criterion, which for many theories is not only sufficient but also necessary. Finally, we establish new soundness results for the exclusive OR and a theory of ciphers and lists.</div>
</front>
</TEI>
</ISTEX>
</double>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006280 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 006280 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Curation |type= RBID |clé= ISTEX:8FA9AAF36F1E6E7F2E162AD416A8D9E7B6C09B51 |texte= Computationally Sound Implementations of Equational Theories Against Passive Adversaries }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |