Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
Identifieur interne : 002591 ( Istex/Curation ); précédent : 002590; suivant : 002592Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
Auteurs : Anupam Datta [États-Unis] ; Ante Derek [États-Unis] ; John C. Mitchell [États-Unis] ; Vitaly Shmatikov [États-Unis] ; Mathieu Turuani [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the actions of a malicious attacker. The approach rests on a new probabilistic, polynomial-time semantics for an existing protocol security logic, replacing an earlier semantics that uses nondeterministic symbolic evaluation. While the basic form of the protocol logic remains unchanged from previous work, there are some interesting technical problems involving the difference between efficiently recognizing and efficiently producing a value, and involving a reinterpretation of standard logical connectives that seems necessary to support certain forms of reasoning.
Url:
DOI: 10.1007/11523468_2
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :002624
Links to Exploration step
ISTEX:A214C99D31EDE5523E540CDA21334854A6E4006ELe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Probabilistic Polynomial-Time Semantics for a Protocol Security Logic</title><author><name sortKey="Datta, Anupam" sort="Datta, Anupam" uniqKey="Datta A" first="Anupam" last="Datta">Anupam Datta</name><affiliation wicri:level="2"><mods:affiliation>Dept. Computer Science, Stanford University, Stanford, CA</mods:affiliation><country xml:lang="fr">États-Unis</country><placeName><region type="state">Californie</region></placeName><wicri:cityArea>Dept. Computer Science, Stanford University, Stanford</wicri:cityArea></affiliation></author><author><name sortKey="Derek, Ante" sort="Derek, Ante" uniqKey="Derek A" first="Ante" last="Derek">Ante Derek</name><affiliation wicri:level="2"><mods:affiliation>Dept. Computer Science, Stanford University, Stanford, CA</mods:affiliation><country xml:lang="fr">États-Unis</country><placeName><region type="state">Californie</region></placeName><wicri:cityArea>Dept. Computer Science, Stanford University, Stanford</wicri:cityArea></affiliation></author><author><name sortKey="Mitchell, John C" sort="Mitchell, John C" uniqKey="Mitchell J" first="John C." last="Mitchell">John C. Mitchell</name><affiliation wicri:level="2"><mods:affiliation>Dept. Computer Science, Stanford University, Stanford, CA</mods:affiliation><country xml:lang="fr">États-Unis</country><placeName><region type="state">Californie</region></placeName><wicri:cityArea>Dept. Computer Science, Stanford University, Stanford</wicri:cityArea></affiliation></author><author><name sortKey="Shmatikov, Vitaly" sort="Shmatikov, Vitaly" uniqKey="Shmatikov V" first="Vitaly" last="Shmatikov">Vitaly Shmatikov</name><affiliation wicri:level="2"><mods:affiliation>Dept. Computer Science, University of Texas, Austin, TX</mods:affiliation><country xml:lang="fr">États-Unis</country><placeName><region type="state">Texas</region></placeName><wicri:cityArea>Dept. Computer Science, University of Texas, Austin</wicri:cityArea></affiliation></author><author><name sortKey="Turuani, Mathieu" sort="Turuani, Mathieu" uniqKey="Turuani M" first="Mathieu" last="Turuani">Mathieu Turuani</name><affiliation wicri:level="1"><mods:affiliation>LORIA-INRIA Nancy, France</mods:affiliation><country xml:lang="fr">France</country><wicri:regionArea>LORIA-INRIA Nancy</wicri:regionArea></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:A214C99D31EDE5523E540CDA21334854A6E4006E</idno><date when="2005" year="2005">2005</date><idno type="doi">10.1007/11523468_2</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-TW5B5NKH-9/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002624</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002624</idno><idno type="wicri:Area/Istex/Curation">002591</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Probabilistic Polynomial-Time Semantics for a Protocol Security Logic</title><author><name sortKey="Datta, Anupam" sort="Datta, Anupam" uniqKey="Datta A" first="Anupam" last="Datta">Anupam Datta</name><affiliation wicri:level="2"><mods:affiliation>Dept. Computer Science, Stanford University, Stanford, CA</mods:affiliation><country xml:lang="fr">États-Unis</country><placeName><region type="state">Californie</region></placeName><wicri:cityArea>Dept. Computer Science, Stanford University, Stanford</wicri:cityArea></affiliation></author><author><name sortKey="Derek, Ante" sort="Derek, Ante" uniqKey="Derek A" first="Ante" last="Derek">Ante Derek</name><affiliation wicri:level="2"><mods:affiliation>Dept. Computer Science, Stanford University, Stanford, CA</mods:affiliation><country xml:lang="fr">États-Unis</country><placeName><region type="state">Californie</region></placeName><wicri:cityArea>Dept. Computer Science, Stanford University, Stanford</wicri:cityArea></affiliation></author><author><name sortKey="Mitchell, John C" sort="Mitchell, John C" uniqKey="Mitchell J" first="John C." last="Mitchell">John C. Mitchell</name><affiliation wicri:level="2"><mods:affiliation>Dept. Computer Science, Stanford University, Stanford, CA</mods:affiliation><country xml:lang="fr">États-Unis</country><placeName><region type="state">Californie</region></placeName><wicri:cityArea>Dept. Computer Science, Stanford University, Stanford</wicri:cityArea></affiliation></author><author><name sortKey="Shmatikov, Vitaly" sort="Shmatikov, Vitaly" uniqKey="Shmatikov V" first="Vitaly" last="Shmatikov">Vitaly Shmatikov</name><affiliation wicri:level="2"><mods:affiliation>Dept. Computer Science, University of Texas, Austin, TX</mods:affiliation><country xml:lang="fr">États-Unis</country><placeName><region type="state">Texas</region></placeName><wicri:cityArea>Dept. Computer Science, University of Texas, Austin</wicri:cityArea></affiliation></author><author><name sortKey="Turuani, Mathieu" sort="Turuani, Mathieu" uniqKey="Turuani M" first="Mathieu" last="Turuani">Mathieu Turuani</name><affiliation wicri:level="1"><mods:affiliation>LORIA-INRIA Nancy, France</mods:affiliation><country xml:lang="fr">France</country><wicri:regionArea>LORIA-INRIA Nancy</wicri:regionArea></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: We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the actions of a malicious attacker. The approach rests on a new probabilistic, polynomial-time semantics for an existing protocol security logic, replacing an earlier semantics that uses nondeterministic symbolic evaluation. While the basic form of the protocol logic remains unchanged from previous work, there are some interesting technical problems involving the difference between efficiently recognizing and efficiently producing a value, and involving a reinterpretation of standard logical connectives that seems necessary to support certain forms of reasoning.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002591 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 002591 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Curation
|type= RBID
|clé= ISTEX:A214C99D31EDE5523E540CDA21334854A6E4006E
|texte= Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
}}
| This area was generated with Dilib version V0.6.33. |  |