{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:29:57Z","timestamp":1753889397253},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540551218"},{"type":"electronic","value":"9783540467359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55121-2_17","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T04:47:40Z","timestamp":1330231660000},"page":"180-186","source":"Crossref","is-referenced-by-count":5,"title":["A generalized encryption scheme based on random graphs"],"prefix":"10.1007","author":[{"given":"Lud\u011bk","family":"Ku\u010dera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,5]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Babai,L.,Ku\u010dera,L.,Canonical labelling of graphs in linear average time, 20th Annual Symposium on Foundations of Computer Science, Puerto Rico 1979, 39\u201346","DOI":"10.1109\/SFCS.1979.8"},{"key":"17_CR2","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"1985","unstructured":"Bollob\u00e1s B., Random Graphs, Academic Press, London 1985."},{"key":"17_CR3","first-page":"195","volume-title":"Lecture Notes in Computer Science","author":"S. Even","year":"1980","unstructured":"Even, S. and Yakobi, Y., Cryptocomplexity and N P-completeness, In Proc. 8th Colloq. on Automata, Languages, and Programming, Lecture Notes in Computer Science, 195\u2013207, Springer Verlag, Berlin, 1980."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Goldwasser,S., Micali,S., Rackoff,C., The knowledge complexity of interactive proofs, 17th Annual Symposium on Foundations of Computer Science, Providence, RI, 1985,291\u2013305.","DOI":"10.1145\/22145.22178"},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1137\/0215020","volume":"15","author":"L. Levin","year":"1986","unstructured":"Levin, L., Average case complete problems, SIAM J. Computing, 15 (1986), 285\u2013286.","journal-title":"SIAM J. Computing"},{"key":"17_CR6","unstructured":"Levin,L., personal communication."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55121-2_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:57:36Z","timestamp":1605628656000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55121-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540551218","9783540467359"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-55121-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}