{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:40:36Z","timestamp":1725752436846},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642412264"},{"type":"electronic","value":"9783642412271"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41227-1_15","type":"book-chapter","created":{"date-parts":[[2013,10,15]],"date-time":"2013-10-15T05:04:52Z","timestamp":1381813492000},"page":"249-270","source":"Crossref","is-referenced-by-count":1,"title":["Translation-Randomizable Distributions via Random Walks"],"prefix":"10.1007","author":[{"given":"Nirattaya","family":"Khamsemanan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"III","given":"William E.","family":"Skeith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0022-0000(89)90018-4","volume":"39","author":"M. Abadi","year":"1989","unstructured":"Abadi, M., Feigenbaum, J., Kilian, J.: On hiding information form an oracle. J. Comput. Syst. Sci.\u00a039, 21\u201350 (1989), \n                    \n                      http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.35.5151","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Gentry, C., Halevi, S., Sahai, A.: Discrete gaussian leftover hash lemma over infinite domains. Cryptology ePrint Archive, Report 2012\/714 (2012), \n                    \n                      http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-42033-7_6"},{"issue":"2","key":"15_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0022-0000(92)90019-F","volume":"44","author":"S. Ben-David","year":"1992","unstructured":"Ben-David, S., Chor, B., Goldreich, O., Luby, M.: On the theory of average case complexity. Journal of Computer and system Sciences\u00a044(2), 193\u2013219 (1992)","journal-title":"Journal of Computer and system Sciences"},{"key":"15_CR4","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., Galbraith, S.D.: 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":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-54487-9_50","volume-title":"Computer Science Logic","author":"A. Blass","year":"1991","unstructured":"Blass, A., Gurevich, Y.: On the reduction theory for average case complexity. In: Sch\u00f6nfeld, W., B\u00f6rger, E., Kleine B\u00fcning, H., Richter, M.M. (eds.) CSL 1990. LNCS, vol.\u00a0533, pp. 17\u201330. Springer, Heidelberg (1991)"},{"issue":"1","key":"15_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1137\/S0097539792232070","volume":"24","author":"A. Blass","year":"1995","unstructured":"Blass, A., Gurevich, Y.: Matrix transformation is complete for the average case. SIAM Journal on Computing\u00a024(1), 3\u201329 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR7","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 pseudo-random bits. SIAM J. Comput.\u00a013, 850\u2013864 (1984), \n                    \n                      http:\/\/portal.acm.org\/citation.cfm?id=2054.2068","journal-title":"SIAM J. Comput."},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/conm\/298\/05112","volume":"298","author":"A. Borovik","year":"2002","unstructured":"Borovik, A., Myasnikov, A., Shpilrain, V.: Measuring sets in infinite groups. Contemporary Mathematics\u00a0298, 21\u201342 (2002)","journal-title":"Contemporary Mathematics"},{"issue":"6","key":"15_CR9","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"-22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory\u00a0IT-22(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory IT"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1137\/0222061","volume":"22","author":"J. Feigenbaum","year":"1991","unstructured":"Feigenbaum, J., Fortnow, L.: On the random-self-reducibility of complete sets. SIAM Journal on Computing\u00a022, 994\u20131005 (1991), \n                    \n                      http:\/\/www.cs.uchicago.edu\/~fortnow\/papers\/rsr.pdf","journal-title":"SIAM Journal on Computing"},{"key":"15_CR11","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":"15_CR12","volume-title":"Foundations of Cryptography: Basic Tools","author":"O. Goldreich","year":"2000","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press, New York (2000)"},{"issue":"2","key":"15_CR13","first-page":"270","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. JCSS\u00a028(2), 270\u2013299 (1984)","journal-title":"JCSS"},{"issue":"3","key":"15_CR14","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/0022-0000(91)90007-R","volume":"42","author":"Y. Gurevich","year":"1991","unstructured":"Gurevich, Y.: Average case completeness. Journal of Computer and System Sciences\u00a042(3), 346\u2013398 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR15","unstructured":"Hughes, J., Tannenbaum, A.: Length-based attacks for certain group based encryption rewriting systems. arXiv preprint cs\/0306032 (2003)"},{"issue":"2","key":"15_CR16","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.aim.2003.02.001","volume":"190","author":"I. Kapovich","year":"2005","unstructured":"Kapovich, I., Myasnikov, A., Schupp, P., Shpilrain, V.: Average-case complexity and decision problems in group theory. Advances in Mathematics\u00a0190(2), 343\u2013359 (2005)","journal-title":"Advances in Mathematics"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Khamsemanan, N., Skeith, W.E.: Translation-randomizable distributions via random walks. Tech. rep., The City College of New York, CUNY (2013)","DOI":"10.1007\/978-3-642-41227-1_15"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-540-30539-2_9","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"E. Lee","year":"2004","unstructured":"Lee, E.: Right-invariance: A property for probabilistic analysis of cryptography based on infinite groups. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 103\u2013118. Springer, Heidelberg (2004)"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/3-540-39200-9_30","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"E. Lee","year":"2003","unstructured":"Lee, E., Park, J.H.: Cryptanalysis of the public-key encryption based on braid groups. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 477\u2013490. Springer, Heidelberg (2003)"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Levin, L.: Problems, complete in average instance. In: Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, p. 465. ACM (1984)","DOI":"10.1145\/800057.808713"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Mairesse, J., Math\u00e9us, F.: Randomly growing braid on three strands and the manta ray. The Annals of Applied Probability, 502\u2013536 (2007)","DOI":"10.1214\/105051606000000754"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-540-71677-8_6","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"A.D. Myasnikov","year":"2007","unstructured":"Myasnikov, A.D., Ushakov, A.: Length based attack and braid groups: Cryptanalysis of anshel-anshel-goldfeld key exchange protocol. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 76\u201388. Springer, Heidelberg (2007)"},{"key":"15_CR23","unstructured":"Pak, I.: Random walks on groups: strong uniform time approach. Ph.D. thesis, Harvard University (1997)"},{"key":"15_CR24","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. Electron. J. Probab\u00a04, 1\u201311 (1999)","journal-title":"Electron. J. Probab"},{"key":"15_CR25","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM\u00a021, 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/3-540-56287-7_100","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"R. Schuler","year":"1992","unstructured":"Schuler, R., Yamakami, T.: Structural average case complexity. In: Shyamasundar, R.K. (ed.) FSTTCS 1992. LNCS, vol.\u00a0652, pp. 128\u2013139. Springer, Heidelberg (1992)"},{"key":"15_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511470967","volume-title":"Random Walks on Infinite Graphs and Groups","author":"W. Woess","year":"2000","unstructured":"Woess, W.: Random Walks on Infinite Graphs and Groups. Cambridge University Press, New York (2000)"},{"issue":"4","key":"15_CR28","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1006\/jcom.1999.0523","volume":"15","author":"T. Yamakami","year":"1999","unstructured":"Yamakami, T.: Polynomial time samplable distributions. Journal of Complexity\u00a015(4), 557\u2013574 (1999)","journal-title":"Journal of Complexity"}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41227-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T15:33:00Z","timestamp":1580311980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41227-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642412264","9783642412271"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41227-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}