{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T08:12:15Z","timestamp":1771488735647,"version":"3.50.1"},"publisher-location":"New York, NY","reference-count":13,"publisher":"Springer New York","isbn-type":[{"value":"9780387973173","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-34805-0_42","type":"book-chapter","created":{"date-parts":[[2007,11,9]],"date-time":"2007-11-09T02:05:53Z","timestamp":1194573953000},"page":"461-480","source":"Crossref","is-referenced-by-count":121,"title":["On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses"],"prefix":"10.1007","author":[{"given":"Yuliang","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Tsutomu","family":"Matsumoto","sequence":"additional","affiliation":[]},{"given":"Hideki","family":"Imai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"42_CR1","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum and S. Micali: \u201cHow to generate cryptographically strong sequences of pseudo-random bits,\u201d SIAM Journal on Computing, Vol. 13, No. 4, (1984), pp.850\u2013864.","journal-title":"SIAM Journal on Computing"},{"issue":"11","key":"42_CR2","doi-asserted-by":"publisher","first-page":"1545","DOI":"10.1109\/PROC.1975.10005","volume":"63","author":"H. Feistel","year":"1975","unstructured":"H. Feistel, W.A. Notz and J.L. Smith: \u201cSome cryptographic techniques for machine-to-machine data communications,\u201d Proceedings of IEEE, Vol. 63, No. 11, (1975), pp.1545\u20131554.","journal-title":"Proceedings of IEEE"},{"issue":"4","key":"42_CR3","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser and S. Micali: \u201cHow to construct random functions,\u201d Journal of ACM, Vol. 33, No. 4, (1986), pp.792\u2013807.","journal-title":"Journal of ACM"},{"key":"42_CR4","unstructured":"A.G. Konheim: Cryptography: A Primer, John Wiley & Sons, Inc. (1981)."},{"issue":"4","key":"42_CR5","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02579323","volume":"7","author":"L.A. Levin: \u201c","year":"1987","unstructured":"L.A. Levin: \u201cOne-way functions and pseudorandom generators,\u201d Combinatorica, Vol. 7, No. 4, (1987), pp.357\u2013363.","journal-title":"Combinatorica"},{"issue":"2","key":"42_CR6","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"M. Luby and C. Rackoff: \u201cHow to construct pseudorandom permutations from pseudorandom functions,\u201d SIAM Journal on Computing, Vol. 17, No. 2, (1988), pp.373\u2013386.","journal-title":"SIAM Journal on Computing"},{"key":"42_CR7","first-page":"1119","volume":"47","author":"C.H. Meyer: \u201c","year":"1978","unstructured":"C.H. Meyer: \u201cCiphertext\/plaintext and ciphertext\/key dependence vs number of rounds for the data encryption standard,\u201d AFIPS Conference Proceedings, Vol. 47, (1978), pp.1119\u20131126.","journal-title":"AFIPS Conference Proceedings"},{"key":"42_CR8","unstructured":"Data Encryption Standard, Federal Information Processing Standards (FIPS) Publication 46, National Bureau of Standards, U.S. Department of Commerce, (1977)."},{"key":"42_CR9","volume-title":"A study on data security","author":"Y. Ohnishi: \u201c","year":"1988","unstructured":"Y. Ohnishi: \u201cA study on data security,\u201d Master Thesis (in Japanese), Tohoku University, Japan, (1988)."},{"key":"42_CR10","unstructured":"R.A. Rueppel: \u201cOn the security of Schnorr\u2019s pseudorandom generator,\u201d Presented at EUROCRYPT\u201989, Houthalen, (April 10\u201313, 1989)."},{"key":"42_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/3-540-45961-8_19","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201988","author":"C.P. Schnorr: \u201c","year":"1988","unstructured":"C.P. Schnorr: \u201cOn the construction of random number generators and random function generators,\u201d Advances in Cryptology \u2014 EUROCRYPT\u201988, LNCS Vol. 330, Springer-Verlag, (1988), pp.225\u2013232."},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"A.C. Yao: \u201cTheory and applications of trapdoor functions,\u201d Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, (1982), pp.80\u201391.","DOI":"10.1109\/SFCS.1982.45"},{"key":"42_CR13","unstructured":"Y. Zheng, T. Matsumoto and H. Imai: \u201cImpossibility and optimality results on constructing pseudorandom permutations,\u201d Presented at EUROCRYPT\u201989, Houthalen, (April 10\u201313, 1989)."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-34805-0_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:28:20Z","timestamp":1619501300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-34805-0_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387973173"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/0-387-34805-0_42","relation":{},"subject":[]}}