Dynamic secrets

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.^[1]^[2] In 2012 a monograph was published by Springer to extend this scheme to a framework.^[3]

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 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

^ "Home". infocom2010.ieee-infocom.org.
^ Xiao, Sheng, Weibo Gong, and Don Towsley. "Secure wireless communication with dynamic secrets." INFOCOM, 2010 Proceedings IEEE. IEEE, 2010.
^ Xiao, Sheng; Gong, Weibo; Towsley, Don (August 22, 2013). Dynamic Secrets in Communication Security. Springer. p. 150. ISBN 978-1461478300.

This cryptography-related article is a stub. You can help Wikipedia by expanding it.

[1] "Home". infocom2010.ieee-infocom.org.

[2] Xiao, Sheng, Weibo Gong, and Don Towsley. "Secure wireless communication with dynamic secrets." INFOCOM, 2010 Proceedings IEEE. IEEE, 2010.

[xiaobook1-3] Xiao, Sheng; Gong, Weibo; Towsley, Don (August 22, 2013). Dynamic Secrets in Communication Security. Springer. p. 150. ISBN 978-1461478300.

[1]

[2]

[3]