Probability distributions over cryptographic protocols
Approved for public release, distribution unlimited === This study examines the problem of assuring correct functionality of cryptographic protocol verifiers. As a replacement for manual input of well-known protocols, we propose the creation of a random protocol generator capable of producing prot...
Main Author: | |
---|---|
Other Authors: | |
Published: |
Monterey, California. Naval Postgraduate School
2012
|
Online Access: | http://hdl.handle.net/10945/4744 |
id |
ndltd-nps.edu-oai-calhoun.nps.edu-10945-4744 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-nps.edu-oai-calhoun.nps.edu-10945-47442014-12-04T04:08:51Z Probability distributions over cryptographic protocols Skaff, Stephanie J. C. Herzog, Jonathan Dinolt, George Naval Postgraduate School (U.S.) Approved for public release, distribution unlimited This study examines the problem of assuring correct functionality of cryptographic protocol verifiers. As a replacement for manual input of well-known protocols, we propose the creation of a random protocol generator capable of producing protocols of varying degrees of correctness. This generator would be verifier-independent, and the protocols translated into verifier languages as required. This would automate not only the creation of protocols, but eliminate the variability both in translation quality and in the resulting body of tests. To this end, we propose a common definition for cryptographic protocols, develop multiple probability distributions over this definition, and implement a generator that uses these distributions. As a proof of concept, we translate protocols created by the generator into a suitable format for the Cryptographic Protocol Shapes Analyzer. 2012-03-14T17:42:52Z 2012-03-14T17:42:52Z 2009-06 Thesis http://hdl.handle.net/10945/4744 424609661 Monterey, California. Naval Postgraduate School |
collection |
NDLTD |
sources |
NDLTD |
description |
Approved for public release, distribution unlimited === This study examines the problem of assuring correct functionality of cryptographic protocol verifiers. As a replacement for manual input of well-known protocols, we propose the creation of a random protocol generator capable of producing protocols of varying degrees of correctness. This generator would be verifier-independent, and the protocols translated into verifier languages as required. This would automate not only the creation of protocols, but eliminate the variability both in translation quality and in the resulting body of tests. To this end, we propose a common definition for cryptographic protocols, develop multiple probability distributions over this definition, and implement a generator that uses these distributions. As a proof of concept, we translate protocols created by the generator into a suitable format for the Cryptographic Protocol Shapes Analyzer. |
author2 |
Herzog, Jonathan |
author_facet |
Herzog, Jonathan Skaff, Stephanie J. C. |
author |
Skaff, Stephanie J. C. |
spellingShingle |
Skaff, Stephanie J. C. Probability distributions over cryptographic protocols |
author_sort |
Skaff, Stephanie J. C. |
title |
Probability distributions over cryptographic protocols |
title_short |
Probability distributions over cryptographic protocols |
title_full |
Probability distributions over cryptographic protocols |
title_fullStr |
Probability distributions over cryptographic protocols |
title_full_unstemmed |
Probability distributions over cryptographic protocols |
title_sort |
probability distributions over cryptographic protocols |
publisher |
Monterey, California. Naval Postgraduate School |
publishDate |
2012 |
url |
http://hdl.handle.net/10945/4744 |
work_keys_str_mv |
AT skaffstephaniejc probabilitydistributionsovercryptographicprotocols |
_version_ |
1716726328228577280 |