How to Guarantee Secrecy for Cryptographic Protocols

In this paper we propose a general definition of secrecy for cryptographic protocols in the Dolev-Yao model. We give a sufficient condition ensuring secrecy for protocols where rules have encryption depth at most two, that is satisfied by almost all practical protocols. The only allowed primitives i...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2007-03
Main Authors: Beauquier, Danièle, Gauche, Frédéric
Format: Article
Language:English
Subjects:
Algorithms
Cryptography
Encryption
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Beauquier, Danièle
Gauche, Frédéric
description In this paper we propose a general definition of secrecy for cryptographic protocols in the Dolev-Yao model. We give a sufficient condition ensuring secrecy for protocols where rules have encryption depth at most two, that is satisfied by almost all practical protocols. The only allowed primitives in the class of protocols we consider are pairing and encryption with atomic keys. Moreover, we describe an algorithm of practical interest which transforms a cryptographic protocol into a secure one from the point of view of secrecy, without changing its original goal with respect to secrecy of nonces and keys, provided the protocol satisfies some conditions. These conditions are not very restrictive and are satisfied for most practical protocols.
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2091242494</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2091242494</sourcerecordid><originalsourceid>FETCH-proquest_journals_20912424943</originalsourceid><addsrcrecordid>eNqNyrEKwjAQgOEgCBbtOxw4F9JLqnYuakdB9xJCqpbSi5cE6dvr4AM4_cP3L0SGSpXFQSOuRB7CIKXE3R6rSmVCt_SGSHBOhs0UnYOrs-zsDD0xNDz7SHc2_vG0cGGKZGkMG7HszRhc_utabE_HW9MWnumVXIjdQImnL3Uo6xI16lqr_64PU3g0qQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2091242494</pqid></control><display><type>article</type><title>How to Guarantee Secrecy for Cryptographic Protocols</title><source>Publicly Available Content Database</source><creator>Beauquier, Danièle ; Gauche, Frédéric</creator><creatorcontrib>Beauquier, Danièle ; Gauche, Frédéric</creatorcontrib><description>In this paper we propose a general definition of secrecy for cryptographic protocols in the Dolev-Yao model. We give a sufficient condition ensuring secrecy for protocols where rules have encryption depth at most two, that is satisfied by almost all practical protocols. The only allowed primitives in the class of protocols we consider are pairing and encryption with atomic keys. Moreover, we describe an algorithm of practical interest which transforms a cryptographic protocol into a secure one from the point of view of secrecy, without changing its original goal with respect to secrecy of nonces and keys, provided the protocol satisfies some conditions. These conditions are not very restrictive and are satisfied for most practical protocols.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Cryptography ; Encryption</subject><ispartof>arXiv.org, 2007-03</ispartof><rights>Notwithstanding the ProQuest Terms and conditions, you may use this content in accordance with the associated terms available at http://arxiv.org/abs/cs/0703140.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2091242494?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25752,37011,44589</link.rule.ids></links><search><creatorcontrib>Beauquier, Danièle</creatorcontrib><creatorcontrib>Gauche, Frédéric</creatorcontrib><title>How to Guarantee Secrecy for Cryptographic Protocols</title><title>arXiv.org</title><description>In this paper we propose a general definition of secrecy for cryptographic protocols in the Dolev-Yao model. We give a sufficient condition ensuring secrecy for protocols where rules have encryption depth at most two, that is satisfied by almost all practical protocols. The only allowed primitives in the class of protocols we consider are pairing and encryption with atomic keys. Moreover, we describe an algorithm of practical interest which transforms a cryptographic protocol into a secure one from the point of view of secrecy, without changing its original goal with respect to secrecy of nonces and keys, provided the protocol satisfies some conditions. These conditions are not very restrictive and are satisfied for most practical protocols.</description><subject>Algorithms</subject><subject>Cryptography</subject><subject>Encryption</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqNyrEKwjAQgOEgCBbtOxw4F9JLqnYuakdB9xJCqpbSi5cE6dvr4AM4_cP3L0SGSpXFQSOuRB7CIKXE3R6rSmVCt_SGSHBOhs0UnYOrs-zsDD0xNDz7SHc2_vG0cGGKZGkMG7HszRhc_utabE_HW9MWnumVXIjdQImnL3Uo6xI16lqr_64PU3g0qQ</recordid><startdate>20070328</startdate><enddate>20070328</enddate><creator>Beauquier, Danièle</creator><creator>Gauche, Frédéric</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20070328</creationdate><title>How to Guarantee Secrecy for Cryptographic Protocols</title><author>Beauquier, Danièle ; Gauche, Frédéric</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20912424943</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Algorithms</topic><topic>Cryptography</topic><topic>Encryption</topic><toplevel>online_resources</toplevel><creatorcontrib>Beauquier, Danièle</creatorcontrib><creatorcontrib>Gauche, Frédéric</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Beauquier, Danièle</au><au>Gauche, Frédéric</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>How to Guarantee Secrecy for Cryptographic Protocols</atitle><jtitle>arXiv.org</jtitle><date>2007-03-28</date><risdate>2007</risdate><eissn>2331-8422</eissn><abstract>In this paper we propose a general definition of secrecy for cryptographic protocols in the Dolev-Yao model. We give a sufficient condition ensuring secrecy for protocols where rules have encryption depth at most two, that is satisfied by almost all practical protocols. The only allowed primitives in the class of protocols we consider are pairing and encryption with atomic keys. Moreover, we describe an algorithm of practical interest which transforms a cryptographic protocol into a secure one from the point of view of secrecy, without changing its original goal with respect to secrecy of nonces and keys, provided the protocol satisfies some conditions. These conditions are not very restrictive and are satisfied for most practical protocols.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2007-03
issn 2331-8422
language eng
recordid cdi_proquest_journals_2091242494
source Publicly Available Content Database
subjects Algorithms
Cryptography
Encryption
title How to Guarantee Secrecy for Cryptographic Protocols
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T18%3A57%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=How%20to%20Guarantee%20Secrecy%20for%20Cryptographic%20Protocols&rft.jtitle=arXiv.org&rft.au=Beauquier,%20Dani%C3%A8le&rft.date=2007-03-28&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2091242494%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_20912424943%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2091242494&rft_id=info:pmid/&rfr_iscdi=true