{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T05:41:51Z","timestamp":1741153311219,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642195709"},{"type":"electronic","value":"9783642195716"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19571-6_35","type":"book-chapter","created":{"date-parts":[[2011,3,22]],"date-time":"2011-03-22T12:04:42Z","timestamp":1300795482000},"page":"579-596","source":"Crossref","is-referenced-by-count":12,"title":["Towards Non-Black-Box Lower Bounds in Cryptography"],"prefix":"10.1007","author":[{"given":"Rafael","family":"Pass","sequence":"first","affiliation":[]},{"given":"Wei-Lung Dustin","family":"Tseng","sequence":"additional","affiliation":[]},{"given":"Muthuramakrishnan","family":"Venkitasubramaniam","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"Almgren, F., Andersson, G., Granlund, T., Ivansson, L., Ulfberg, S.: How we cracked the code book ciphers (2000) (manuscript), http:\/\/codebook.org\/codebook_solution.pdf"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Akavia, A., Goldreich, O., Goldwasser, S., Moshkovitz, D.: On basing one-way functions on NP-hardness. In: STOC 2006, pp. 701\u2013710 (2006)","DOI":"10.1145\/1132516.1132614"},{"issue":"5","key":"35_CR3","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1145\/1089023.1089025","volume":"52","author":"D. Aharonov","year":"2005","unstructured":"Aharonov, D., Regev, O.: Lattice problems in NP cap coNP. J. ACM\u00a052(5), 749\u2013765 (2005)","journal-title":"J. ACM"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: FOCS 2001, vol. 0, pp. 106\u2013115 (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"key":"35_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/3-540-48329-2_24","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"A. Blum","year":"1994","unstructured":"Blum, A., Furst, M., Kearns, M., Lipton, R.: Cryptographic Primitives Based on Hard Learning Problems. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 278\u2013291. Springer, Heidelberg (1994)"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF01200056","volume":"1","author":"L. Babai","year":"1991","unstructured":"Babai, L., Fortnow, L., Lund, C.: Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity\u00a01, 3\u201340 (1991)","journal-title":"Computational Complexity"},{"issue":"4","key":"35_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 Journal on Computing\u00a013(4), 850\u2013864 (1984)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"35_CR8","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1109\/TIT.1983.1056754","volume":"29","author":"G. Brassard","year":"1983","unstructured":"Brassard, G.: Relativized cryptography. IEEE Transactions on Information Theory\u00a029(6), 877\u2013893 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Trevisan, L.: On worst-case to average-case reductions for np problems. In: FOCS 2003, pp. 308\u2013317 (2003)","DOI":"10.1109\/SFCS.2003.1238205"},{"issue":"3","key":"35_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s001459900009","volume":"9","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Yung, M.: Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation. J. Cryptology\u00a09(3), 149\u2013166 (1996)","journal-title":"J. Cryptology"},{"issue":"2","key":"35_CR11","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., Naor, M.: Nonmalleable cryptography. SIAM Journal on Computing\u00a030(2), 391\u2013437 (2000)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"35_CR12","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1109\/18.669255","volume":"44","author":"I. Damg\u00e5rd","year":"1998","unstructured":"Damg\u00e5rd, I., Pedersen, T.P., Pfitzmann, B.: Statistical secrecy and multibit commitments. IEEE Transactions on Information Theory\u00a044(3), 1143\u20131151 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"key":"35_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04722-4","volume-title":"The Design of Rijndael","author":"J. Daemen","year":"2002","unstructured":"Daemen, J., Rijmen, V.: The Design of Rijndael. Springer, New York, Inc. (2002)"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Feige, U., Kim, J.H., Ofek, E.: Witnesses for non-satisfiability of dense random 3cnf formulas. In: FOCS 2006, pp. 497\u2013508 (2006)","DOI":"10.1109\/FOCS.2006.78"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In: STOC 1990, pp. 416\u2013426 (1990)","DOI":"10.1145\/100216.100272"},{"issue":"3","key":"35_CR16","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1006\/jcss.1999.1686","volume":"60","author":"O. Goldreich","year":"2000","unstructured":"Goldreich, O., Goldwasser, S.: On the limits of nonapproximability of lattice problems. J. Comput. Syst. Sci.\u00a060(3), 540\u2013563 (2000)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"35_CR17","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. Journal of ACM\u00a033(4), 792\u2013807 (1986)","journal-title":"Journal of ACM"},{"issue":"3","key":"35_CR18","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Kahan, A.: How to construct constant-round zero-knowledge proof systems for NP. Journal of Cryptology\u00a09(3), 167\u2013190 (1996)","journal-title":"Journal of Cryptology"},{"issue":"1","key":"35_CR19","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Krawczyk, H.: On the composition of zero-knowledge proof systems. SIAM Journal on Computing\u00a025(1), 169\u2013192 (1996)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"35_CR20","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci.\u00a028(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"35_CR21","doi-asserted-by":"publisher","first-page":"691","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 for all languages in np have zero-knowledge proof systems. J. ACM\u00a038(3), 691\u2013729 (1991)","journal-title":"J. ACM"},{"issue":"4","key":"35_CR22","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. J. ACM\u00a048(4), 798\u2013859 (2001)","journal-title":"J. ACM"},{"key":"35_CR23","doi-asserted-by":"crossref","unstructured":"Haitner, I., Hoch, J.J., Reingold, O., Segev, G.: Finding collisions in interactive protocols - a tight lower bound on the round complexity of statistically-hiding commitments. In: FOCS, pp. 669\u2013679 (2007)","DOI":"10.1109\/FOCS.2007.7"},{"issue":"4","key":"35_CR24","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput.\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"35_CR25","doi-asserted-by":"crossref","unstructured":"Haitner, I., Mahmoody, M., Xiao, D.: A new sampling protocol and applications to basing cryptographic primitives on the hardness of NP. In: IEEE Conference on Computational Complexity, pp. 76\u201387 (2010)","DOI":"10.1109\/CCC.2010.17"},{"key":"35_CR26","doi-asserted-by":"crossref","unstructured":"Haitner, I., Reingold, O.: Statistically-hiding commitment from any one-way function. In: STOC 2007, pp. 1\u201310 (2007)","DOI":"10.1145\/1250790.1250792"},{"key":"35_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1007\/0-387-34799-2_2","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"R. Impagliazzo","year":"1990","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the Provable Consequences of One-Way Permutations. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 8\u201326. Springer, Heidelberg (1990)"},{"issue":"3","key":"35_CR28","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/s00037-005-0197-7","volume":"14","author":"P.B. Miltersen","year":"2005","unstructured":"Miltersen, P.B., Vinodchandran, N.V.: Derandomizing arthur-merlin games using hitting sets. Computational Complexity\u00a014(3), 256\u2013279 (2005)","journal-title":"Computational Complexity"},{"issue":"2","key":"35_CR29","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. J. Cryptology\u00a04(2), 151\u2013158 (1991)","journal-title":"J. Cryptology"},{"issue":"2","key":"35_CR30","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s001459900037","volume":"11","author":"M. Naor","year":"1998","unstructured":"Naor, M., Ostrovsky, R., Venkatesan, R., Yung, M.: Perfect zero-knowledge arguments for p using any one-way permutation. J. Cryptology\u00a011(2), 87\u2013108 (1998)","journal-title":"J. Cryptology"},{"issue":"2","key":"35_CR31","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80043-1","volume":"49","author":"N. Nisan","year":"1994","unstructured":"Nisan, N., Wigderson, A.: Hardness vs randomness. J. Comput. Syst. Sci.\u00a049(2), 149\u2013167 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"35_CR32","doi-asserted-by":"crossref","unstructured":"Pass, R.: Parallel repetition of zero-knowledge proofs and the possibility of basing cryptography on NP-hardness. In: IEEE Conference on Computational Complexity, pp. 96\u2013110 (2006)","DOI":"10.1109\/CCC.2006.33"},{"key":"35_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1007\/978-3-642-11799-2_35","volume-title":"Theory of Cryptography","author":"R. Pass","year":"2010","unstructured":"Pass, R., Venkitasubramaniam, M.: Private coins versus public coins in zero-knowledge proofs. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 588\u2013605. Springer, Heidelberg (2010)"},{"issue":"1","key":"35_CR34","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"M.O. Rabin","year":"1980","unstructured":"Rabin, M.O.: Probabilistic algorithm for testing primality. Journal of Number Theory\u00a012(1), 128\u2013138 (1980)","journal-title":"Journal of Number Theory"},{"key":"35_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/BFb0054137","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"D.R. Simon","year":"1998","unstructured":"Simon, D.R.: Findings Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions? In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 334\u2013345. Springer, Heidelberg (1998)"},{"key":"35_CR36","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Theory and applications of trapdoor functions (extended abstract). In: FOCS 1982, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19571-6_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T16:56:58Z","timestamp":1741107418000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19571-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642195709","9783642195716"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19571-6_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}