Dynamic secrets

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

Dynamic Secrets is a novel key management scheme for secure communications. It was proposed by Sheng Xiao, Weibo Gong, and Don Towsley. The first academic publication had been nominated for INFOCOM 2010 best paper award. In 2012 a monograph was published by Springer to extend this scheme to a framework. Dynamic secrets can be applied to all bi-directional communication systems and some single-directional communication systems to improve their communications security. There are three main benefits: 1.

The encryption and authentication keys are rapidly and automatically updated for any pair of communication devices. 2. The key update process binds to the communication process and incurs negligible computing and bandwidth cost. 3. The use of a cloned key in either authentication or in encrypted communication is guaranteed to be detected. This detection has no false positives and does not cost any computing/networking resources. (Dynamic secrets automatically breaks the secure communication whenever a clone key and the legitimate key co-exist.

To find out who is the attacker is, however, takes such resources.)

Dynamic Secrets is a novel key management scheme for secure communications. It was proposed by Sheng Xiao, Weibo Gong, and Don Towsley. The first academic publication had been nominated for INFOCOM 2010 best paper award. In 2012 a monograph was published by Springer to extend this scheme to a framework. Dynamic secrets can be applied to all bi-directional communication systems and some single-directional communication systems to improve their communications security. There are three main benefits: 1.

The encryption and authentication keys are rapidly and automatically updated for any pair of communication devices. 2. The key update process binds to the communication process and incurs negligible computing and bandwidth cost. 3. The use of a cloned key in either authentication or in encrypted communication is guaranteed to be detected. This detection has no false positives and does not cost any computing/networking resources. (Dynamic secrets automatically breaks the secure communication whenever a clone key and the legitimate key co-exist.

To find out who is the attacker is, however, takes such resources.)

Implementation

1. Infisical Dynamic Secrets

References

Text derived from https://en.wikipedia.org/w/index.php?oldid=1320192607 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001320192607 · captured 1762150141.0 · version history

Cite this page as: encyclopegia.org, “Dynamic secrets”, snapshot enwiki-001320192607. https://encyclopegia.org/a/dynamic-secrets

Sources cited in this revision

2 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.