Deduction Soundness: Prove One, Get Five for Free
Identifieur interne : 000E49 ( Hal/Checkpoint ); précédent : 000E48; suivant : 000E50Deduction Soundness: Prove One, Get Five for Free
Auteurs : Florian Boehl [Allemagne] ; Véronique Cortier [France] ; Bogdan Warinschi [Royaume-Uni]Source :
Abstract
Most computational soundness theorems deal with a limited number of primitives, thereby limiting their applicability. The notion of deduction soundness of Cortier and Warinschi (CCS'11) aims to facilitate soundness theorems for richer frameworks via composition results: deduction soundness can be extended, generically, with asymmetric encryption and public data structures. Unfortunately, that paper also hints at rather serious limitations regarding further composition results: composability with digital signatures seems to be precluded. In this paper we provide techniques for bypassing the perceived limitations of deduction soundness and demonstrate that it enjoys vastly improved composition properties. More precisely, we show that a deduction sound implementation can be modularly extended with all of the five basic cryptographic primitives (symmetric/asymmetric encryption, message authentication codes, digital signatures, and hash functions). We thus obtain the first soundness framework that allows for the joint use of multiple instances of all of the basic primitives. In addition, we show how to overcome an important restriction of the bare deduction soundness framework which forbids sending encrypted secret keys. In turn, this prevents its use for the analysis of a large class of interesting protocols (e.g.~key exchange protocols). We allow for more liberal uses of keys as long as they are hidden in a sense that we also define. All primitives typically used to send secret data (symmetric/asymmetric encryption) satisfy our requirement which we also show to be preserved under composition.
Url:
DOI: 10.1145/2508859.2516711
Links toward previous steps (curation, corpus...)
Links to Exploration step
Hal:hal-00881023Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Deduction Soundness: Prove One, Get Five for Free</title><author><name sortKey="Boehl, Florian" sort="Boehl, Florian" uniqKey="Boehl F" first="Florian" last="Boehl">Florian Boehl</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-135094" status="VALID"><orgName>Karlsruhe Institute of Technology [Eggenstein-Leopoldshafen]</orgName><orgName type="acronym">KIT</orgName><desc><address><addrLine>Campus North Hermann-von-Helmholtz-Platz 1 76344 Eggenstein-Leopoldshafen Campus South Kaiserstraße 12 76131 Karlsruhe</addrLine><country key="DE"></country></address><ref type="url">http://www.kit.edu/</ref></desc><listRelation><relation active="#struct-301734" type="direct"></relation><relation active="#struct-304420" type="direct"></relation><relation active="#struct-364347" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-301734" type="direct"><org type="institution" xml:id="struct-301734" status="VALID"><orgName>Technical University of Karlsruhe</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-304420" type="direct"><org type="institution" xml:id="struct-304420" status="INCOMING"><orgName>Forschungszentrum Karlsruhe</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-364347" type="direct"><org type="institution" xml:id="struct-364347" status="INCOMING"><orgName>Universität Karlsruhe</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>Allemagne</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"><hal:affiliation type="researchteam" xml:id="struct-189789" status="VALID"><idno type="RNSR">200318302K</idno><orgName>Combination of approaches to the security of infinite states systems</orgName><orgName type="acronym">CASSIS</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/cassis</ref></desc><listRelation><relation active="#struct-423084" type="direct"></relation><relation active="#struct-206040" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-129671" type="direct"></relation><relation active="#struct-866" type="direct"></relation><relation active="#struct-242365" type="indirect"></relation><relation active="#struct-300261" type="indirect"></relation><relation active="#struct-300360" type="indirect"></relation><relation name="UMR6174" active="#struct-441569" type="indirect"></relation></listRelation><tutelles><tutelle active="#struct-423084" type="direct"><org type="department" xml:id="struct-423084" status="VALID"><orgName>Department of Formal Methods </orgName><orgName type="acronym">LORIA - FM</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.loria.fr/la-recherche-en/departements/formal-methods</ref></desc><listRelation><relation active="#struct-206040" type="direct"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation></listRelation></org></tutelle><tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno><idno type="RNSR">198912571S</idno><idno type="IdUnivLorraine">[UL]RSI--</idno><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><date type="start">2012-01-01</date><desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.loria.fr</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-413289" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName><orgName type="acronym">Inria</orgName><desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/en/</ref></desc></org></tutelle><tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno><idno type="IdUnivLorraine">[UL]100--</idno><orgName>Université de Lorraine</orgName><orgName type="acronym">UL</orgName><date type="start">2012-01-01</date><desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.univ-lorraine.fr/</ref></desc></org></tutelle><tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno><orgName>INRIA Nancy - Grand Est</orgName><desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/nancy</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-866" type="direct"><org type="laboratory" xml:id="struct-866" status="VALID"><idno type="IdRef">152639071</idno><idno type="RNSR">200412232H</idno><orgName>Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies</orgName><orgName type="acronym">FEMTO-ST</orgName><desc><address><addrLine>32 avenue de l'Observatoire 25044 BESANCON CEDEX</addrLine><country key="FR"></country></address><ref type="url">http://www.femto-st.fr</ref></desc><listRelation><relation active="#struct-242365" type="direct"></relation><relation active="#struct-300261" type="direct"></relation><relation active="#struct-300360" type="direct"></relation><relation name="UMR6174" active="#struct-441569" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-242365" type="indirect"><org type="institution" xml:id="struct-242365" status="VALID"><idno type="IdRef">026403188</idno><idno type="ISNI">0000 0001 2188 3779 </idno><orgName>Université de Franche-Comté</orgName><orgName type="acronym">UFC</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.univ-fcomte.fr</ref></desc></org></tutelle><tutelle active="#struct-300261" type="indirect"><org type="institution" xml:id="struct-300261" status="VALID"><orgName>Université de Technologie de Belfort-Montbeliard</orgName><orgName type="acronym">UTBM</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300360" type="indirect"><org type="institution" xml:id="struct-300360" status="VALID"><orgName>Ecole Nationale Supérieure de Mécanique et des Microtechniques</orgName><orgName type="acronym">ENSMM</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle name="UMR6174" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><settlement type="city">Metz</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université de Lorraine</orgName><placeName><settlement type="city" wicri:auto="siege">Besançon</settlement><region type="region" nuts="2">Franche-Comté</region></placeName><orgName type="university">Université de Franche-Comté</orgName><orgName type="institution" wicri:auto="newGroup">Université de Bourgogne Franche-Comté</orgName><placeName><settlement type="city" wicri:auto="siege">Belfort</settlement><region type="region" nuts="2">Franche-Comté</region></placeName><orgName type="university">Université de technologie de Belfort-Montbéliard</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"><hal:affiliation type="laboratory" xml:id="struct-33041" status="VALID"><orgName>Computer Science Department [Bristol]</orgName><desc><address><addrLine>Merchant Venturers Building, Woodland Road, Bristol, BS8 1UB, United Kingdom</addrLine><country key="GB"></country></address><ref type="url">http://www.cs.bris.ac.uk</ref></desc><listRelation><relation active="#struct-220393" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-220393" type="direct"><org type="institution" xml:id="struct-220393" status="VALID"><orgName>University of Bristol [Bristol]</orgName><desc><address><addrLine>Senate House, Tyndall Avenue, Bristol BS8 1TH</addrLine><country key="GB"></country></address><ref type="url">http://www.bris.ac.uk/</ref></desc></org></tutelle></tutelles></hal:affiliation><country>Royaume-Uni</country></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:hal-00881023</idno><idno type="halId">hal-00881023</idno><idno type="halUri">https://hal.inria.fr/hal-00881023</idno><idno type="url">https://hal.inria.fr/hal-00881023</idno><idno type="doi">10.1145/2508859.2516711</idno><date when="2013-11-04">2013-11-04</date><idno type="wicri:Area/Hal/Corpus">001B25</idno><idno type="wicri:Area/Hal/Curation">001B25</idno><idno type="wicri:Area/Hal/Checkpoint">000E49</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">000E49</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Deduction Soundness: Prove One, Get Five for Free</title><author><name sortKey="Boehl, Florian" sort="Boehl, Florian" uniqKey="Boehl F" first="Florian" last="Boehl">Florian Boehl</name><affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-135094" status="VALID"><orgName>Karlsruhe Institute of Technology [Eggenstein-Leopoldshafen]</orgName><orgName type="acronym">KIT</orgName><desc><address><addrLine>Campus North Hermann-von-Helmholtz-Platz 1 76344 Eggenstein-Leopoldshafen Campus South Kaiserstraße 12 76131 Karlsruhe</addrLine><country key="DE"></country></address><ref type="url">http://www.kit.edu/</ref></desc><listRelation><relation active="#struct-301734" type="direct"></relation><relation active="#struct-304420" type="direct"></relation><relation active="#struct-364347" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-301734" type="direct"><org type="institution" xml:id="struct-301734" status="VALID"><orgName>Technical University of Karlsruhe</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-304420" type="direct"><org type="institution" xml:id="struct-304420" status="INCOMING"><orgName>Forschungszentrum Karlsruhe</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-364347" type="direct"><org type="institution" xml:id="struct-364347" status="INCOMING"><orgName>Universität Karlsruhe</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle></tutelles></hal:affiliation><country>Allemagne</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"><hal:affiliation type="researchteam" xml:id="struct-189789" status="VALID"><idno type="RNSR">200318302K</idno><orgName>Combination of approaches to the security of infinite states systems</orgName><orgName type="acronym">CASSIS</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/cassis</ref></desc><listRelation><relation active="#struct-423084" type="direct"></relation><relation active="#struct-206040" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-129671" type="direct"></relation><relation active="#struct-866" type="direct"></relation><relation active="#struct-242365" type="indirect"></relation><relation active="#struct-300261" type="indirect"></relation><relation active="#struct-300360" type="indirect"></relation><relation name="UMR6174" active="#struct-441569" type="indirect"></relation></listRelation><tutelles><tutelle active="#struct-423084" type="direct"><org type="department" xml:id="struct-423084" status="VALID"><orgName>Department of Formal Methods </orgName><orgName type="acronym">LORIA - FM</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.loria.fr/la-recherche-en/departements/formal-methods</ref></desc><listRelation><relation active="#struct-206040" type="direct"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-413289" type="indirect"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation></listRelation></org></tutelle><tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno><idno type="RNSR">198912571S</idno><idno type="IdUnivLorraine">[UL]RSI--</idno><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><date type="start">2012-01-01</date><desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.loria.fr</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-413289" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName><orgName type="acronym">Inria</orgName><desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/en/</ref></desc></org></tutelle><tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno><idno type="IdUnivLorraine">[UL]100--</idno><orgName>Université de Lorraine</orgName><orgName type="acronym">UL</orgName><date type="start">2012-01-01</date><desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.univ-lorraine.fr/</ref></desc></org></tutelle><tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle><tutelle active="#struct-129671" type="direct"><org type="laboratory" xml:id="struct-129671" status="VALID"><idno type="RNSR">198618246Y</idno><orgName>INRIA Nancy - Grand Est</orgName><desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/nancy</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-866" type="direct"><org type="laboratory" xml:id="struct-866" status="VALID"><idno type="IdRef">152639071</idno><idno type="RNSR">200412232H</idno><orgName>Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies</orgName><orgName type="acronym">FEMTO-ST</orgName><desc><address><addrLine>32 avenue de l'Observatoire 25044 BESANCON CEDEX</addrLine><country key="FR"></country></address><ref type="url">http://www.femto-st.fr</ref></desc><listRelation><relation active="#struct-242365" type="direct"></relation><relation active="#struct-300261" type="direct"></relation><relation active="#struct-300360" type="direct"></relation><relation name="UMR6174" active="#struct-441569" type="direct"></relation></listRelation></org></tutelle><tutelle active="#struct-242365" type="indirect"><org type="institution" xml:id="struct-242365" status="VALID"><idno type="IdRef">026403188</idno><idno type="ISNI">0000 0001 2188 3779 </idno><orgName>Université de Franche-Comté</orgName><orgName type="acronym">UFC</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.univ-fcomte.fr</ref></desc></org></tutelle><tutelle active="#struct-300261" type="indirect"><org type="institution" xml:id="struct-300261" status="VALID"><orgName>Université de Technologie de Belfort-Montbeliard</orgName><orgName type="acronym">UTBM</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300360" type="indirect"><org type="institution" xml:id="struct-300360" status="VALID"><orgName>Ecole Nationale Supérieure de Mécanique et des Microtechniques</orgName><orgName type="acronym">ENSMM</orgName><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle name="UMR6174" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><settlement type="city">Metz</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université de Lorraine</orgName><placeName><settlement type="city" wicri:auto="siege">Besançon</settlement><region type="region" nuts="2">Franche-Comté</region></placeName><orgName type="university">Université de Franche-Comté</orgName><orgName type="institution" wicri:auto="newGroup">Université de Bourgogne Franche-Comté</orgName><placeName><settlement type="city" wicri:auto="siege">Belfort</settlement><region type="region" nuts="2">Franche-Comté</region></placeName><orgName type="university">Université de technologie de Belfort-Montbéliard</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"><hal:affiliation type="laboratory" xml:id="struct-33041" status="VALID"><orgName>Computer Science Department [Bristol]</orgName><desc><address><addrLine>Merchant Venturers Building, Woodland Road, Bristol, BS8 1UB, United Kingdom</addrLine><country key="GB"></country></address><ref type="url">http://www.cs.bris.ac.uk</ref></desc><listRelation><relation active="#struct-220393" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-220393" type="direct"><org type="institution" xml:id="struct-220393" status="VALID"><orgName>University of Bristol [Bristol]</orgName><desc><address><addrLine>Senate House, Tyndall Avenue, Bristol BS8 1TH</addrLine><country key="GB"></country></address><ref type="url">http://www.bris.ac.uk/</ref></desc></org></tutelle></tutelles></hal:affiliation><country>Royaume-Uni</country></affiliation></author></analytic><idno type="DOI">10.1145/2508859.2516711</idno></biblStruct></sourceDesc></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Most computational soundness theorems deal with a limited number of primitives, thereby limiting their applicability. The notion of deduction soundness of Cortier and Warinschi (CCS'11) aims to facilitate soundness theorems for richer frameworks via composition results: deduction soundness can be extended, generically, with asymmetric encryption and public data structures. Unfortunately, that paper also hints at rather serious limitations regarding further composition results: composability with digital signatures seems to be precluded. In this paper we provide techniques for bypassing the perceived limitations of deduction soundness and demonstrate that it enjoys vastly improved composition properties. More precisely, we show that a deduction sound implementation can be modularly extended with all of the five basic cryptographic primitives (symmetric/asymmetric encryption, message authentication codes, digital signatures, and hash functions). We thus obtain the first soundness framework that allows for the joint use of multiple instances of all of the basic primitives. In addition, we show how to overcome an important restriction of the bare deduction soundness framework which forbids sending encrypted secret keys. In turn, this prevents its use for the analysis of a large class of interesting protocols (e.g.~key exchange protocols). We allow for more liberal uses of keys as long as they are hidden in a sense that we also define. All primitives typically used to send secret data (symmetric/asymmetric encryption) satisfy our requirement which we also show to be preserved under composition.</div></front></TEI><hal api="V3"><titleStmt><title xml:lang="en">Deduction Soundness: Prove One, Get Five for Free</title><author role="aut"><persName><forename type="first">Florian</forename><surname>Boehl</surname></persName><email></email><idno type="halauthor">908507</idno><orgName ref="#struct-301808"></orgName><affiliation ref="#struct-135094"></affiliation></author><author role="aut"><persName><forename type="first">Véronique</forename><surname>Cortier</surname></persName><email>cortier@loria.fr</email><ptr type="url" target="http://www.loria.fr/~cortier"></ptr><idno type="halauthor">843354</idno><affiliation ref="#struct-189789"></affiliation></author><author role="aut"><persName><forename type="first">Bogdan</forename><surname>Warinschi</surname></persName><email></email><idno type="halauthor">64515</idno><affiliation ref="#struct-33041"></affiliation></author><editor role="depositor"><persName><forename>Véronique</forename><surname>Cortier</surname></persName><email>cortier@loria.fr</email></editor><funder ref="#projeurop-88798"></funder></titleStmt><editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2013-11-07 12:12:14</date><date type="whenModified">2015-09-22 01:13:15</date><date type="whenReleased">2013-11-07 12:12:14</date><date type="whenProduced">2013-11-04</date></edition><respStmt><resp>contributor</resp><name key="103154"><persName><forename>Véronique</forename><surname>Cortier</surname></persName><email>cortier@loria.fr</email></name></respStmt></editionStmt><publicationStmt><distributor>CCSD</distributor><idno type="halId">hal-00881023</idno><idno type="halUri">https://hal.inria.fr/hal-00881023</idno><idno type="halBibtex">boehl:hal-00881023</idno><idno type="halRefHtml">CCS '13 - Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security - 2013, Nov 2013, Berlin, Germany. ACM, pp.1261-1272, 2013, <10.1145/2508859.2516711></idno><idno type="halRef">CCS '13 - Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security - 2013, Nov 2013, Berlin, Germany. ACM, pp.1261-1272, 2013, <10.1145/2508859.2516711></idno></publicationStmt><seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno><idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno><idno type="stamp" n="UNIV-FCOMTE">Université de Franche-Comté</idno><idno type="stamp" n="OPENAIRE">OpenAIRE</idno><idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno><idno type="stamp" n="LORIA2">Publications du LORIA</idno><idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno><idno type="stamp" n="LORIA-FM" p="LORIA">Méthodes formelles</idno><idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno><idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno><idno type="stamp" n="UNIV-BM">Université de Technologie de Belfort-Montbeliard</idno><idno type="stamp" n="ENSMM">Ecole Nationale Supérieure de Mécanique et des Microtechniques</idno><idno type="stamp" n="FEMTO-ST" p="UNIV-FCOMTE">Franche-Comté Electronique, Mécanique, Thermique et Optique - Sciences et Technologies</idno><idno type="stamp" n="UNIV-BM-THESE">Université de Technologie de Belfort-Montbeliard</idno><idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno></seriesStmt><notesStmt><note type="audience" n="2">International</note><note type="invited" n="0">No</note><note type="popular" n="0">No</note><note type="peer" n="1">Yes</note><note type="proceedings" n="1">Yes</note></notesStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Deduction Soundness: Prove One, Get Five for Free</title><author role="aut"><persName><forename type="first">Florian</forename><surname>Boehl</surname></persName><idno type="halAuthorId">908507</idno><orgName ref="#struct-301808"></orgName><affiliation ref="#struct-135094"></affiliation></author><author role="aut"><persName><forename type="first">Véronique</forename><surname>Cortier</surname></persName><email>cortier@loria.fr</email><ptr type="url" target="http://www.loria.fr/~cortier"></ptr><idno type="halAuthorId">843354</idno><affiliation ref="#struct-189789"></affiliation></author><author role="aut"><persName><forename type="first">Bogdan</forename><surname>Warinschi</surname></persName><idno type="halAuthorId">64515</idno><affiliation ref="#struct-33041"></affiliation></author></analytic><monogr><meeting><title>CCS '13 - Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security - 2013</title><date type="start">2013-11-04</date><date type="end">2013-11-08</date><settlement>Berlin</settlement><country key="DE">Germany</country></meeting><imprint><publisher>ACM</publisher><biblScope unit="pp">1261-1272</biblScope><date type="datePub">2013</date></imprint></monogr><idno type="doi">10.1145/2508859.2516711</idno></biblStruct></sourceDesc><profileDesc><langUsage><language ident="en">English</language></langUsage><textClass><classCode scheme="halDomain" n="info.info-cr">Computer Science [cs]/Cryptography and Security [cs.CR]</classCode><classCode scheme="halTypology" n="COMM">Conference papers</classCode></textClass><abstract xml:lang="en">Most computational soundness theorems deal with a limited number of primitives, thereby limiting their applicability. The notion of deduction soundness of Cortier and Warinschi (CCS'11) aims to facilitate soundness theorems for richer frameworks via composition results: deduction soundness can be extended, generically, with asymmetric encryption and public data structures. Unfortunately, that paper also hints at rather serious limitations regarding further composition results: composability with digital signatures seems to be precluded. In this paper we provide techniques for bypassing the perceived limitations of deduction soundness and demonstrate that it enjoys vastly improved composition properties. More precisely, we show that a deduction sound implementation can be modularly extended with all of the five basic cryptographic primitives (symmetric/asymmetric encryption, message authentication codes, digital signatures, and hash functions). We thus obtain the first soundness framework that allows for the joint use of multiple instances of all of the basic primitives. In addition, we show how to overcome an important restriction of the bare deduction soundness framework which forbids sending encrypted secret keys. In turn, this prevents its use for the analysis of a large class of interesting protocols (e.g.~key exchange protocols). We allow for more liberal uses of keys as long as they are hidden in a sense that we also define. All primitives typically used to send secret data (symmetric/asymmetric encryption) satisfy our requirement which we also show to be preserved under composition.</abstract></profileDesc></hal></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000E49 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Checkpoint/biblio.hfd -nk 000E49 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Hal
|étape= Checkpoint
|type= RBID
|clé= Hal:hal-00881023
|texte= Deduction Soundness: Prove One, Get Five for Free
}}
| This area was generated with Dilib version V0.6.33. |  |