Computationally Sound Implementations of Equational Theories Against Passive Adversaries
Identifieur interne : 001594 ( Istex/Checkpoint ); précédent : 001593; suivant : 001595Computationally 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 ]
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
Affiliations:
Links toward previous steps (curation, corpus...)
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></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><affiliations><list><country><li>France</li></country></list><tree><country name="France"><noRegion><name sortKey="Baudet, Mathieu" sort="Baudet, Mathieu" uniqKey="Baudet M" first="Mathieu" last="Baudet">Mathieu Baudet</name></noRegion><name sortKey="Baudet, Mathieu" sort="Baudet, Mathieu" uniqKey="Baudet M" first="Mathieu" last="Baudet">Mathieu Baudet</name><name sortKey="Cortier, Veronique" sort="Cortier, Veronique" uniqKey="Cortier V" first="Véronique" last="Cortier">Véronique Cortier</name><name sortKey="Cortier, Veronique" sort="Cortier, Veronique" uniqKey="Cortier V" first="Véronique" last="Cortier">Véronique Cortier</name><name sortKey="Kremer, Steve" sort="Kremer, Steve" uniqKey="Kremer S" first="Steve" last="Kremer">Steve Kremer</name><name sortKey="Kremer, Steve" sort="Kremer, Steve" uniqKey="Kremer S" first="Steve" last="Kremer">Steve Kremer</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001594 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd -nk 001594 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Checkpoint
|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. |  |