{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T13:06:14Z","timestamp":1768914374371,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540573401","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48071-4_31","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:23:49Z","timestamp":1186363429000},"page":"442-460","source":"Crossref","is-referenced-by-count":26,"title":["Certifying Cryptographic Tools: The Case of Trapdoor Permutations"],"prefix":"10.1007","author":[{"given":"Mihir","family":"Bellare","sequence":"first","affiliation":[]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014 CRYPTO 89","author":"M. Bellare","year":"1989","unstructured":"M. Bellare and S. Goldwasser. New Paradigms for Digital Signatures and Message Authentication Based on Non-Interactive Zero-Knowledge Proofs. Advances in Cryptology \u2014 CRYPTO 89. Lecture Notes in Computer Science, Vol. 435, Springer Verlag."},{"issue":"1","key":"31_CR2","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/147508.147537","volume":"39","author":"M. Bellare","year":"1992","unstructured":"M. Bellare and S. Micali. How to Sign Given any Trapdoor Permutation. JACM, Vol. 39, No. 1, January 1992, pp. 214\u2013233. (Preliminary version in Proceedings of the 20th STOC, 1988).","journal-title":"JACM"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare, S. Micali and R. Ostrovsky. The True Complexity of Statistical Zero-Knowledge. Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, 1990.","DOI":"10.1145\/100216.100285"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"L. Blum, M. Blum, and M. Shub. A Simple Unpredictable Pseudo-Random Number Generator. SIAM Journal on Computing, Vol. 15, No. 2, May 1986, pp. 364\u2013383.","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"31_CR5","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, and G. Persiano, Non-Interactive Zero-Knowledge Proof Systems, SIAM Journal on Computing, Vol. 20, No. 6, December 1991, pp. 1084\u20131118.","journal-title":"SIAM Journal on Computing"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge Proof Systems and Applications, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988.","DOI":"10.1145\/62212.62222"},{"key":"31_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014 CRYPTO 90","author":"A. Santis De","year":"1990","unstructured":"A. De Santis and M. Yung. Cryptographic Applications of the Metaproof and Many-prover Systems. Advances in Cryptology \u2014 CRYPTO 90. Lecture Notes in Computer Science, Vol. 537, Springer-Verlag."},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"U. Feige, D. Lapidot, and A. Shamir. Multiple Non-Interactive Zero-Knowledge based on a Single Random String. Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, 1990.","DOI":"10.1109\/FSCS.1990.89549"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. Proofs that Yield Nothing but their Validity and a Methodology of Cryptographic Design. JACM, July 1991. (Preliminary version in the 27th FOCS, 1986).","DOI":"10.1109\/SFCS.1986.47"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"O. Goldreich and L. Levin. A Hard-Core Predicate for all One-Way Functions. Proceedings of the 21st Annual ACM Symposium on the Theory of Computing, 1989.","DOI":"10.1145\/73007.73010"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, and R. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM Journal on Computing, Vol. 17, No. 2, April 1988, pp. 281\u2013308.","journal-title":"SIAM Journal on Computing"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung. Public Key Cryptosystems secure against chosen-ciphertext attacks. Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, 1990.","DOI":"10.1145\/100216.100273"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"R. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM, Vol. 21, No. 2, February 1978, pp. 120\u201326.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48071-4_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:15:18Z","timestamp":1605647718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48071-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540573401"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-48071-4_31","relation":{},"subject":[]}}