InforLorV4, PascalFrancis, Checkpoint, bibRecord, 000401

Computationally sound symbolic secrecy in the presence of hash functions

Identifieur interne : 000401 ( PascalFrancis/Checkpoint ); précédent : 000400; suivant : 000402

Computationally sound symbolic secrecy in the presence of hash functions

Auteurs : Véronique Cortier [France] ; Steve Kremer [France] ; Ralf Kusters [Suisse] ; Bogdan Warinschi [France]

Source :

Lecture notes in computer science [ 0302-9743 ] ; 2006.

RBID : Pascal:07-0531787

Descripteurs français

Pascal (Inist)
- Informatique théorique, Hachage, Cryptographie, Protocole transmission, Sécurité, Décidabilité, Prise décision, Cryptage, Secret, Clé publique, Oracle, Fonction aléatoire, Modélisation.
Wicri :
- topic : Cryptographie.

English descriptors

KwdEn :
- Computer theory, Cryptography, Decidability, Decision making, Encryption, Hashing, Modeling, Oracle, Public key, Random function, Safety, Secrecy, Transmission protocol.

Abstract

The standard symbolic, deducibility-based notions of secrecy are in general insufficient from a cryptographic point of view, especially in presence of hash functions. In this paper we devise and motivate a more appropriate secrecy criterion which exactly captures a standard cryptographic notion of secrecy for protocols involving public-key enryption and hash functions: protocols that satisfy it are computationally secure while any violation of our criterion directly leads to an attack. Furthermore, we prove that our criterion is decidable via an NP decision procedure. Our results hold for standard security notions for encryption and hash functions modeled as random oracles.

Affiliations:

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

to stream PascalFrancis, to step Corpus: 000382
to stream PascalFrancis, to step Curation: 000651

Links to Exploration step

