{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:28:10Z","timestamp":1753601290692,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540549451"},{"type":"electronic","value":"9783540466000"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54945-5_75","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T23:19:50Z","timestamp":1330211990000},"page":"308-315","source":"Crossref","is-referenced-by-count":3,"title":["Symmetry of information and one-way functions"],"prefix":"10.1007","author":[{"given":"Luc","family":"Longpr\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarah","family":"Mocas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"E. Allender. Some consequences of the existence of pseudorandom generators. In Proc. 19th Annual ACM Symposium on Theory of Computing, pages 151\u2013159, 1987.","DOI":"10.1145\/28395.28412"},{"key":"34_CR2","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1145\/321356.321363","volume":"13","author":"G. Chaitin","year":"1966","unstructured":"G. Chaitin. On the length of programs for computing finite binary sequences. J. Assoc. Comput. Mach., 13:547\u2013569, 1966.","journal-title":"J. Assoc. Comput. Mach."},{"key":"34_CR3","first-page":"1477","volume":"15","author":"P. G\u00e1cs","year":"1974","unstructured":"P. G\u00e1cs. On the symmetry of algorithmic information. Soviet Math. Dokl., 15:1477, 1974.","journal-title":"Soviet Math. Dokl."},{"key":"34_CR4","unstructured":"O. Goldreich, H. Krawczyk, and M. Luby. On the existence of pseudo-random generators. In Proc. 21st Annual ACM Symposium on Theory of Computing, pages 25\u201332, 1989."},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad. Pseudo-random generators under uniform assumptions. In Proc. 22nd Annual ACM Symposium on Theory of Computing, pages 395\u2013404, 1990.","DOI":"10.1145\/100216.100270"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, L. Levin, and M. Luby. Pseudo-random generation from oneway functions. In Proc. 21st Annual ACM Symposium on Theory of Computing, pages 12\u201324, 1989.","DOI":"10.1145\/73007.73009"},{"key":"34_CR7","first-page":"1","volume":"1","author":"A. Kolmogorov","year":"1965","unstructured":"A. Kolmogorov. Three approaches for defining the concept of information quantity. Prob. Inform. Trans., 1:1\u20137, 1965.","journal-title":"Prob. Inform. Trans."},{"key":"34_CR8","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/TIT.1968.1054210","volume":"IT-14.5","author":"A. Kolmogorov","year":"1968","unstructured":"A. Kolmogorov. Logical basis for information theory and probability theory. IEEE Trans. Information theory, IT-14.5:662\u2013664, 1968.","journal-title":"IEEE Trans. Information theory"},{"key":"34_CR9","first-page":"206","volume":"10","author":"L. Levin","year":"1974","unstructured":"L. Levin. Laws of information conservation (non-growth) and aspects of the foundation of probability theory. Problems in Information Transmission, 10:206\u2013210, 1974.","journal-title":"Problems in Information Transmission"},{"issue":"4","key":"34_CR10","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF02579323","volume":"7","author":"L. Levin","year":"1987","unstructured":"L. Levin. One-way functions and pseudorandom generators. Combinatorica, 7(4):357\u2013363, 1987.","journal-title":"Combinatorica"},{"key":"34_CR11","unstructured":"L. Longpr\u00e9. Resource bounded Kolmogorov complexity, a link between computational complexity and information theory. PhD thesis, Cornell University, 1986. Technical Report TR86-776."},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"M. Li and P.M.B. Vit\u00e1nyi. Two decades of applied kolmogorov complexity. In Proc. Structure in Complexity Theory third annual conference, pages 80\u2013101, 1988.","DOI":"10.1109\/SCT.1988.5265"},{"key":"34_CR13","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"C.E. Shannon. A mathematical theory of communication. Bell System Technical Journal, 27:479\u2013623 (Part I) and 623\u2013656 (Part II), 1948.","journal-title":"Bell System Technical Journal"},{"key":"34_CR14","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C.E. Shannon","year":"1949","unstructured":"C.E. Shannon. Communication theory of secrecy systems. Bell System Technical Journal, 28:656\u2013715, 1949.","journal-title":"Bell System Technical Journal"},{"key":"34_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"7","author":"R. Solomonoff","year":"1964","unstructured":"R. Solomonoff. A formal theory of inductive inference, part 1 and part 2. Information and Control, 7:1\u201322, 224\u2013254, 1964.","journal-title":"Information and Control"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"A. Yao. Theory and applications of trapdoor functions. In Proc. 23rd IEEE Symposium on Foundations of Computer Science, pages 80\u201391, 1982.","DOI":"10.1109\/SFCS.1982.45"},{"key":"34_CR17","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","volume":"25","author":"A.K. Zvonkin","year":"1970","unstructured":"A.K. Zvonkin and L.A. Levin. The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russ. Math. Surv., 25:83\u2013124, 1970.","journal-title":"Russ. Math. Surv."}],"container-title":["Lecture Notes in Computer Science","ISA'91 Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54945-5_75.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:25:10Z","timestamp":1742592310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54945-5_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540549451","9783540466000"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-54945-5_75","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}