{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T18:33:40Z","timestamp":1767983620595,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T00:00:00Z","timestamp":1307318400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,6]]},"DOI":"10.1145\/1993636.1993652","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:53:52Z","timestamp":1307361232000},"page":"109-118","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":56,"title":["Limits of provable security from standard assumptions"],"prefix":"10.1145","author":[{"given":"Rafael","family":"Pass","sequence":"first","affiliation":[{"name":"Cornell, Ithaca, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Manuscript","author":"Almgren Fredrik","year":"2000","unstructured":"0}AAGIU00 Fredrik Almgren , Gunnar Andersson , Torbj\u00f6rn Granlund , Lars Ivansson , and Staffan Ulfberg . How we cracked the code book ciphers . Manuscript , 2000 . http:\/\/codebook.org\/codebook_solution.pdf. 0}AAGIU00Fredrik Almgren, Gunnar Andersson, Torbj\u00f6rn Granlund, Lars Ivansson, and Staffan Ulfberg. How we cracked the code book ciphers. Manuscript, 2000. http:\/\/codebook.org\/codebook_solution.pdf."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132614"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875552"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875549"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01001-9_1"},{"key":"e_1_3_2_2_6_1","first-page":"1444","volume-title":"Proc. of the International Congress of Mathematicians","author":"Blum M.","year":"1986","unstructured":"M. Blum . How to prove a theorem so no one else can claim it . Proc. of the International Congress of Mathematicians , pages 1444 -- 1451 , 1986 . M. Blum. How to prove a theorem so no one else can claim it. Proc. of the International Congress of Mathematicians, pages 1444--1451, 1986."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1791688.1791695"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-002-0120-1"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/646767.704441"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168596"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056754"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946341"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054117"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/646759.705842"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335334"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008734"},{"key":"e_1_3_2_2_17_1","first-page":"199","volume-title":"CRYPTO","author":"Chaum David","year":"1982","unstructured":"David Chaum . Blind signatures for untraceable payments . In CRYPTO , pages 199 -- 203 , 1982 . David Chaum. Blind signatures for untraceable payments. In CRYPTO, pages 199--203, 1982."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.86"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.59"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/950620.950623"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039489"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_27"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222061"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100272"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_10"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791220688"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946302"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116852"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/519078"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993651"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_13"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_14"},{"key":"e_1_3_2_2_35_1","first-page":"8","volume-title":"CRYPTO '88","author":"Impagliazzo Russell","year":"1988","unstructured":"Russell Impagliazzo and Steven Rudich . Limits on the provable consequences of one-way permutations . In CRYPTO '88 , pages 8 -- 26 , 1988 . Russell Impagliazzo and Steven Rudich. Limits on the provable consequences of one-way permutations. In CRYPTO '88, pages 8--26, 1988."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380851"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196774"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_6"},{"key":"e_1_3_2_2_39_1","first-page":"31","volume-title":"CRYPTO","author":"Okamoto Tatsuaki","year":"1992","unstructured":"Tatsuaki Okamoto . Provably secure and practical identification schemes and corresponding signature schemes . In CRYPTO , pages 31 -- 53 , 1992 . Tatsuaki Okamoto. Provably secure and practical identification schemes and corresponding signature schemes. In CRYPTO, pages 31--53, 1992."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/1766171.1766185"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2006.33"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.27"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001450010003"},{"key":"e_1_3_2_2_44_1","first-page":"2011","article-title":"Towards non-black-box separations in cryptography. To appear","author":"Pass Rafael","year":"2010","unstructured":"Rafael Pass , Wei-Lung Dustin Tseng , and Muthuramakrishan Venkitasubramaniam . Towards non-black-box separations in cryptography. To appear in TCC 2011 , 2010 . Rafael Pass, Wei-Lung Dustin Tseng, and Muthuramakrishan Venkitasubramaniam. Towards non-black-box separations in cryptography. To appear in TCC 2011, 2010.","journal-title":"TCC"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/1802614.1802656"},{"key":"e_1_3_2_2_46_1","first-page":"415","volume-title":"Eurocrypt ''99","author":"Richardson Ransom","year":"1999","unstructured":"Ransom Richardson and Joe Kilian . On the concurrent composition of zero-knowledge proofs . In Eurocrypt ''99 , pages 415 -- 432 , 1999 . Ransom Richardson and Joe Kilian. On the concurrent composition of zero-knowledge proofs. In Eurocrypt ''99, pages 415--432, 1999."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24638-1_1"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-010-0291-3"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196725"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/1754542.1754568"}],"event":{"name":"STOC'11: Symposium on Theory of Computing","location":"San Jose California USA","acronym":"STOC'11","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-third annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993652","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993636.1993652","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:00:05Z","timestamp":1750244405000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993652"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,6]]},"references-count":50,"alternative-id":["10.1145\/1993636.1993652","10.1145\/1993636"],"URL":"https:\/\/doi.org\/10.1145\/1993636.1993652","relation":{},"subject":[],"published":{"date-parts":[[2011,6,6]]},"assertion":[{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}