Pascal:07-0531787

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Computationally sound symbolic secrecy in the presence of hash functions</title>
<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="01"><s1>Loria, CNRS & INRIA project Cassis</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>CNRS & INRIA project Cassis</wicri:noRegion>
<wicri:noRegion>Loria, CNRS & INRIA project Cassis</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="02"><s1>LSV, CNRS & ENS Cachan & INRIA project Secsi</s1>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>CNRS & ENS Cachan & INRIA project Secsi</wicri:noRegion>
<wicri:noRegion>LSV, CNRS & ENS Cachan & INRIA project Secsi</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Kusters, Ralf" sort="Kusters, Ralf" uniqKey="Kusters R" first="Ralf" last="Kusters">Ralf Kusters</name>
<affiliation wicri:level="4"><inist:fA14 i1="03"><s1>ETH Zurich</s1>
<s3>CHE</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>Suisse</country>
<placeName><settlement type="city">Zurich</settlement>
<region nuts="3" type="region">Canton de Zurich</region>
</placeName>
<orgName type="university">École polytechnique fédérale de Zurich</orgName>
</affiliation>
</author>
<author><name sortKey="Warinschi, Bogdan" sort="Warinschi, Bogdan" uniqKey="Warinschi B" first="Bogdan" last="Warinschi">Bogdan Warinschi</name>
<affiliation wicri:level="1"><inist:fA14 i1="04"><s1>Loria, Univerité Henri Poincaré & INRIA project Cassis</s1>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>Univerité Henri Poincaré & INRIA project Cassis</wicri:noRegion>
<wicri:noRegion>Loria, Univerité Henri Poincaré & INRIA project Cassis</wicri:noRegion>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">07-0531787</idno>
<date when="2006">2006</date>
<idno type="stanalyst">PASCAL 07-0531787 INIST</idno>
<idno type="RBID">Pascal:07-0531787</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000382</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000651</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000401</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000401</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Computationally sound symbolic secrecy in the presence of hash functions</title>
<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="01"><s1>Loria, CNRS & INRIA project Cassis</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>CNRS & INRIA project Cassis</wicri:noRegion>
<wicri:noRegion>Loria, CNRS & INRIA project Cassis</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="02"><s1>LSV, CNRS & ENS Cachan & INRIA project Secsi</s1>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>CNRS & ENS Cachan & INRIA project Secsi</wicri:noRegion>
<wicri:noRegion>LSV, CNRS & ENS Cachan & INRIA project Secsi</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Kusters, Ralf" sort="Kusters, Ralf" uniqKey="Kusters R" first="Ralf" last="Kusters">Ralf Kusters</name>
<affiliation wicri:level="4"><inist:fA14 i1="03"><s1>ETH Zurich</s1>
<s3>CHE</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>Suisse</country>
<placeName><settlement type="city">Zurich</settlement>
<region nuts="3" type="region">Canton de Zurich</region>
</placeName>
<orgName type="university">École polytechnique fédérale de Zurich</orgName>
</affiliation>
</author>
<author><name sortKey="Warinschi, Bogdan" sort="Warinschi, Bogdan" uniqKey="Warinschi B" first="Bogdan" last="Warinschi">Bogdan Warinschi</name>
<affiliation wicri:level="1"><inist:fA14 i1="04"><s1>Loria, Univerité Henri Poincaré & INRIA project Cassis</s1>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>Univerité Henri Poincaré & INRIA project Cassis</wicri:noRegion>
<wicri:noRegion>Loria, Univerité Henri Poincaré & INRIA project Cassis</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="2006">2006</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>Computer theory</term>
<term>Cryptography</term>
<term>Decidability</term>
<term>Decision making</term>
<term>Encryption</term>
<term>Hashing</term>
<term>Modeling</term>
<term>Oracle</term>
<term>Public key</term>
<term>Random function</term>
<term>Safety</term>
<term>Secrecy</term>
<term>Transmission protocol</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Informatique théorique</term>
<term>Hachage</term>
<term>Cryptographie</term>
<term>Protocole transmission</term>
<term>Sécurité</term>
<term>Décidabilité</term>
<term>Prise décision</term>
<term>Cryptage</term>
<term>Secret</term>
<term>Clé publique</term>
<term>Oracle</term>
<term>Fonction aléatoire</term>
<term>Modélisation</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Cryptographie</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">The standard symbolic, deducibility-based notions of secrecy are in general insufficient from a cryptographic point of view, especially in presence of hash functions. In this paper we devise and motivate a more appropriate secrecy criterion which exactly captures a standard cryptographic notion of secrecy for protocols involving public-key enryption and hash functions: protocols that satisfy it are computationally secure while any violation of our criterion directly leads to an attack. Furthermore, we prove that our criterion is decidable via an NP decision procedure. Our results hold for standard security notions for encryption and hash functions modeled as random oracles.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>4337</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Computationally sound symbolic secrecy in the presence of hash functions</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>FSTTCS 2006 : foundations of software technology and theoretical computer science : 26th International conference, Kolkata, India, December 13-15, 2006 : proceedings</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>CORTIER (Véronique)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>KREMER (Steve)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>KUSTERS (Ralf)</s1>
</fA11>
<fA11 i1="04" i2="1"><s1>WARINSCHI (Bogdan)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>ARUN-KUMAR (S.)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>GARG (Naveen)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Loria, CNRS & INRIA project Cassis</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>LSV, CNRS & ENS Cachan & INRIA project Secsi</s1>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>ETH Zurich</s1>
<s3>CHE</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA14 i1="04"><s1>Loria, Univerité Henri Poincaré & INRIA project Cassis</s1>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
</fA14>
<fA20><s1>176-187</s1>
</fA20>
<fA21><s1>2006</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-49994-6</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000172801410180</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2007 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>16 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>07-0531787</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>The standard symbolic, deducibility-based notions of secrecy are in general insufficient from a cryptographic point of view, especially in presence of hash functions. In this paper we devise and motivate a more appropriate secrecy criterion which exactly captures a standard cryptographic notion of secrecy for protocols involving public-key enryption and hash functions: protocols that satisfy it are computationally secure while any violation of our criterion directly leads to an attack. Furthermore, we prove that our criterion is decidable via an NP decision procedure. Our results hold for standard security notions for encryption and hash functions modeled as random oracles.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02B07C</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02A05</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Informatique théorique</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Computer theory</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Informática teórica</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Hachage</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Hashing</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Hashing</s0>
<s5>06</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Cryptographie</s0>
<s5>07</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Cryptography</s0>
<s5>07</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Criptografía</s0>
<s5>07</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Protocole transmission</s0>
<s5>08</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Transmission protocol</s0>
<s5>08</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Protocolo transmisión</s0>
<s5>08</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Sécurité</s0>
<s5>09</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Safety</s0>
<s5>09</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Seguridad</s0>
<s5>09</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Décidabilité</s0>
<s5>10</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Decidability</s0>
<s5>10</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Decidibilidad</s0>
<s5>10</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Prise décision</s0>
<s5>11</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Decision making</s0>
<s5>11</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Toma decision</s0>
<s5>11</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Cryptage</s0>
<s5>12</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Encryption</s0>
<s5>12</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Cifrado</s0>
<s5>12</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Secret</s0>
<s5>18</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Secrecy</s0>
<s5>18</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Secreto</s0>
<s5>18</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Clé publique</s0>
<s5>19</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Public key</s0>
<s5>19</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Llave pública</s0>
<s5>19</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Oracle</s0>
<s5>20</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG"><s0>Oracle</s0>
<s5>20</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE"><s0>Fonction aléatoire</s0>
<s5>23</s5>
</fC03>
<fC03 i1="12" i2="X" l="ENG"><s0>Random function</s0>
<s5>23</s5>
</fC03>
<fC03 i1="12" i2="X" l="SPA"><s0>Función aleatoria</s0>
<s5>23</s5>
</fC03>
<fC03 i1="13" i2="X" l="FRE"><s0>Modélisation</s0>
<s5>24</s5>
</fC03>
<fC03 i1="13" i2="X" l="ENG"><s0>Modeling</s0>
<s5>24</s5>
</fC03>
<fC03 i1="13" i2="X" l="SPA"><s0>Modelización</s0>
<s5>24</s5>
</fC03>
<fN21><s1>344</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>International Conference on the Foundations of Software Technology and Theoretical Computer Science</s1>
<s2>26</s2>
<s3>Kolkata IND</s3>
<s4>2006</s4>
</fA30>
</pR>
</standard>
</inist>
<affiliations><list><country><li>France</li>
<li>Suisse</li>
</country>
<region><li>Canton de Zurich</li>
</region>
<settlement><li>Zurich</li>
</settlement>
<orgName><li>École polytechnique fédérale de Zurich</li>
</orgName>
</list>
<tree><country name="France"><noRegion><name sortKey="Cortier, Veronique" sort="Cortier, Veronique" uniqKey="Cortier V" first="Véronique" last="Cortier">Véronique Cortier</name>
</noRegion>
<name sortKey="Kremer, Steve" sort="Kremer, Steve" uniqKey="Kremer S" first="Steve" last="Kremer">Steve Kremer</name>
<name sortKey="Warinschi, Bogdan" sort="Warinschi, Bogdan" uniqKey="Warinschi B" first="Bogdan" last="Warinschi">Bogdan Warinschi</name>
</country>
<country name="Suisse"><region name="Canton de Zurich"><name sortKey="Kusters, Ralf" sort="Kusters, Ralf" uniqKey="Kusters R" first="Ralf" last="Kusters">Ralf Kusters</name>
</region>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Checkpoint

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

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000401 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Checkpoint
   |type=    RBID
   |clé=     Pascal:07-0531787
   |texte=   Computationally sound symbolic secrecy in the presence of hash functions
}}

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
	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.

Serveur d'exploration sur la recherche en informatique en Lorraine

Computationally sound symbolic secrecy in the presence of hash functions

Computationally sound symbolic secrecy in the presence of hash functions

Source :

Descripteurs français

English descriptors

Abstract

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

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

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