{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T10:52:24Z","timestamp":1768992744138,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540283898","type":"print"},{"value":"9783540318361","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11542322_36","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T08:53:57Z","timestamp":1127811237000},"page":"301-306","source":"Crossref","is-referenced-by-count":1,"title":["Addressing New Challenges by Building Security Protocols Around Graphs"],"prefix":"10.1007","author":[{"given":"Kamil","family":"Kulesza","sequence":"first","affiliation":[]},{"given":"Zbigniew","family":"Kotulski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell System Technical Journal\u00a027, 379\u2013423 (1948)","journal-title":"Bell System Technical Journal"},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF01700692","volume":"38","author":"K. Goedel","year":"1931","unstructured":"Goedel, K.: Uber formal unentscheidbare Satze der Principia Mathematica und verwander Systeme, I. Monatshefte fur Mathematik und Physik\u00a038, 173\u2013198 (1931)","journal-title":"Monatshefte fur Mathematik und Physik"},{"key":"36_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21708-5","volume-title":"Combinatorial Optimization, theory and algorithms","author":"B. Korte","year":"2000","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization, theory and algorithms. Springer, Heidelberg (2000)"},{"key":"36_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04016-0","volume-title":"Graph Colouring and the Probabilistic Method","author":"M. Molloy","year":"2002","unstructured":"Molloy, M., Reed, B.: Graph Colouring and the Probabilistic Method. Springer, Heilderberg (2002)"},{"key":"36_CR5","volume-title":"Graph connections; relationships between graph theory and other areas of mathematics","year":"1997","unstructured":"Beineke, L.W., Wilson, R.J. (eds.): Graph connections; relationships between graph theory and other areas of mathematics. Oxford University Press, New York (1997)"},{"issue":"1","key":"36_CR6","first-page":"691","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"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\u00a038(1), 691\u2013729 (1991)","journal-title":"Journal of the ACM"},{"issue":"2","key":"36_CR7","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., Crepeau, C.: Minimum disclosure proofs of knowledge. Journal of Computer and System Science\u00a037(2), 156\u2013189 (1988)","journal-title":"Journal of Computer and System Science"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Goldwasser, S.: The search for provably secure cryptosystems. In: Proceedings of Symposia in Applied Mathematics, Cryptology and Computational Number Theory, vol.\u00a042, pp. 89\u2013113. American Mathematical Society (1990)","DOI":"10.1090\/psapm\/042\/1095553"},{"key":"36_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/3-540-69053-0_15","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"U.M. Maurer","year":"1997","unstructured":"Maurer, U.M.: Information-theoretically secure secret-key agreement by NOT authenticated public discussion. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 209\u2013225. Springer, Heidelberg (1997)"},{"key":"36_CR10","volume-title":"Cryptography, Theory and Practice","author":"D.R. Stinson","year":"1995","unstructured":"Stinson, D.R.: Cryptography, Theory and Practice. CRC Press, Boca Raton (1995)"},{"key":"36_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07324-7","volume-title":"Fundamentals of Computer Security","author":"J. Pieprzyk","year":"2003","unstructured":"Pieprzyk, J., Hardjono, T., Seberry, J.: Fundamentals of Computer Security. Springer, Heilderberg (2003)"},{"key":"36_CR12","unstructured":"Stinson, D.R., Wei, R.: Bibliography on Secret Sharing Schemes. Webpage, http:\/\/www.cacr.math.uwaterloo.ca\/~dstinson\/ssbib.html (retrieved 30.08.2003)"},{"key":"36_CR13","unstructured":"Kulesza, K., Kotulski, Z., Pieprzyk, J.: On alternative approach for verifiable secret sharing. In: Zurich (ed.) ESORICS, Available from IACR\u2019s Cryptology ePrint Archive (2002), (submitted for publication) http:\/\/eprint.iacr.org\/ report 2003\/035"},{"key":"36_CR14","unstructured":"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"},{"key":"36_CR15","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198510611.001.0001","volume-title":"Graphs, Colourings and the Four-colour Theorem","author":"R.A. Wilson","year":"2002","unstructured":"Wilson, R.A.: Graphs, Colourings and the Four-colour Theorem. Oxford University Press, New York (2002)"},{"key":"36_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-44810-1_8","volume-title":"Security Protocols","author":"P. Ryan","year":"2001","unstructured":"Ryan, P.: Open questions. In: Christianson, B., Crispo, B., Malcolm, J.A., Roe, M. (eds.) Security Protocols 2000. LNCS, vol.\u00a02133, pp. 49\u201353. Springer, Heidelberg (2001)"},{"key":"36_CR17","volume-title":"Quantum Computing","author":"J. Gruska","year":"1999","unstructured":"Gruska, J.: Quantum Computing. McGraw Hill, New York (1999)"}],"container-title":["Lecture Notes in Computer Science","Security Protocols"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11542322_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T04:50:59Z","timestamp":1706590259000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11542322_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540283898","9783540318361"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11542322_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}