Publikation:

Deciding Secrecy of Security Protocols for an Unbounded Number of Sessions : The Case of Depth-Bounded Processes

Vorschaubild

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2017

Autor:innen

Ong, Luke
Tiu, Alwen

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
DOI (zitierfähiger Link)
https://doi.org/10.1109/csf.2017.32
ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung

Sammlungen

Informatik und Informationswissenschaft: Publikationen
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

Proceedings of the 2017 IEEE 30th Computer Security Foundations Symposium (CSF). Piscataway, NJ: IEEE, 2017, S. 464-480. eISSN 2374-8303. ISBN 978-1-5386-3218-5. Verfügbar unter: doi: 10.1109/csf.2017.32

Zusammenfassung

We introduce a new class of security protocols with an unbounded number of sessions and unlimited fresh data for which the problem of secrecy is decidable. The only constraint we place on the class is a notion of depthboundedness. Precisely we prove that, restricted to messages of up to a given size, secrecy is decidable for all depthbounded processes. This decidable fragment of security protocols captures many real-world symmetric key protocols, including Needham-Schroeder Symmetric Key, Otway-Rees, and Yahalom.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Protocols, Cryptography, Calculus, Standards, Manganese, Syntactics, depth-bounded process, security protocols, protocol secrecy, well-structured transition system

Konferenz

2017 IEEE 30th Computer Security Foundations Symposium (CSF), 21. Aug. 2017 - 25. Aug. 2017, Santa Barbara, CA, USA
Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690D'OSUALDO, Emanuele, Luke ONG, Alwen TIU, 2017. Deciding Secrecy of Security Protocols for an Unbounded Number of Sessions : The Case of Depth-Bounded Processes. 2017 IEEE 30th Computer Security Foundations Symposium (CSF). Santa Barbara, CA, USA, 21. Aug. 2017 - 25. Aug. 2017. In: Proceedings of the 2017 IEEE 30th Computer Security Foundations Symposium (CSF). Piscataway, NJ: IEEE, 2017, S. 464-480. eISSN 2374-8303. ISBN 978-1-5386-3218-5. Verfügbar unter: doi: 10.1109/csf.2017.32
BibTex
@inproceedings{DOsualdo2017-08Decid-71006,
  year={2017},
  doi={10.1109/csf.2017.32},
  title={Deciding Secrecy of Security Protocols for an Unbounded Number of Sessions : The Case of Depth-Bounded Processes},
  isbn={978-1-5386-3218-5},
  publisher={IEEE},
  address={Piscataway, NJ},
  booktitle={Proceedings of the 2017 IEEE 30th Computer Security Foundations Symposium (CSF)},
  pages={464--480},
  author={D'Osualdo, Emanuele and Ong, Luke and Tiu, Alwen}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/71006">
    <dcterms:title>Deciding Secrecy of Security Protocols for an Unbounded Number of Sessions : The Case of Depth-Bounded Processes</dcterms:title>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>D'Osualdo, Emanuele</dc:contributor>
    <dc:creator>Tiu, Alwen</dc:creator>
    <dc:language>eng</dc:language>
    <dc:contributor>Tiu, Alwen</dc:contributor>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2024-10-18T07:30:11Z</dc:date>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2024-10-18T07:30:11Z</dcterms:available>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Ong, Luke</dc:creator>
    <dcterms:issued>2017-08</dcterms:issued>
    <dc:contributor>Ong, Luke</dc:contributor>
    <dc:creator>D'Osualdo, Emanuele</dc:creator>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/71006"/>
    <dcterms:abstract>We introduce a new class of security protocols with an unbounded number of sessions and unlimited fresh data for which the problem of secrecy is decidable. The only constraint we place on the class is a notion of depthboundedness. Precisely we prove that, restricted to messages of up to a given size, secrecy is decidable for all depthbounded processes. This decidable fragment of security protocols captures many real-world symmetric key protocols, including Needham-Schroeder Symmetric Key, Otway-Rees, and Yahalom.</dcterms:abstract>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Diese Publikation teilen