{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T20:12:04Z","timestamp":1769717524271,"version":"3.49.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,9,13]],"date-time":"2012-09-13T00:00:00Z","timestamp":1347494400000},"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":["J Cryptol"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s00145-012-9131-8","type":"journal-article","created":{"date-parts":[[2012,9,12]],"date-time":"2012-09-12T13:28:37Z","timestamp":1347456517000},"page":"484-512","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Enhancements of Trapdoor Permutations"],"prefix":"10.1007","volume":"26","author":[{"given":"Oded","family":"Goldreich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ron D.","family":"Rothblum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,9,13]]},"reference":[{"key":"9131_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"W. Alexi, B. Chor, O. Goldreich, C.P. Schnorr, RSA\/Rabin functions: certain parts are as hard as the whole. SIAM J. Comput.\n                           17, 194\u2013209 (1988). Preliminary version in 25th FOCS, 1984","journal-title":"SIAM J. Comput."},{"key":"9131_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s001459900009","volume":"9","author":"M. Bellare","year":"1996","unstructured":"M. Bellare, M. Yung, Certifying permutations: noninteractive zero-knowledge based on any trapdoor permutation. J. Cryptol.\n                           9, 149\u2013166 (1996)","journal-title":"J. Cryptol."},{"issue":"6","key":"9131_CR3","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/0220068","volume":"20","author":"M. Blum","year":"1991","unstructured":"M. Blum, A. De Santis, S. Micali, G. Persiano, Non-interactive zero-knowledge proof systems. SIAM J. Comput.\n                           20(6), 1084\u20131118 (1991). (Considered the journal version of [4])","journal-title":"SIAM J. Comput."},{"key":"9131_CR4","first-page":"103","volume-title":"20th ACM Symposium on the Theory of Computing","author":"M. Blum","year":"1988","unstructured":"M. Blum, P. Feldman, S. Micali, Non-interactive zero-knowledge and its applications, in 20th ACM Symposium on the Theory of Computing (1988), pp. 103\u2013112. See [3]"},{"key":"9131_CR5","series-title":"Lecture Notes in Computer Science","first-page":"289","volume-title":"Crypto84","author":"M. Blum","year":"1984","unstructured":"M. Blum, S. Goldwasser, An efficient probabilistic public-key encryption scheme which hides all partial information, in Crypto84. Lecture Notes in Computer Science, vol. 196 (Springer, Berlin, 1984), pp.\u00a0289\u2013302"},{"key":"9131_CR6","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum, S. Micali, How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput.\n                           13, 850\u2013864 (1984). Preliminary version in 23rd FOCS, 1982","journal-title":"SIAM J. Comput."},{"key":"9131_CR7","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie, M.E. Hellman, New directions in cryptography. IEEE Trans. Inf. Theory\n                           IT-22, 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"9131_CR8","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"S. Even, O. Goldreich, A. Lempel, A randomized protocol for signing contracts. Commun. ACM\n                           28(6), 637\u2013647 (1985). Extended abstract in Crypto\u201982","journal-title":"Commun. ACM"},{"issue":"1","key":"9131_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539792230010","volume":"29","author":"U. Feige","year":"1999","unstructured":"U. Feige, D. Lapidot, A. Shamir, Multiple non-interactive zero-knowledge proofs under general assumptions. SIAM J. Comput.\n                           29(1), 1\u201328 (1999). Preliminary version in 31st FOCS, 1990","journal-title":"SIAM J. Comput."},{"key":"9131_CR10","volume-title":"Proceedings of the 41st annual symposium on foundations of computer science (FOCS)","author":"Y. Gertner","year":"2000","unstructured":"Y. Gertner, S. Kannan, T. Malkin, O. Reingold, M. Viswanathan, The relationship between public key encryption and oblivious transfer, in Proceedings of the 41st annual symposium on foundations of computer science (FOCS) (2000)"},{"issue":"1","key":"9131_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF02620230","volume":"6","author":"O. Goldreich","year":"1993","unstructured":"O. Goldreich, A uniform complexity treatment of encryption and zero-knowledge. J. Cryptol.\n                           6(1), 21\u201353 (1993)","journal-title":"J. Cryptol."},{"key":"9131_CR12","unstructured":"O. Goldreich, Secure Multi-party Computation. Available from the author\u2019s homepage, 1998 (revised 2001)"},{"key":"9131_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundation of Cryptography: Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"O. Goldreich, Foundation of Cryptography: Basic Tools (Cambridge University Press, Cambridge, 2001)"},{"key":"9131_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundation of Cryptography: Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"O. Goldreich, Foundation of Cryptography: Basic Applications (Cambridge University Press, Cambridge, 2004)"},{"key":"9131_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804106","volume-title":"Computational Complexity: A Conceptual Perspective","author":"O. Goldreich","year":"2008","unstructured":"O. Goldreich, Computational Complexity: A Conceptual Perspective (Cambridge University Press, Cambridge, 2008)"},{"key":"9131_CR16","first-page":"406","volume-title":"Lecture Notes in Computer Science","author":"O. Goldreich","year":"2011","unstructured":"O. Goldreich, Basing non-interactive zero-knowledge on (enhanced) trapdoor permutations: the state of the art, in Lecture Notes in Computer Science, vol.\u00a06650 (Springer, Berlin, 2011), pp. 406\u2013421"},{"key":"9131_CR17","first-page":"25","volume-title":"21st ACM Symposium on the Theory of Computing","author":"O. Goldreich","year":"1989","unstructured":"O. Goldreich, L.A. Levin, Hard-core predicates for any one-way function, in 21st ACM Symposium on the Theory of Computing (1989), pp. 25\u201332"},{"key":"9131_CR18","first-page":"218","volume-title":"19th ACM Symposium on the Theory of Computing","author":"O. Goldreich","year":"1987","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game\u2014a completeness theorem for protocols with honest majority, in 19th ACM Symposium on the Theory of Computing (1987), pp. 218\u2013229"},{"issue":"2","key":"9131_CR19","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser, S. Micali. Probabilistic encryption. J. Comput. Syst. Sci.\n                           28(2), 270\u2013299 (1984). Preliminary version in 14th STOC, 1982","journal-title":"J. Comput. Syst. Sci."},{"key":"9131_CR20","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, C. Rackoff, The knowledge complexity of interactive proof systems. SIAM J. Comput.\n                           18, 186\u2013208 (1989). Preliminary version in 17th STOC, 1985","journal-title":"SIAM J. Comput."},{"key":"9131_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"1st theory of cryptography conference","author":"I. Haitner","year":"2004","unstructured":"I. Haitner, Implementing oblivious transfer using a collection of dense trapdoor permutations, in 1st theory of cryptography conference. Lecture Notes in Computer Science, vol. 2951 (Springer, Berlin, 2004)"},{"key":"9131_CR22","unstructured":"M.O. Rabin, Digitalized signatures and public key functions as intractable as factoring. MIT\/LCS\/TR-212 (1979)"},{"key":"9131_CR23","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"R. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public key cryptosystems. Commun. ACM\n                           21, 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"9131_CR24","unstructured":"R. Rothblum, A taxonomy of enhanced trapdoor permutations. ECCC, TR10-145, 2010"},{"key":"9131_CR25","first-page":"80","volume-title":"23rd IEEE Symposium on Foundations of Computer Science","author":"A.C. Yao","year":"1982","unstructured":"A.C. Yao, Theory and application of trapdoor functions, in 23rd IEEE Symposium on Foundations of Computer Science (1982), pp. 80\u201391"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-012-9131-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-012-9131-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-012-9131-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-012-9131-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:09:15Z","timestamp":1586333355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-012-9131-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,13]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9131"],"URL":"https:\/\/doi.org\/10.1007\/s00145-012-9131-8","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,13]]},"assertion":[{"value":"3 August 2011","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2012","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}