Advertisement

Key Agreement via Protocols

  • Andrew William RoscoeEmail author
  • Lei Wang
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11565)

Abstract

Inspired by the ideas of no cloning and measurable degrading that quantum key agreement protocols rely on, we devise novel key agreement protocols for the classical world. Our protocols are based on identical devices that are mass produced and distributed among parties participating in the protocol. We thus use protocols a little outside their normal range and seemingly achieve the impossible by relying on certain assumptions on the devices.

References

  1. 1.
    Armando, A., et al.: The AVISPA tool for the automated validation of internet security protocols and applications. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 281–285. Springer, Heidelberg (2005).  https://doi.org/10.1007/11513988_27CrossRefGoogle Scholar
  2. 2.
    Cerf, N.J., Levy, M., Van Assche, G.: Quantum distribution of Gaussian keys using squeezed states. Phys. Rev. A 63(5), 052311 (2001)CrossRefGoogle Scholar
  3. 3.
    Chevalier, Y., Vigneron, L.: Automated unbounded verification of security protocols. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 324–337. Springer, Heidelberg (2002).  https://doi.org/10.1007/3-540-45657-0_24CrossRefzbMATHGoogle Scholar
  4. 4.
    Colombier, B., Bossuet, L.: A survey of hardware protection of design data for integrated circuits and intellectual properties. IET Comput. Digit. Tech. Inst. Eng. Technol. 8(6), 274287 (2014)Google Scholar
  5. 5.
    Cremers, C.J.F.: The scyther tool: verification, falsification, and analysis of security protocols. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 414–418. Springer, Heidelberg (2008).  https://doi.org/10.1007/978-3-540-70545-1_38CrossRefGoogle Scholar
  6. 6.
    Lowe, G.: Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 147–166. Springer, Heidelberg (1996).  https://doi.org/10.1007/3-540-61042-1_43CrossRefGoogle Scholar
  7. 7.
    Lowe, G.: Casper: a compiler for the analysis of security protocols. J. Comput. Secur. 6(1–2), 53–84 (1998)CrossRefGoogle Scholar
  8. 8.
    Meadows, C.: The NRL protocol analyzer: an overview. J. Log. Program. 26(2), 113–131 (1996)CrossRefGoogle Scholar
  9. 9.
    Meadows, C.A.: Formal verification of cryptographic protocols: a survey. In: Pieprzyk, J., Safavi-Naini, R. (eds.) ASIACRYPT 1994. LNCS, vol. 917, pp. 133–150. Springer, Heidelberg (1995).  https://doi.org/10.1007/BFb0000430CrossRefGoogle Scholar
  10. 10.
    Meadows, C.: Applying formal methods to the analysis of a key management protocol. J. Comput. Secur. 1(1), 5–35 (1992)CrossRefGoogle Scholar
  11. 11.
    Roscoe, A.W.: Modelling and verifying key-exchange protocols using CSP and FDR. In: Proceedings of the Eighth IEEE Computer Security Foundations Workshop. IEEE (1995)Google Scholar
  12. 12.
    Roscoe, A.W., Broadfoot, P.J.: Proving security protocols with model checkers by data independence techniques. J. Comput. Secur. 7(2–3), 147–190 (1999)CrossRefGoogle Scholar
  13. 13.
    Roscoe, A.W., Wang, L., Chen, B.: New approaches to key agreement and public key cryptography. In: preparationGoogle Scholar
  14. 14.
    Ryan, P., Schneider, S., Goldsmith, M., Lowe, G., Roscoe, A.W.: The Modelling and Analysis of Security Protocols: The CSP Approach. Addison-Wesley Professional, Boston (2001)Google Scholar
  15. 15.
    Shor, P.W.: Polynomial time algorithms for discrete logarithms and factoring on a quantum computer. In: Adleman, L.M., Huang, M.-D. (eds.) ANTS 1994. LNCS, vol. 877, p. 289. Springer, Heidelberg (1994).  https://doi.org/10.1007/3-540-58691-1_68CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.University College Oxford Blockchain Research CentreOxfordUK
  2. 2.Oxford-Hainan Blockchain Research InstituteOxfordUK

Personalised recommendations