{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T09:18:12Z","timestamp":1648718292402},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,5,19]],"date-time":"2015-05-19T00:00:00Z","timestamp":1431993600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s10207-015-0291-z","type":"journal-article","created":{"date-parts":[[2015,5,18]],"date-time":"2015-05-18T11:51:21Z","timestamp":1431949881000},"page":"67-79","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Strongly simulation-extractable leakage-resilient NIZK"],"prefix":"10.1007","volume":"15","author":[{"given":"Yuyu","family":"Wang","sequence":"first","affiliation":[]},{"given":"Keisuke","family":"Tanaka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,19]]},"reference":[{"key":"291_CR1","doi-asserted-by":"crossref","unstructured":"Akavia, A., Goldwasser, S., Vaikuntanathan, V.: Simultaneous hardcore bits and cryptography against memory attacks. In: Reingold, O. (ed.) Theory of Cryptography. Lecture Notes in Computer Science, vol. 5444, pp. 474\u2013495. Springer, Berlin Heidelberg (2009)","DOI":"10.1007\/978-3-642-00457-5_28"},{"key":"291_CR2","doi-asserted-by":"crossref","unstructured":"Alwen, J., Dodis, Y., Naor, M., Segev, G., Walfish, S., Wichs, D.: Public-key encryption in the bounded-retrieval model. In: Gilbert, H. (ed.) Advances in Cryptology\u2014EUROCRYPT 2010. Lecture Notes in Computer Science, vol. 6110, pp. 113\u2013134. Springer, Berlin Heidelberg (2010)","DOI":"10.1007\/978-3-642-13190-5_6"},{"key":"291_CR3","doi-asserted-by":"crossref","unstructured":"Alwen, J., Dodis, Y., Wichs, D.: Leakage-resilient public-key cryptography in the bounded-retrieval model. In: Halevi, S. (ed.) Advances in Cryptology\u2014CRYPTO 2009. Lecture Notes in Computer Science, vol. 5677, pp. 36\u201354. Springer, Berlin Heidelberg (2009)","DOI":"10.1007\/978-3-642-03356-8_3"},{"key":"291_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Shoup, S.: Two-tier signatures, strongly unforgeable signatures, and Fiat-Shamir without random oracles. In: Okamoto, T., Wang, X. (eds.) Public Key Cryptography\u2014PKC 2007. Lecture Notes in Computer Science, vol. 4450, pp. 201\u2013216 Springer, Berlin Heidelberg (2007)","DOI":"10.1007\/978-3-540-71677-8_14"},{"key":"291_CR5","doi-asserted-by":"crossref","unstructured":"Boneh, D., Shen, E., Waters, B.: Strongly unforgeable signatures based on computational Diffie-Hellman. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) Public Key Cryptography\u2014PKC 2006. Lecture Notes in Computer Science, vol. 3958, pp. 229\u2013240. Springer, Berlin Heidelberg (2006)","DOI":"10.1007\/11745853_15"},{"key":"291_CR6","doi-asserted-by":"crossref","unstructured":"Boyle, E., Segev, G., Wichs, D.: Fully leakage-resilient signatures. In: Paterson, K.G. (ed.) Advances in Cryptology\u2014EUROCRYPT 2011. Lecture Notes in Computer Science, vol. 6632, pp. 89\u2013108. Springer, Berlin Heidelberg (2011)","DOI":"10.1007\/978-3-642-20465-4_7"},{"key":"291_CR7","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Goldwasser, S.: Circular and leakage resilient public-key encryption under subgroup indistinguishability. In: Rabin, T. (ed.) Advances in Cryptology\u2014CRYPTO 2010. Lecture Notes in Computer Science, vol. 6223, pp. 1\u201320. Springer, Berlin Heidelberg (2010)","DOI":"10.1007\/978-3-642-14623-7_1"},{"key":"291_CR8","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Kalai, Y., Katz, J., Vaikuntanathan, V.: Overcoming the hole in the bucket: public-key cryptography resilient to continual memory leakage. In: Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on, pp. 501\u2013510. (2010)","DOI":"10.1109\/FOCS.2010.55"},{"key":"291_CR9","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Haralambiev, K., L\u00f3pez-Alt, A., Wichs, D.: Cryptography against continuous memory attacks. In: Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010, IEEE Computer Society, pp. 511\u2013520. (2010)","DOI":"10.1109\/FOCS.2010.56"},{"key":"291_CR10","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Haralambiev, K., L\u00f3pez-Alt, A., Wichs, D.: Efficient public-key cryptography in the presence of key leakage. In: Abe, M. (ed.) Advances in Cryptology\u2014ASIACRYPT 2010. Lecture Notes in Computer Science, vol. 6477, pp. 613\u2013631. Springer, Berlin Heidelberg (2010)","DOI":"10.1007\/978-3-642-17373-8_35"},{"key":"291_CR11","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Lewko, A., Waters, B., Wichs, D.: Storing secrets on continually leaky devices. In: Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on, pp. 688\u2013697. (2011)","DOI":"10.1109\/FOCS.2011.35"},{"issue":"1","key":"291_CR12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97\u2013139 (2008)","journal-title":"SIAM J. Comput."},{"key":"291_CR13","doi-asserted-by":"crossref","unstructured":"Garg, S., Jain, A., Sahai, A.: Leakage-resilient zero knowledge. In: Rogaway, P. (ed.) Advances in Cryptology\u2014CRYPTO 2011. Lecture Notes in Computer Science, vol. 6841, pp. 297\u2013315. Springer, Berlin Heidelberg (2011)","DOI":"10.1007\/978-3-642-22792-9_17"},{"key":"291_CR14","doi-asserted-by":"crossref","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: Perfect non-interactive zero knowledge for np. In: Vaudenay, S. (ed.) Advances in Cryptology\u2014EUROCRYPT 2006. Lecture Notes in Computer Science, vol. 4004, pp. 339\u2013358. Springer, Berlin Heidelberg (2006)","DOI":"10.1007\/11761679_21"},{"key":"291_CR15","doi-asserted-by":"crossref","unstructured":"Huang, Q., Wong, D. S., Zhao, Y.: Generic transformation to strongly unforgeable signatures. In: Katz, J., Yung, M. (eds.) Applied Cryptography and Network Security\u2014ACNS 2007. Lecture Notes in Computer Science, vol. 4521, pp. 1\u201317. Springer, Berlin Heidelberg (2007)","DOI":"10.1007\/978-3-540-72738-5_1"},{"key":"291_CR16","doi-asserted-by":"crossref","unstructured":"Katz, J., Vaikuntanathan, V.: Signature schemes with bounded leakage resilience. In: Matsui, M. (ed.) Advances in Cryptology\u2014ASIACRYPT 2009. Lecture Notes in Computer Science, , vol. 5912, pp. 703\u2013720. Springer Berlin Heidelberg (2009)","DOI":"10.1007\/978-3-642-10366-7_41"},{"key":"291_CR17","doi-asserted-by":"crossref","unstructured":"Lewko, A., Lewko, M., Waters, B.: How to leak on key updates. In: Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing (New York, NY 2011), STOC \u201911, ACM, pp. 725\u2013734","DOI":"10.1145\/1993636.1993732"},{"key":"291_CR18","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Palacio, A., Segev, G.: Public-key cryptographic primitives provably as secure as subset sum. In: Micciancio, D. (ed.) Theory of Cryptography. Lecture Notes in Computer Science, vol. 5978, pp. 382\u2013400. Springer, Berlin Heidelberg (2010)","DOI":"10.1007\/978-3-642-11799-2_23"},{"key":"291_CR19","doi-asserted-by":"crossref","unstructured":"MacKenzie, P., Yang, K.: On simulation-sound trapdoor commitments. In: Cachin, C., Camenisch, J.L. (eds.) Advances in Cryptology\u2014EUROCRYPT 2004. Lecture Notes in Computer Science, vol. 3027, pp. 382\u2013400. Springer, Berlin Heidelberg (2004)","DOI":"10.1007\/978-3-540-24676-3_23"},{"key":"291_CR20","doi-asserted-by":"crossref","unstructured":"Malkin, T., Teranishi, I., Vahlis, Y., Yung, M.: Signatures resilient to continual leakage on memory and computation. In: Ishai, Y. (ed.) Theory of Cryptography. Lecture Notes in Computer Science, vol. 6597, pp. 89\u2013106. Springer, Berlin Heidelberg (2011)","DOI":"10.1007\/978-3-642-19571-6_7"},{"key":"291_CR21","doi-asserted-by":"crossref","unstructured":"Naor, M., Segev, G.: Public-key cryptosystems resilient to key leakage. In: Halevi, S. (ed.) Advances in Cryptology\u2014CRYPTO 2009. Lecture Notes in Computer Science, vol. 5677, pp. 18\u201335. Springer, Berlin Heidelberg (2009)","DOI":"10.1007\/978-3-642-03356-8_2"},{"key":"291_CR22","doi-asserted-by":"crossref","unstructured":"Steinfeld, R., Pieprzyk, J., Wang, H.: How to strengthen any weakly unforgeable signature into a strongly unforgeable signature. In: Abe, M. (ed.) Topics in Cryptology\u2014CT-RSA 2006. Lecture Notes in Computer Science, vol. 4377, pp. 357\u2013371. Springer, Berlin Heidelberg (2007)","DOI":"10.1007\/11967668_23"},{"key":"291_CR23","doi-asserted-by":"crossref","unstructured":"Teranishi, I., Oyama, T., Ogata, W.: General conversion for obtaining strongly existentially unforgeable signatures. In: Barua, R., Lange, T. (eds). Progress in Cryptology\u2014INDOCRYPT 2006. Lecture Notes in Computer Science, vol. 4329, pp. 191\u2013205. Springer, Berlin Heidelberg (2006)","DOI":"10.1007\/11941378_14"},{"key":"291_CR24","doi-asserted-by":"crossref","unstructured":"Wang, Y., Tanaka, K.: Generic transformation to strongly existentially unforgeable signature schemes with leakage resiliency. In: Chow, S., Liu, J., Hui, L., Yiu, S. (eds.) Provable Security. Lecture Notes in Computer Science, vol. 8782, pp. 117\u2013129. Springer (2014)","DOI":"10.1007\/978-3-319-12475-9_9"},{"key":"291_CR25","doi-asserted-by":"crossref","unstructured":"Wang, Y., Tanaka, K.: Strongly simulation-extractable leakage-resilient nizk. In: Susilo, W. , Mu, Y. (eds). Information Security and Privacy. Lecture Notes in Computer Science, vol. 8544, pp. 66\u201381. Springer (2014)","DOI":"10.1007\/978-3-319-08344-5_5"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-015-0291-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-015-0291-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-015-0291-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,25]],"date-time":"2019-08-25T07:09:57Z","timestamp":1566716997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-015-0291-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,19]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["291"],"URL":"https:\/\/doi.org\/10.1007\/s10207-015-0291-z","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,19]]}}}