{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:18:31Z","timestamp":1725549511088},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540239758"},{"type":"electronic","value":"9783540305392"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30539-2_9","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T08:41:57Z","timestamp":1268383317000},"page":"103-118","source":"Crossref","is-referenced-by-count":2,"title":["Right-Invariance: A Property for Probabilistic Analysis of Cryptography Based on Infinite Groups"],"prefix":"10.1007","author":[{"given":"Eonkyung","family":"Lee","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Angluin, D., Lichtenstein, D.: Provable Security of Cryptosystmes: A Survey, Computer Science Department, Yale University, TR-288 (1983)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45353-9_2","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"I. Anshel","year":"2001","unstructured":"Anshel, I., Anshel, M., Fisher, B., Goldfeld, D.: New Key Agreement Protocols in Braid Group Cryptography. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 13\u201327. Springer, Heidelberg (2001)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-48000-6_6","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"S.R. Blackburn","year":"1999","unstructured":"Blackburn, S.R.: Cryptanalysis of two cryptosystems based on group actions. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 52\u201361. Springer, Heidelberg (1999)"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits. SIAM J. Comput.\u00a013, 850\u2013864 (1984)","journal-title":"SIAM J. Comput."},{"key":"9_CR5","unstructured":"Borovik, A.V., Myasnikov, A.G., Remeslennikov, V.N.: Multiplicative Measures on Free Groups. To appear in Internat. J. Algebra Comp."},{"key":"9_CR6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1090\/conm\/298\/05112","volume":"298","author":"A.V. Borovik","year":"2002","unstructured":"Borovik, A.V., Myasnikov, A.G., Shpilrain, V.: Measuring Sets in Infinite Groups. Contemporary Mathematics\u00a0298, 21\u201342 (2002)","journal-title":"Contemporary Mathematics"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-540-45146-4_13","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J.H. Cheon","year":"2003","unstructured":"Cheon, J.H., Jun, B.: A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 212\u2013225. Springer, Heidelberg (2003)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J.: Locally Random Reductions in Interactive Complexity Theory. Advances in Computational Complexity Theory, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS 13, 73\u201398 (1993)","DOI":"10.1090\/dimacs\/013\/05"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(91)90074-C","volume":"88","author":"M. Garzon","year":"1991","unstructured":"Garzon, M., Zalcstein, Y.: The Complexity of Grigorchuk Groups with Application to Cryptography. Theoretical Computer Sciences\u00a088, 83\u201388 (1991)","journal-title":"Theoretical Computer Sciences"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-46035-7_1","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"R. Gennaro","year":"2002","unstructured":"Gennaro, R., Micciancio, D.: Cryptanalysis of a Pseudorandom Generator Based on Braid Groups. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 1\u201313. Springer, Heidelberg (2002)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-36288-6_14","volume-title":"Public Key Cryptography - PKC 2003","author":"D. Hofheinz","year":"2002","unstructured":"Hofheinz, D., Steinwandt, R.: A Practical Attack on Some Braid Group based Cryptographic Primitives. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 187\u2013198. Springer, Heidelberg (2002)"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-45450-0_15","volume-title":"Information Security and Privacy","author":"J. Hughes","year":"2002","unstructured":"Hughes, J.: A Linear Algebraic Attack on the AAFG1 Braid Group Cryptosystem. In: Batten, L.M., Seberry, J. (eds.) ACISP 2002. LNCS, vol.\u00a02384, pp. 176\u2013189. Springer, Heidelberg (2002)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-44598-6_10","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"K.H. Ko","year":"2000","unstructured":"Ko, K.H., Lee, S.J., Cheon, J.H., Han, J.W., Kang, J.S., Park, C.: New Public-key Cryptosystem Using Braid Groups. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 166\u2013183. Springer, Heidelberg (2000)"},{"key":"9_CR14","unstructured":"Lee, E.: Braid Groups in Cryptology. IEICE Trans. Fund. 7-A, 986\u2013992 (2004)"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/3-540-44647-8_29","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"E. Lee","year":"2001","unstructured":"Lee, E., Lee, S.J., Hahn, S.G.: Pseudorandomness from Braid Groups. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 486\u2013502. Springer, Heidelberg (2001)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/3-540-39200-9_30","volume-title":"High Performance Computing for Computational Science - VECPAR 2002","author":"E. Lee","year":"2003","unstructured":"Lee, E., Park, J.H.: Cryptanalysis of the Public-key Encryption based on Braid Groups. In: Palma, J.M.L.M., Sousa, A.A., Dongarra, J., Hern\u00e1ndez, V. (eds.) VECPAR 2002. LNCS, vol.\u00a02565, pp. 477\u2013490. Springer, Heidelberg (2003)"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-46035-7_2","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"S.J. Lee","year":"2002","unstructured":"Lee, S.J., Lee, E.: Potential Weaknesses of the Commutator Key Agreement Protocol based on Braid Groups. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 14\u201328. Springer, Heidelberg (2002)"},{"key":"9_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/ECP.v4-999","volume":"4","author":"I. Pak","year":"1999","unstructured":"Pak, I.: Random Walks on Finite Groups with Few Random Generators. Electronic J. of Prob.\u00a04, 1\u201311 (1999)","journal-title":"Electronic J. of Prob."},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time Algorithms for Prime Factorization and Discrete Logarithms on a quantum Computer. SIAM J. Comput.\u00a026, 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"9_CR20","unstructured":"Sibert, H., Dehornoy, P., Girault, M.: Entity Authentication Schemes Using Braid Word Reduction. In: Proceedings International Workshop on Coding and Cryptography, Versailles, France, March 24-28, pp. 153\u2013164 (2003)"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0020-0190(90)90170-3","volume":"35","author":"R. Siromoney","year":"1990","unstructured":"Siromoney, R., Mathew, L.: A Public key Cryptosystem based on Lyndon Words. Information Processing Letters\u00a035, 33\u201336 (1990)","journal-title":"Information Processing Letters"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BFb0054026","volume-title":"Public Key Cryptography","author":"A. Yamamura","year":"1998","unstructured":"Yamamura, A.: Public-Key Cryptosystems Using the Modular Group. In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol.\u00a01431, pp. 203\u2013216. Springer, Heidelberg (1998)"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/3-540-48970-3_26","volume-title":"Information Security and Privacy","author":"A. Yamamura","year":"1999","unstructured":"Yamamura, A.: A Functional Cryptosystem Using a Group Action. In: Pieprzyk, J.P., Safavi-Naini, R., Seberry, J. (eds.) ACISP 1999. LNCS, vol.\u00a01587, pp. 314\u2013325. Springer, Heidelberg (1999)"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-39568-7_3","volume-title":"Advances in Cryptology","author":"N.R. Wagner","year":"1985","unstructured":"Wagner, N.R., Magyarik, M.R.: A Public-key Cryptosystem based on the Word Problem. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 19\u201336. Springer, Heidelberg (1985)"},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/BF01371408","volume":"41","author":"W. Woess","year":"1983","unstructured":"Woess, W.: Cogrowth of groups and simple Random Walks. Arch. Math.\u00a041, 363\u2013370 (1983)","journal-title":"Arch. Math."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30539-2_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:59:14Z","timestamp":1605743954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30539-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540239758","9783540305392"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30539-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}