{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:55:16Z","timestamp":1764996916360},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642215179"},{"type":"electronic","value":"9783642215186"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21518-6_1","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T11:34:59Z","timestamp":1310988899000},"page":"1-17","source":"Crossref","is-referenced-by-count":7,"title":["New Constructions of Public-Key Encryption Schemes from Conjugacy Search Problems"],"prefix":"10.1007","author":[{"given":"Lihua","family":"Wang","sequence":"first","affiliation":[]},{"given":"Licheng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Zhenfu","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Eiji","family":"Okamoto","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Shao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-45353-9_12","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"M. Abdalla","year":"2001","unstructured":"Abdalla, M., Bellare, M., Rogaway, P.: The oracle diffie-hellman assumptions and an analysis of DHIES. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 143\u2013158. Springer, Heidelberg (2001)"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"287","DOI":"10.4310\/MRL.1999.v6.n3.a3","volume":"6","author":"I. Anshel","year":"1999","unstructured":"Anshel, I., Anshel, M., Goldfeld, D.: An algebraic method for public key cryptography. Math. Research Letters\u00a0(6), 287\u2013291 (1999)","journal-title":"Math. Research Letters"},{"issue":"3","key":"1_CR3","doi-asserted-by":"publisher","first-page":"221","DOI":"10.4171\/GGD\/12","volume":"1","author":"J.S. Birman","year":"2007","unstructured":"Birman, J.S., Gebhardt, V., Gonz\u00e1lez-Meneses, J.: Conjugacy in garside groups I: Cyclings, powers, and rigidity. Groups, Geometry and Dynamics\u00a01(3), 221\u2013279 (2007)","journal-title":"Groups, Geometry and Dynamics"},{"issue":"2","key":"1_CR4","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1016\/j.jalgebra.2007.02.002","volume":"316","author":"J.S. Birman","year":"2007","unstructured":"Birman, J.S., Gebhardt, V., Gonz\u00e1lez-Meneses, J.: Conjugacy in garside groups III: periodic braids. J. Algebra\u00a0316(2), 746\u2013776 (2007)","journal-title":"J. Algebra"},{"issue":"1","key":"1_CR5","doi-asserted-by":"crossref","first-page":"16","DOI":"10.4171\/ggd\/30","volume":"2","author":"J.S. Birman","year":"2008","unstructured":"Birman, J.S., Gebhardt, V., Gonz\u00e1lez-Meneses, J.: Conjugacy in garside groups II: Structure of the ultra summit set. Groups, Geometry and Dynamics\u00a02(1), 16\u201331 (2008)","journal-title":"Groups, Geometry and Dynamics"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-78967-3_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"D.M. Cash","year":"2008","unstructured":"Cash, D.M., Kiltz, E., Shoup, V.: The twin diffie-hellman problem and applications. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 127\u2013145. Springer, Heidelberg (2008)"},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S0097539702403773","volume":"33","author":"R. Cramer","year":"2003","unstructured":"Cramer, R., Shoup, V.: Design and analysis of practical public-key encryption schemes secure against chosen ciphertext attack. SIAM Journal on Computing\u00a033(1), 167\u2013226 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1090\/conm\/360\/06566","volume":"360","author":"P. Dehornoy","year":"2004","unstructured":"Dehornoy, P.: Braid-based cryptography. Contemp. Math.\u00a0360, 5\u201333 (2004)","journal-title":"Contemp. Math."},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1090\/conm\/418\/07946","volume":"418","author":"P. Dehornoy","year":"2006","unstructured":"Dehornoy, P.: Using shifted conjugacy in braid-based cryptography. Contemporary Mathematics\u00a0418, 65\u201374 (2006)","journal-title":"Contemporary Mathematics"},{"issue":"5","key":"1_CR10","doi-asserted-by":"publisher","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\u00a022(5), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"1_CR11","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory\u00a031(4), 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"key":"1_CR12","unstructured":"Eric, W.: Conjugate Element, http:\/\/mathworld.wolfram.com\/ConjugateElement.html"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-49162-7_5","volume-title":"Public Key Cryptography","author":"E. Fujisaki","year":"1999","unstructured":"Fujisaki, E., Okamoto, T.: How to enhance the security of public-key encryption at minimum cost. In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol.\u00a01560, pp. 53\u201368. Springer, Heidelberg (1999)"},{"key":"1_CR14","unstructured":"Gastineau, M.: Multiplication of polynomials. Technique Report at Advanced School on Specific Algebraic Manipulators, ASD\/IMCCE\/CNRS, France (2007)"},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1515\/GCC.2009.199","volume":"1","author":"D. Grigoriev","year":"2009","unstructured":"Grigoriev, D., Shpilrain, V.: Authentication from matrix conjugation. Groups, Complexity and Cryptology\u00a01(2), 199\u2013205 (2009)","journal-title":"Groups, Complexity and Cryptology"},{"key":"1_CR16","unstructured":"Hughes, J.: The LeftSSS attack on Ko-Lee-Cheon-Han-Kang-Park Key Agreement Protocol in B45. In: Rump Session Crypto 2000 (2000)"},{"issue":"3","key":"1_CR17","first-page":"1","volume":"3","author":"A. Kitaev","year":"1996","unstructured":"Kitaev, A.: Quantum measurements and the abelian stabilizer problem. Electronic Colloquium on Computational Complexity (ECCC)\u00a03(3), 1\u201322 (1996)","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"issue":"3","key":"1_CR18","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10623-007-9123-0","volume":"45","author":"K.H. Ko","year":"2007","unstructured":"Ko, K.H., Lee, J., Thomas, T.: Towards generating secure keys for braid. Designs, Codes and Cryptography\u00a045(3), 317\u2013333 (2007)","journal-title":"Designs, Codes and Cryptography"},{"key":"1_CR19","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.: New public-key cryptosystem using braid groups. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 166\u2013183. Springer, Heidelberg (2000)"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-540-27800-9_21","volume-title":"Information Security and Privacy","author":"K. Kurosawa","year":"2004","unstructured":"Kurosawa, K., Matsuo, T.: How to remove MAC from DHIES. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol.\u00a03108, pp. 236\u2013247. Springer, Heidelberg (2004)"},{"issue":"5","key":"1_CR21","first-page":"986","volume":"E87-A","author":"E. Lee","year":"2004","unstructured":"Lee, E.: Braig groups in cryptography. IEICE Trans. Fundamentals\u00a0E87-A(5), 986\u2013992 (2004)","journal-title":"IEICE Trans. Fundamentals"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1515\/JMC.2008.005","volume":"2","author":"J. Longrigg","year":"2008","unstructured":"Longrigg, J., Ushakov, A.: Cryptanalysis of shifted conjugacy authentication protocol. Journal of Math. Cryptology\u00a0(2), 107\u2013114 (2008)","journal-title":"Journal of Math. Cryptology"},{"key":"1_CR23","first-page":"285","volume":"15","author":"S.S. Magliveras","year":"2002","unstructured":"Magliveras, S.S., Stinson, D.R., Trung, T.: New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups. Journal of Cryptography\u00a015, 285\u2013297 (2002)","journal-title":"Journal of Cryptography"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11586821_1","volume-title":"Cryptography and Coding","author":"U.M. Maurer","year":"2005","unstructured":"Maurer, U.M.: Abstract models of computation in cryptography. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol.\u00a03796, pp. 1\u201312. Springer, Heidelberg (2005)"},{"key":"1_CR25","unstructured":"Prasolov, M.: Small braids having a big ultra summit set, http:\/\/arxiv.org\/abs\/0906.0076"},{"key":"1_CR26","doi-asserted-by":"crossref","first-page":"317","DOI":"10.26421\/QIC3.4-3","volume":"3","author":"J. Proos","year":"2003","unstructured":"Proos, J., Zalka, C.: Shor\u2019s discrete logarithm quantum algorithm for elliptic curves. Quantum Information and Computation\u00a03, 317\u2013344 (2003)","journal-title":"Quantum Information and Computation"},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"5","author":"P. Shor","year":"1997","unstructured":"Shor, P.: Polynomail-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput.\u00a05, 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-540-68914-0_22","volume-title":"Applied Cryptography and Network Security","author":"V. Shpilrain","year":"2008","unstructured":"Shpilrain, V., Ushakov, A.: An authentication scheme based on the twisted conjugacy problem. In: Bellovin, S.M., Gennaro, R., Keromytis, A.D., Yung, M. (eds.) ACNS 2008. LNCS, vol.\u00a05037, pp. 366\u2013372. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21518-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T20:02:48Z","timestamp":1712606568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21518-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215179","9783642215186"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21518-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}