InforLorV4, Main, Exploration, bibRecord, 005472

Guessing Attacks and the Computational Soundness of Static Equivalence

Identifieur interne : 005472 ( Main/Exploration ); précédent : 005471; suivant : 005473

Guessing Attacks and the Computational Soundness of Static Equivalence

Auteurs : Martín Abadi ; Mathieu Baudet [France] ; Bogdan Warinschi [France]

Source :

Lecture Notes in Computer Science [ 0302-9743 ]

RBID : ISTEX:684237048199B8B50B6EEB1CACCC774E003DA100

Descripteurs français

Pascal (Inist)
- Attaque informatique, Cryptographie, Développement logiciel, Relation équivalence, Sécurité, Théorie équationnelle.
Wicri :
- topic : Cryptographie.

English descriptors

KwdEn :
- Computer attack, Cryptography, Equational theory, Equivalence relation, Safety, Software development.

Abstract

Abstract: The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence depends on an underlying equational theory. The choice of an inappropriate equational theory can lead to overly pessimistic or overly optimistic notions of indistinguishability, and in turn to security criteria that require protection against impossible attacks or—worse yet—that ignore feasible ones. In this paper, we define and justify an equational theory for standard, fundamental cryptographic operations. This equational theory yields a notion of static equivalence that implies computational indistinguishability. Static equivalence remains liberal enough for use in applications. In particular, we develop and analyze a principled formal account of guessing attacks in terms of static equivalence.

Url:

https://api.istex.fr/ark:/67375/HCB-31STGVSS-0/fulltext.pdf

DOI: 10.1007/11690634_27

Affiliations:

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Guessing Attacks and the Computational Soundness of Static Equivalence</title>
<author><name sortKey="Abadi, Martin" sort="Abadi, Martin" uniqKey="Abadi M" first="Martín" last="Abadi">Martín Abadi</name>
</author>
<author><name sortKey="Baudet, Mathieu" sort="Baudet, Mathieu" uniqKey="Baudet M" first="Mathieu" last="Baudet">Mathieu Baudet</name>
</author>
<author><name sortKey="Warinschi, Bogdan" sort="Warinschi, Bogdan" uniqKey="Warinschi B" first="Bogdan" last="Warinschi">Bogdan Warinschi</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:684237048199B8B50B6EEB1CACCC774E003DA100</idno>
<date when="2006" year="2006">2006</date>
<idno type="doi">10.1007/11690634_27</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-31STGVSS-0/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001829</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001829</idno>
<idno type="wicri:Area/Istex/Curation">001810</idno>
<idno type="wicri:Area/Istex/Checkpoint">001325</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001325</idno>
<idno type="wicri:doubleKey">0302-9743:2006:Abadi M:guessing:attacks:and</idno>
<idno type="wicri:Area/Main/Merge">005618</idno>
<idno type="wicri:source">INIST</idno>
<idno type="RBID">Pascal:07-0534059</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000379</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000654</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000379</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000379</idno>
<idno type="wicri:doubleKey">0302-9743:2006:Abadi M:guessing:attacks:and</idno>
<idno type="wicri:Area/Main/Merge">005784</idno>
<idno type="wicri:Area/Main/Curation">005472</idno>
<idno type="wicri:Area/Main/Exploration">005472</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Guessing Attacks and the Computational Soundness of Static Equivalence</title>
<author><name sortKey="Abadi, Martin" sort="Abadi, Martin" uniqKey="Abadi M" first="Martín" last="Abadi">Martín Abadi</name>
<affiliation><wicri:noCountry code="subField">Cruz</wicri:noCountry>
</affiliation>
</author>
<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 & INRIA Futurs projet SECSI & ENS, Cachan</wicri:regionArea>
<wicri:noRegion>Cachan</wicri:noRegion>
<wicri:noRegion>Cachan</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Warinschi, Bogdan" sort="Warinschi, Bogdan" uniqKey="Warinschi B" first="Bogdan" last="Warinschi">Bogdan Warinschi</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>Loria, INRIA, Nancy</wicri:regionArea>
<placeName><region type="region">Grand Est</region>
<region type="old region">Lorraine (région)</region>
<settlement type="city">Nancy</settlement>
</placeName>
</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>Computer attack</term>
<term>Cryptography</term>
<term>Equational theory</term>
<term>Equivalence relation</term>
<term>Safety</term>
<term>Software development</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Attaque informatique</term>
<term>Cryptographie</term>
<term>Développement logiciel</term>
<term>Relation équivalence</term>
<term>Sécurité</term>
<term>Théorie équationnelle</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: The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence depends on an underlying equational theory. The choice of an inappropriate equational theory can lead to overly pessimistic or overly optimistic notions of indistinguishability, and in turn to security criteria that require protection against impossible attacks or—worse yet—that ignore feasible ones. In this paper, we define and justify an equational theory for standard, fundamental cryptographic operations. This equational theory yields a notion of static equivalence that implies computational indistinguishability. Static equivalence remains liberal enough for use in applications. In particular, we develop and analyze a principled formal account of guessing attacks in terms of static equivalence.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
</country>
<region><li>Grand Est</li>
<li>Lorraine (région)</li>
</region>
<settlement><li>Nancy</li>
</settlement>
</list>
<tree><noCountry><name sortKey="Abadi, Martin" sort="Abadi, Martin" uniqKey="Abadi M" first="Martín" last="Abadi">Martín Abadi</name>
</noCountry>
<country name="France"><noRegion><name sortKey="Baudet, Mathieu" sort="Baudet, Mathieu" uniqKey="Baudet M" first="Mathieu" last="Baudet">Mathieu Baudet</name>
</noRegion>
<name sortKey="Warinschi, Bogdan" sort="Warinschi, Bogdan" uniqKey="Warinschi B" first="Bogdan" last="Warinschi">Bogdan Warinschi</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 005472 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 005472 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:684237048199B8B50B6EEB1CACCC774E003DA100
   |texte=   Guessing Attacks and the Computational Soundness of Static Equivalence
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

Serveur d'exploration sur la recherche en informatique en Lorraine

Guessing Attacks and the Computational Soundness of Static Equivalence

Guessing Attacks and the Computational Soundness of Static Equivalence

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.