{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T15:47:26Z","timestamp":1725983246132},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319944173"},{"type":"electronic","value":"9783319944180"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-94418-0_40","type":"book-chapter","created":{"date-parts":[[2018,7,4]],"date-time":"2018-07-04T12:38:26Z","timestamp":1530707906000},"page":"397-409","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Witness Hiding Without Extractors or Simulators"],"prefix":"10.1007","author":[{"given":"Andr\u00e9","family":"Souto","sequence":"first","affiliation":[]},{"given":"Lu\u00eds","family":"Antunes","sequence":"additional","affiliation":[]},{"given":"Paulo","family":"Mateus","sequence":"additional","affiliation":[]},{"given":"Andreia","family":"Teixeira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,3]]},"reference":[{"key":"40_CR1","first-page":"162","volume":"52","author":"L Antunes","year":"2013","unstructured":"Antunes, L., Matos, A., Pinto, A., Souto, A., Teixeira, A.: One-way function using algorithmic and classical information theories. ToCS 52, 162 (2013)","journal-title":"ToCS"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable zero-knowledge (extended abstract). In: STOC, pp. 235\u2013244 (2000)","DOI":"10.1145\/335305.335334"},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.3390\/cryptography2020009","volume":"2","author":"F Casal","year":"2018","unstructured":"Casal, F., Rasga, J., Souto, A.: Kolmogorov one-way functions revisited. Cryptogr. - MDPI 2, 9 (2018)","journal-title":"Cryptogr. - MDPI"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In: Proceedings of STOC. ACM (1990)","DOI":"10.1145\/100216.100272"},{"key":"40_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography","author":"O Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography. Cambridge University Press, Cambridge (2001)"},{"key":"40_CR6","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1145\/116825.116852","volume":"38","author":"O Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. J. ACM 38, 690\u2013728 (1991)","journal-title":"J. ACM"},{"issue":"1","key":"40_CR7","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/s000370050019","volume":"8","author":"O Goldreich","year":"1999","unstructured":"Goldreich, O., Petrank, E.: Quantifying knowledge complexity. Comput. Complex. 8(1), 50\u201398 (1999)","journal-title":"Comput. Complex."},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: Proceedings of STOC. ACM (1985)","DOI":"10.1145\/22145.22178"},{"issue":"1","key":"40_CR9","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"40_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-02017-9_29","volume-title":"Theory and Applications of Models of Computation","author":"M Kaplan","year":"2009","unstructured":"Kaplan, M., Laplante, S.: Kolmogorov complexity and combinatorial methods in communication complexity. In: Chen, J., Cooper, S.B. (eds.) TAMC 2009. LNCS, vol. 5532, pp. 261\u2013270. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-02017-9_29"},{"key":"40_CR11","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M Li","year":"2008","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications. TCS. Springer, New York (2008). \nhttps:\/\/doi.org\/10.1007\/978-0-387-49820-1"},{"key":"40_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-642-04138-9_29","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2009","author":"P Mateus","year":"2009","unstructured":"Mateus, P., Vaudenay, S.: On tamper-resistance from a theoretical viewpoint. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol. 5747, pp. 411\u2013428. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-04138-9_29"},{"issue":"6","key":"40_CR13","doi-asserted-by":"publisher","first-page":"1930","DOI":"10.1109\/18.265501","volume":"39","author":"R Yehuda","year":"1993","unstructured":"Yehuda, R., Chor, B., Kushilevitz, E., Orlitsky, A.: Privacy, additional information and communication. IEEE Tran. Inf. Theo. 39(6), 1930\u20131943 (1993)","journal-title":"IEEE Tran. Inf. Theo."},{"key":"40_CR14","volume-title":"Cryptography: Theory and Practice","author":"D Stinson","year":"1995","unstructured":"Stinson, D.: Cryptography: Theory and Practice. CRC Press, Boca Raton (1995)"}],"container-title":["Lecture Notes in Computer Science","Sailing Routes in the World of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94418-0_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,4]],"date-time":"2018-07-04T12:59:59Z","timestamp":1530709199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94418-0_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319944173","9783319944180"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94418-0_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}