{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:27:22Z","timestamp":1761596842143,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE Computer. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2003.1238211","type":"proceedings-article","created":{"date-parts":[[2004,3,2]],"date-time":"2004-03-02T02:26:50Z","timestamp":1078194410000},"page":"372-383","source":"Crossref","is-referenced-by-count":21,"title":["Logics for reasoning about cryptographic constructions"],"prefix":"10.1109","author":[{"given":"R.","family":"Impagliazzo","sequence":"first","affiliation":[]},{"given":"B.M.","family":"Kapron","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.2307\/2269958"},{"key":"22","first-page":"1","article-title":"Mode?les non standard de l'arithme?tique, et complexite? algorithmique","author":"wilkie","year":"1985","journal-title":"Mode?les Non Standard en L'Arithme?tique et The?orie des Ensembles"},{"key":"17","first-page":"1","article-title":"A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)","volume":"47","author":"mitchell","year":"2001","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"23","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1109\/SFCS.1982.45","article-title":"Theory and applications of trapdoor functions (extended abstract)","author":"yao","year":"1982","journal-title":"Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196774"},{"key":"15","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1145\/288090.288117","article-title":"A probabilistic poly-time framework for protocol analysis","author":"lincoln","year":"1998","journal-title":"Proceedings of the 5th ACM Conference on Computer and Communications Security"},{"key":"16","article-title":"Completeness theorems for the abadi-rogaway logic of encrypted expressions","author":"micciancio","year":"2003","journal-title":"Journal of Computer Security"},{"key":"13","first-page":"25","article-title":"A hard-core predicate for all one-way functions","author":"goldreich","year":"1989","journal-title":"Proceedings of the 21st Annual ACM Symposium on Theory of Computing"},{"journal-title":"Elementary Calculus An Approach Using Infinitesimals","year":"1986","author":"keisler","key":"14"},{"key":"11","first-page":"83","article-title":"Feasibly constructive proofs and the propositional calculus","author":"cook","year":"1975","journal-title":"Proc 7th ACM Annu Symp Theory Comput"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056650"},{"journal-title":"Theory of Formal Systems Volume 47 of Annals of Mathematical Studies","year":"1961","author":"smullyan","key":"21"},{"article-title":"A universally composable cryptographic library","year":"0","author":"backes","key":"3"},{"journal-title":"The Modelling and Analysis of Security Protocols The CSP Approach","year":"2001","author":"ryan","key":"20"},{"key":"2","article-title":"Reconciling two views of cryptography (the computational soundness of formal encryption)","author":"abadi","year":"2001","journal-title":"Journal of Cryptology"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2740"},{"key":"10","first-page":"24","article-title":"The intrinsic computational difficulty of functions","author":"cobham","year":"1965","journal-title":"Proceedings of the International Conference on Logic Methodology and Philosophy"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/74850.74852"},{"key":"6","first-page":"1","article-title":"Pseudo-random generators and complexity classes","volume":"5","author":"boppana","year":"1989","journal-title":"Advances in Computing Research"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/1008908.1008911"},{"key":"4","article-title":"Practice-oriented provable-security","author":"bellare","year":"0","journal-title":"Proceedings of the 1st International Workshop on Information Security (ISW 97) Volume 1396 of Lecture Notes in Computer Science Springer-Verlag 1998"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959888"},{"journal-title":"Bounded Arithmetic","year":"1986","author":"buss","key":"8"}],"event":{"name":"44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003","acronym":"SFCS-03","location":"Cambridge, MA, USA"},"container-title":["44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8767\/27770\/01238211.pdf?arnumber=1238211","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,14]],"date-time":"2021-06-14T23:52:57Z","timestamp":1623714777000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1238211\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2003.1238211","relation":{},"subject":[]}}