{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T11:40:09Z","timestamp":1737632409597,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424567"},{"type":"electronic","value":"9783540446477"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44647-8_29","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T19:28:14Z","timestamp":1194982094000},"page":"486-502","source":"Crossref","is-referenced-by-count":0,"title":["Pseudorandomness from Braid Groups"],"prefix":"10.1007","author":[{"given":"Eonkyung","family":"Lee","sequence":"first","affiliation":[]},{"given":"Sang Jin","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Sang Geun","family":"Hahn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"W. Alexi, B. Chor, O. Goldreich, and C.P. Schnorr, RSA and Rabin functions: certain parts are as hard as the whole, SIAM J. Comput. 17 (1988) 194\u2013209.","journal-title":"SIAM J. Comput."},{"key":"29_CR2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.4310\/MRL.1999.v6.n3.a3","volume":"6","author":"I. Anshel","year":"1999","unstructured":"I. Anshel, M. Anshel, and D. Goldfeld, An algebraic method for public-key cryptography, Math. Res. Lett. 6 (1999) 287\u2013291.","journal-title":"Math. Res. Lett."},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway, Random oracles are Practical: a Paradigm for Designing Efficient Protocols, In 1st Annual Conference on Computer and Communications Security, ACM (1993) 62\u201373.","DOI":"10.1145\/168588.168596"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1142\/S0218216595000259","volume":"4","author":"D. Bernardete","year":"1995","unstructured":"D. Bernardete, Z. Nitecki and M. Gutierrez, Braids and the Niels en-Thurston classification, J. Knot theory and its ramifications 4 (1995) 549\u2013618.","journal-title":"J. Knot theory and its ramifications"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0040-9383(94)E0009-9","volume":"34","author":"M. Bestvina","year":"1995","unstructured":"M. Bestvina and M. Handel, Train Tracks for surface automorphisms, Topology 34 (1995) 109\u2013140.","journal-title":"Topology"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"J. Birman, Braids, links and the mapping class group, Ann. Math. Studies 82, Princeton Univ. Press (1974).","DOI":"10.1515\/9781400881420"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1006\/aima.1998.1761","volume":"139","author":"J.S. Birman","year":"1998","unstructured":"J.S. Birman, K.H. Ko, and S.J. Lee, New approaches to the world and conjugacy problem in the braid groups, Advances in Math. 139 (1998) 322\u2013353.","journal-title":"Advances in Math."},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudorandom bits, SIAM J. Comput. 13 (1984) 850\u2013864.","journal-title":"SIAM J. Comput."},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M.E. Hellman, New Directions in Cryptography, IEEE Trans. on Info. Theory, IT-22 (1976) 644\u2013654.","journal-title":"IEEE Trans. on Info. Theory"},{"key":"29_CR10","doi-asserted-by":"crossref","DOI":"10.1201\/9781439865699","volume-title":"Word processing in groups","author":"D.B.A. Epstein","year":"1992","unstructured":"D.B.A. Epstein, J.W. Cannon, D.F. Holt, S.V.F. Levy, M.S. Patterson, and W. Thurston, Word processing in groups, Jones and Barlett, Boston and London (1992)."},{"key":"29_CR11","unstructured":"A. Fathi, F. Laudenbach, and V. Po\u00e9naru, Travaux de Thurston sur les surfaces, Ast\u00e9risque (1979) 66\u201367."},{"key":"29_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/3-540-68339-9_22","volume-title":"Proc. Eurocrypt\u2019 96","author":"J.B. Fischer","year":"1996","unstructured":"J.B. Fischer and J. Stern, An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding, Proc. Eurocrypt\u2019 96, LNCS 1070, Springer-Verlag (1996) 245\u2013255."},{"key":"29_CR13","unstructured":"O. Goldreich, Foundation of Cryptography\u2014Fragments of a Book, Available at http:\/\/www.theory.lcs.mit.edu\/~oded\/frag.html (1995)."},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"O. Goldreich and L.A. Levin, Hard-core Predicates for any One-Way Function, 21st STOC (1989) 25\u201332.","DOI":"10.1145\/73007.73010"},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, and R. Rivest, A Digital signature scheme secure against adaptive chosen-message attacks, SIAM J. Comput. 17 (1988) 281\u2013308.","journal-title":"SIAM J. Comput."},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. Hastad","year":"1999","unstructured":"J. Hastad, R. Impaglizo, L.A. Levin, and M. Luby, A Pseudorandom Generator from any One-way Function, SIAM J. Comput. 28 (1999) 1364\u20131396.","journal-title":"SIAM J. Comput."},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and M. Naor, Efficient cryptographic schemes provably as secure as subset sum, Proc. IEEE 30th Symp. on Found. of Comput. Sci. (1989) 231\u2013241.","DOI":"10.1109\/SFCS.1989.63484"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and D. Zuckerman, Reclying random bits, Proc. 30th IEEE Symposium on Foundations of Computer Science (1989) 248\u2013253.","DOI":"10.1109\/SFCS.1989.63486"},{"key":"29_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/3-540-44598-6_10","volume-title":"Proc. Crypto 2000","author":"K.H. Ko","year":"2000","unstructured":"K.H. Ko, S.J. Lee, J.H. Cheon, J.W. Han, J.S. Kang, and C. Park, New Public-key Cryptosystem Using Braid Groups, Proc. Crypto 2000, LNCS 1880, Springer-Verlag (2000) 166\u2013183."},{"key":"29_CR20","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1112\/plms\/s3-66.2.400","volume":"66","author":"J. Los","year":"1993","unstructured":"J. Los, Pseudo-Anosov maps and invariant train track in the disc: a finite algorithm, Proc. Lond. Math. Soc. 66 (1993) 400\u2013430.","journal-title":"Proc. Lond. Math. Soc."},{"key":"29_CR21","unstructured":"J. McCarthy, Normalizers and centralizers of psuedo-Anosov mapping clases, Available at http:\/\/www.mth.msu.edu\/~mccarthy\/research\/ ."},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"M. Naor and O. Reingold, Number-Theoretic constructions of efficient pseudorandom functions, Proc. 38th IEEE Symp. on Foundations of Computer Science (1997) 458\u2013467.","DOI":"10.1109\/SFCS.1997.646134"},{"key":"29_CR23","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1006\/jcss.1998.1618","volume":"58","author":"M. Naor","year":"1999","unstructured":"M. Naor and O. Reingold, Synthesizers and their application to the parallel construction of pseudo-random functions, J. of Computer and Systems Sciences 58 (1999) 336\u2013375.","journal-title":"J. of Computer and Systems Sciences"},{"key":"29_CR24","doi-asserted-by":"crossref","unstructured":"J. Nielsen, In Collected papers of J. Nielsen, Birkhauser (1986).","DOI":"10.2307\/1444902"},{"key":"29_CR25","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1090\/S0273-0979-1988-15685-6","volume":"19","author":"W. P. Thurston","year":"1988","unstructured":"W. P. Thurston, On the geometry and dynamics of diffeomorphisms of surfaces, Bull. AMS 19 (1988) 417\u2013431.","journal-title":"Bull. AMS"},{"key":"29_CR26","doi-asserted-by":"crossref","unstructured":"A. Yao, Theory and applications of trapdoor functions, Proc. 23rd IEEE Symp. of Found. of Comput. Sci. (1982) 80\u201391.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44647-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T08:08:45Z","timestamp":1737533325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44647-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424567","9783540446477"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-44647-8_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}