{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:51:48Z","timestamp":1743033108094,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":29,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811554100"},{"type":"electronic","value":"9789811554117"}],"license":[{"start":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T00:00:00Z","timestamp":1606348800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T00:00:00Z","timestamp":1606348800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-981-15-5411-7_7","type":"book-chapter","created":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T16:04:27Z","timestamp":1606320267000},"page":"97-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Theory and Application of Computationally-Independent One-Way Functions: Interactive Proof of Ability\u2014Revisited"],"prefix":"10.1007","author":[{"given":"Sabyasachi","family":"Dutta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kouichi","family":"Sakurai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,26]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Alwen, J., Dodis, Y., Wichs, D.: Survey: leakage resilience and the bounded retrieval model. In: ICITS 2009, pp. 1\u201318 (2009)","DOI":"10.1007\/978-3-642-14496-7_1"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Bao, F., Deng, R.H., Zhu, H.: Variations of Diffie-Hellman problem. In: ICICS\u201903, pp. 301\u2013312 (2003)","DOI":"10.1007\/978-3-540-39927-8_28"},{"issue":"2","key":"7_CR3","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1016\/j.amc.2005.03.016","volume":"172","author":"F Bao","year":"2006","unstructured":"Bao, F., Lee, C.-C., Hwang, M.-S.: Cryptanalysis and improvement on batch verifying multiple RSA digital signatures. Appl. Math. Comput. 172(2), 1195\u20131200 (2006)","journal-title":"Appl. Math. Comput."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Goldreich, O.: Proving computational ability. Studies in Complexity and Cryptography 2011, pp. 6\u201312 (2011)","DOI":"10.1007\/978-3-642-22670-0_2"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"den Boer, B.: Diffie-Hellman is as strong as discrete log for certain primes. In: CRYPTO\u201988, pp. 530\u2013539 (1988)","DOI":"10.1007\/0-387-34799-2_38"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R., Dodis, Y., Halevi, S., Kushilevitz, E., Sahai, A.: Exposure-resilient functions and all-or-nothing transforms. In: EUROCRYPT 2000, pp. 453\u2013469 (2000)","DOI":"10.1007\/3-540-45539-6_33"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Chaum, D., Evertse, J.-H., van de Graaf, J., Peralta, R.: Demonstrating possession of a discrete logarithm without revealing it. In: CRYPTO\u201986, pp. 200\u2013212 (1986)","DOI":"10.1007\/3-540-47721-7_14"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Damgard, I.: Collision free hash functions and public key signature schemes. In: EUROCRYPT\u201987, pp. 203\u2013216 (1987)","DOI":"10.1007\/3-540-39118-5_19"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Reyzin, L.: On the power of claw-free permutations. In: SCN\u201902, pp. 55\u201373 (2002)","DOI":"10.1007\/3-540-36413-7_5"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Haralambiev, K., Lpez-Alt, A., Wichs, D.: Cryptography against continuous memory attacks. In: FOCS 2010, pp. 511\u2013520 (2010)","DOI":"10.1109\/FOCS.2010.56"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Dutta, S., Sakurai, K.: Theory and application of computationally independent one-way functions: interactive proof of ability - revisited. Cryptology ePrint Archive: Report 2019\/323 (2019)","DOI":"10.1007\/978-981-15-5411-7_7"},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U Feige","year":"1988","unstructured":"Feige, U., Fiat, A., Shamir, A.: Zero-knowledge proofs of identity. J. Cryptol. 1(2), 77\u201394 (1988)","journal-title":"J. Cryptol."},{"issue":"3","key":"7_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00208001","volume":"9","author":"O Goldreich","year":"1996","unstructured":"Goldreich, O., Kahan, A.: How to construct constant-round zero-knowledge proof systems for NP. J. Cryptol. 9(3), 167\u2013190 (1996)","journal-title":"J. Cryptol."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A \u201cparadoxical\u201d solution to the signature problem (extended abstract). In: FOCS\u201984, pp. 441\u2013448 (1984)","DOI":"10.1109\/SFCS.1984.715946"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems (extended abstract). In: STOC\u201985, pp. 291\u2013304 (1985)","DOI":"10.1145\/22145.22178"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Komargodski, I.: Leakage resilient one-way functions: the auxiliary-input setting. In: TCC (B1) 2016, pp. 139\u2013158 (2016)","DOI":"10.1007\/978-3-662-53641-4_6"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Konoma, C., Mambo, M., Shizuya, H.: The computational difficulty of solving cryptographic primitive problems related to the discrete logarithm problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E88-A-1, 81\u201388 (2005)","DOI":"10.1093\/ietfec\/E88-A.1.81"},{"key":"7_CR18","unstructured":"Koyama, K.: Direct demonstration of the power to break public-key cryptosystems. In: AUSCRYPT 1990, pp. 14\u201321 (1990). https:\/\/link.springer.com\/chapter\/10.1007\/BFb0030346"},{"key":"7_CR19","unstructured":"Krawczyk, H., Rabin, T.: Chameleon signatures. In: NDSS\u201900, pp. 143\u2013154 (2000)"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Maurer, U.M.: Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete algorithms. In: CRYPTO\u201994, pp. 271\u2013281 (1994)","DOI":"10.1007\/3-540-48658-5_26"},{"key":"7_CR21","unstructured":"Maurer, U., Wolf, S.: Diffie-Hellman oracles. In: CRYPTO\u201996. LNCS, vol. 1109, pp. 268\u2013282 (1996)"},{"key":"7_CR22","unstructured":"Mitsunari, S., Sakai, R., Kasahara, M.: A new traitor tracing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E85-A-2, 481\u2013484 (2002)"},{"issue":"2","key":"7_CR23","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10623-011-9503-3","volume":"62","author":"D Roh","year":"2012","unstructured":"Roh, D., Hahn, S.G.: The square root Diffie-Hellman problem. Des. Codes Cryptogr. 62(2), 179\u2013187 (2012)","journal-title":"Des. Codes Cryptogr."},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Russell, A.: Necessary and sufficient conditions for collision-free hashing. In: CRYPTO\u201992, pp. 433\u2013441 (1992)","DOI":"10.1007\/3-540-48071-4_30"},{"key":"7_CR25","unstructured":"Sakurai, K., Inoue, T.: Note on some-one way functions (in Japanese). In: The Symposium of Cryptography and Information Security (SCIS\u201989), Gotenba, Japan, February 2\u20134 (1989) [available on request from K. Sakurai]"},{"issue":"3","key":"7_CR26","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1515\/JMC.2007.010","volume":"1","author":"DR Stinson","year":"2007","unstructured":"Stinson, D.R., Wu, J.: An efficient and secure two-flow zero-knowledge identification protocol. J. Math. Cryptol. 1(3), 201\u2013220 (2007)","journal-title":"J. Math. Cryptol."},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Tompa, M., Woll, H.: Random self-reducibility and zero knowledge interactive proofs of possession of information. In: FOCS\u201987, pp. 472\u2013482 (1987)","DOI":"10.1109\/SFCS.1987.49"},{"issue":"5","key":"7_CR28","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s002000050082","volume":"8","author":"ER Verheul","year":"1997","unstructured":"Verheul, E.R., Van Tilborg, H.C.A.: Cryptanalysis of \u2018less short\u2019 RSA secret exponents. Appl. Algebra Eng. Commun. Comput. 8(5), 425\u2013435 (1997)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Yung, M.: Zero-knowledge proofs of computational power (extended summary). In: EUROCRYPT\u201989, pp. 196\u2013207 (1989)","DOI":"10.1007\/3-540-46885-4_22"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the Fifth International Conference on Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-5411-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T20:10:59Z","timestamp":1669752659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-5411-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,26]]},"ISBN":["9789811554100","9789811554117"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-5411-7_7","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2020,11,26]]},"assertion":[{"value":"26 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}