Abstract
We propose the use of graphs as basic objects in security protocols. While having all the functionality of their number based counterparts; such protocols can have extended capabilities, especially useful in the field of verification and analysis. The scalability and transitivity for graph related properties allow for addressing protocols of increasing complexity. These features also cater for new challenges in the future, for instance ones resulting from a quantum computing paradigm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Shannon, C.E.: A mathematical theory of communication. Bell System Technical Journal 27, 379–423 (1948)
Goedel, K.: Uber formal unentscheidbare Satze der Principia Mathematica und verwander Systeme, I. Monatshefte fur Mathematik und Physik 38, 173–198 (1931)
Korte, B., Vygen, J.: Combinatorial Optimization, theory and algorithms. Springer, Heidelberg (2000)
Molloy, M., Reed, B.: Graph Colouring and the Probabilistic Method. Springer, Heilderberg (2002)
Beineke, L.W., Wilson, R.J. (eds.): Graph connections; relationships between graph theory and other areas of mathematics. Oxford University Press, New York (1997)
Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM 38(1), 691–729 (1991)
Brassard, G., Chaum, D., Crepeau, C.: Minimum disclosure proofs of knowledge. Journal of Computer and System Science 37(2), 156–189 (1988)
Goldwasser, S.: The search for provably secure cryptosystems. In: Proceedings of Symposia in Applied Mathematics, Cryptology and Computational Number Theory, vol. 42, pp. 89–113. American Mathematical Society (1990)
Maurer, U.M.: Information-theoretically secure secret-key agreement by NOT authenticated public discussion. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 209–225. Springer, Heidelberg (1997)
Stinson, D.R.: Cryptography, Theory and Practice. CRC Press, Boca Raton (1995)
Pieprzyk, J., Hardjono, T., Seberry, J.: Fundamentals of Computer Security. Springer, Heilderberg (2003)
Stinson, D.R., Wei, R.: Bibliography on Secret Sharing Schemes. Webpage, http://www.cacr.math.uwaterloo.ca/~dstinson/ssbib.html (retrieved 30.08.2003)
Kulesza, K., Kotulski, Z., Pieprzyk, J.: On alternative approach for verifiable secret sharing. In: Zurich (ed.) ESORICS, Available from IACR’s Cryptology ePrint Archive (2002), (submitted for publication) http://eprint.iacr.org/ report 2003/035
Kulesza, K., Kotulski, Z.: On graph coloring check-digit method. Submitted for publication, Available from the Los Alamos National Laborartory e-print (2002), http://arxiv.org/abs/math.CO/0211317
Wilson, R.A.: Graphs, Colourings and the Four-colour Theorem. Oxford University Press, New York (2002)
Ryan, P.: Open questions. In: Christianson, B., Crispo, B., Malcolm, J.A., Roe, M. (eds.) Security Protocols 2000. LNCS, vol. 2133, pp. 49–53. Springer, Heidelberg (2001)
Gruska, J.: Quantum Computing. McGraw Hill, New York (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kulesza, K., Kotulski, Z. (2005). Addressing New Challenges by Building Security Protocols Around Graphs. In: Christianson, B., Crispo, B., Malcolm, J.A., Roe, M. (eds) Security Protocols. Security Protocols 2003. Lecture Notes in Computer Science, vol 3364. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11542322_36
Download citation
DOI: https://doi.org/10.1007/11542322_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28389-8
Online ISBN: 978-3-540-31836-1
eBook Packages: Computer ScienceComputer Science (R0)