{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T05:26:07Z","timestamp":1738819567984,"version":"3.37.0"},"reference-count":19,"publisher":"Academy Publisher","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JNW"],"DOI":"10.4304\/jnw.8.3.552-558","type":"journal-article","created":{"date-parts":[[2013,3,31]],"date-time":"2013-03-31T04:58:18Z","timestamp":1364705898000},"source":"Crossref","is-referenced-by-count":25,"title":["A Framework for Automated Security Proof and its Application to OAEP"],"prefix":"10.4304","volume":"8","author":[{"given":"Guang","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhu","family":"Yue-Fei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gu","family":"Chun-Xiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"Jin-long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"He","family":"Xin-Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2838","published-online":{"date-parts":[[2013,3,28]]},"reference":[{"key":"ref1","first-page":"92","article-title":"Optimal asymmetric encryption. In Advances in Cryptology \u2013 EUROCRYPT 1994","volume-title":"Lecture Notes in Computer Science","volume":"950","author":"Bellare","year":"1994","unstructured":"[1] M. Bellare and P. Rogaway. Optimal asymmetric encryption. In Advances in Cryptology \u2013 EUROCRYPT 1994, volume 950 of Lecture Notes in Computer Science, pages 92\u2013111, Berlin, 1994. Springer."},{"key":"ref2","first-page":"239","article-title":"OAEP reconsidered. In Advances in Cryptology \u2013 CRYPTO 2001","volume-title":"Lecture Notes in Computer Science","volume":"2139","author":"Shoup","year":"2001","unstructured":"[2] V. Shoup. OAEP reconsidered. In Advances in Cryptology \u2013 CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 239\u2013259, Berlin, 2001. Springer."},{"key":"ref3","first-page":"63","article-title":"OAEP 3-Round: A Generic and Secure Asymmetric Encryption Padding.","volume-title":"Asiacrypt 04 LNCS 3329","author":"Phan","year":"2004","unstructured":"[4] DH. Phan and D. Pointcheval. OAEP 3-Round: A Generic and Secure Asymmetric Encryption Padding. in Asiacrypt'04, LNCS 3329, pages 63-77, Springer- Verlag, 2004."},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-002-0204-y"},{"key":"ref5","first-page":"537","article-title":"Automated Security Proofs with Sequences of Games.","volume-title":"Proceedings of CRYPTO","author":"Blanchet","year":"2006","unstructured":"[6] Bruno Blanchet and D. Pointcheval. Automated Security Proofs with Sequences of Games. In Proceedings of CRYPTO. 2006, 537-554."},{"issue":"7","key":"ref6","first-page":"50","article-title":"Game-based Automated Security Proofs for Cryptographic Protocols.","volume":"2011","author":"Chunxiang","year":"2011","unstructured":"[8] Gu Chunxiang, Guang Yan, and Zhu Yuefei. Game-based Automated Security Proofs for Cryptographic Protocols. China Communications, 2011(7):50\u201357, 2011.","journal-title":"China Communications"},{"key":"ref7","first-page":"409","article-title":"The security of triple encryption and a framework for code-based game-playing proofs. In Advances in Cryptology \u2013 EUROCRYPT 2006","volume-title":"Lecture Notes in Computer Science","volume":"4004","author":"Bellare","year":"2006","unstructured":"[10] M. Bellare and P. Rogaway. The security of triple encryption and a framework for code-based game-playing proofs. In Advances in Cryptology \u2013 EUROCRYPT 2006, volume 4004 of Lecture Notes in Computer Science, pages 409\u2013426, Berlin, 2006. Springer."},{"key":"ref8","first-page":"71","article-title":"S Heraud and and S Zanella Beguelin. Computer-Aided Security Proofs for the Working Cryptographer. In Advances in Cryptology - CRYPTO 2011","volume-title":"Lecture Notes in Computer Science","volume":"6841","author":"Barthe","year":"2011","unstructured":"[17] G Barthe, B Gregoire, S Heraud and and S Zanella Beguelin. Computer-Aided Security Proofs for the Working Cryptographer. In Advances in Cryptology - CRYPTO 2011, volume 6841 of Lecture Notes in Computer Science, pages 71-90, Springer, 2011."},{"key":"ref9","volume-title":"Towards automated proofs for asymmetric encryption in the random oracle model Computer and Communications Security","author":"Courant","year":"2008","unstructured":"[18] J. Courant, M. Daubignard, C. Ene, P. Lafourcade, and Y. Lakhnech. Towards automated proofs for asymmetric encryption in the random oracle model. Computer and Communications Security. ACM Press, 2008."},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16280-0_3"},{"key":"ref10","doi-asserted-by":"crossref","unstructured":"[3] K. Kobara and H. Imai. OAEP++: A very simple way to apply OAEP to determin- istic OW-CPA primitives. Cryptology ePrint Archive, Report 2002\/130, 2002.","DOI":"10.1007\/978-3-642-16280-0_3"},{"key":"ref10","doi-asserted-by":"crossref","unstructured":"[7] V. Shoup. Sequences of games: a tool for taming complexity in security proofs. Cryptology ePrint Archive, Report 2004\/332, 2004.","DOI":"10.1007\/978-3-642-16280-0_3"},{"key":"ref10","doi-asserted-by":"crossref","unstructured":"[9] S. Halevi. A plausible approach to computer-aided cryptographic proofs. Cryptology ePrint Archive,Report 2005\/181, June 2005.","DOI":"10.1007\/978-3-642-16280-0_3"},{"key":"ref10","doi-asserted-by":"crossref","unstructured":"[11] M. Backes, M. Berg, and D. Unruh. A formal language for cryptographic pseudocode. In 15th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR 2008, volume 5330 of Lecture Notes in Computer Science, pp 353\u2013376. Springer, 2008.","DOI":"10.1007\/978-3-642-16280-0_3"},{"key":"ref10","doi-asserted-by":"crossref","unstructured":"[12] Clemens Ballarin. Introduction to the Isabelle Proof Assistant. http:\/\/www4.in.tum.de\/~ballarin\/Belgrade08tu. 2008-1-29\/2012 -7-30","DOI":"10.1007\/978-3-642-16280-0_3"},{"key":"ref10","doi-asserted-by":"crossref","unstructured":"[13] David Nowak and Yu Zhang. A calculus for game-based security proofs. In Provable Security - 4th International Conference, ProvSec 2010, Malacca, Malaysia, October 13-15, 2010.","DOI":"10.1007\/978-3-642-16280-0_3"},{"key":"ref10","doi-asserted-by":"crossref","unstructured":"[14] R. Affeldt, M. Tanaka, and N. Marti. Formal proof of provable security by game-playing in a proof assistant. In Proceedings of International Conference on Provable Security, ser. Lecture Notes in Computer Science, vol. 4784. Springer-Verlag, 2007. 151\u2013168.","DOI":"10.1007\/978-3-642-16280-0_3"},{"key":"ref10","doi-asserted-by":"crossref","unstructured":"[15] Adam Koprowski. Introduction to Coq - Proving with computer assistance. http:\/\/www.win.tue.nl\/~akoprows\/teaching\/Coq.2007-2-12\/2012-7-30","DOI":"10.1007\/978-3-642-16280-0_3"},{"key":"ref10","doi-asserted-by":"crossref","unstructured":"[16] G. Barthe, B.Gregoire, S.Zanella Beguelin. Formal certification of code-based cryptographic proofs. In Proceedings of the 36th ACM Symposium on Principles of Programming Languages, ACM Press,2009. 90\u2013101.","DOI":"10.1007\/978-3-642-16280-0_3"}],"container-title":["Journal of Networks"],"original-title":[],"deposited":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T17:14:45Z","timestamp":1738775685000},"score":1,"resource":{"primary":{"URL":"https:\/\/dblp.org\/db\/journals\/jnw\/index.html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,28]]},"references-count":19,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2013,3,28]]}},"URL":"https:\/\/doi.org\/10.4304\/jnw.8.3.552-558","relation":{},"ISSN":["1796-2056"],"issn-type":[{"type":"print","value":"1796-2056"}],"subject":[],"published":{"date-parts":[[2013,3,28]]}}}