{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:04:35Z","timestamp":1725505475430},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540791034"},{"type":"electronic","value":"9783540791041"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-79104-1_26","type":"book-chapter","created":{"date-parts":[[2008,3,13]],"date-time":"2008-03-13T07:28:21Z","timestamp":1205393301000},"page":"361-376","source":"Crossref","is-referenced-by-count":4,"title":["Computational Soundness of Non-Malleable Commitments"],"prefix":"10.1007","author":[{"given":"David","family":"Galindo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Flavio D.","family":"Garcia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"van Rossum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/11555827_22","volume-title":"Computer Security \u2013 ESORICS 2005","author":"P. Ad\u00e3o","year":"2005","unstructured":"Ad\u00e3o, P., Bana, G., Herzog, J., Scedrov, A.: Soundness of formal encryption in the presence of key-cycles. In: di Vimercati, S.d.C., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol.\u00a03679, pp. 374\u2013396. Springer, Heidelberg (2005)"},{"key":"26_CR2","first-page":"170","volume-title":"CSFW 2005","author":"P. Ad\u00e3o","year":"2005","unstructured":"Ad\u00e3o, P., Bana, G., Scedrov, A.: Computational and information-theoretic soundness and completeness of formal encryption. In: CSFW 2005, pp. 170\u2013184. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/11690634_27","volume-title":"Foundations of Software Science and Computation Structures","author":"M. Abadi","year":"2006","unstructured":"Abadi, M., Baudet, M., Warinschi, B.: Guessing attacks and the computational soundness of static equivalence. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006 and ETAPS 2006. LNCS, vol.\u00a03921, pp. 398\u2013412. Springer, Heidelberg (2006)"},{"issue":"2","key":"26_CR4","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s00145-001-0014-7","volume":"15","author":"M. Abadi","year":"2002","unstructured":"Abadi, M., Rogaway, P.: Reconciling two views of cryptography (the computational soundness of formal encryption). J. Cryptology\u00a015(2), 103\u2013127 (2002)","journal-title":"J. Cryptology"},{"key":"26_CR5","first-page":"108","volume-title":"Proceedings of the 24th ACM Symposium on Principles of Database Systems","author":"M. Abadi","year":"2005","unstructured":"Abadi, M., Warinschi, B.: Security analysis of cryptographically controlled access to XML documents. In: Proceedings of the 24th ACM Symposium on Principles of Database Systems, pp. 108\u2013117. ACM Press, New York (2005)"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1007\/11523468_53","volume-title":"Automata, Languages and Programming","author":"M. Baudet","year":"2005","unstructured":"Baudet, M., Cortier, V., Kremer, S.: Computationally sound implementations of equational theories against passive adversaries. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 652\u2013663. Springer, Heidelberg (2005)"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74143-5_27","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"E. Bresson","year":"2007","unstructured":"Bresson, E., Lakhnech, Y., Mazar\u00e9, L., Warinschi, B.: A generalization of DDH with applications to protocol analysis and computational soundness. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, Springer, Heidelberg (2007)"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11761679_25","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"M. Bellare","year":"2006","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework for code-based game-playing proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 409\u2013426. Springer, Heidelberg (2006)"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1145\/276698.276722","volume-title":"STOC 1998","author":"G. Crescenzo Di","year":"1998","unstructured":"Di Crescenzo, G., Ishai, Y., Ostrovsky, R.: Non-interactive and non-malleable commitment. In: STOC 1998, pp. 141\u2013150. ACM Press, New York (1998)"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/11944836_18","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"V. Cortier","year":"2006","unstructured":"Cortier, V., Kremer, S., K\u00fcsters, R., Warinschi, B.: Computationally sound symbolic secrecy in the presence of hash functions. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol.\u00a04337, pp. 176\u2013187. Springer, Heidelberg (2006)"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-44987-6_4","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"G. Crescenzo Di","year":"2001","unstructured":"Di Crescenzo, G., Katz, J., Ostrovsky, R., Smith, A.: Efficient and non-interactive non-malleable commitment. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 40\u201359. Springer, Heidelberg (2001)"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1145\/103418.103474","volume-title":"STOC 1991","author":"D. Dolev","year":"1991","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. In: STOC 1991, pp. 542\u2013552. ACM Press, New York (1991)"},{"issue":"6","key":"26_CR13","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomizing protocol for signing contracts. Comm. ACM\u00a028(6), 637\u2013647 (1985)","journal-title":"Comm. ACM"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/3-540-44598-6_26","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"M. Fischlin","year":"2000","unstructured":"Fischlin, M., Fischlin, R.: Efficient non-malleable commitment schemes. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 413\u2013431. Springer, Heidelberg (2000)"},{"issue":"2","key":"26_CR15","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Computer and System Sciences\u00a028(2), 270\u2013299 (1984)","journal-title":"J. Computer and System Sciences"},{"issue":"1","key":"26_CR16","first-page":"691","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. J. ACM\u00a038(1), 691\u2013729 (1991)","journal-title":"J. ACM"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/11908739_3","volume-title":"Advances in Information and Computer Security","author":"F.D. Garcia","year":"2006","unstructured":"Garcia, F.D., van Rossum, P.: Sound computational interpretation of symbolic hashes in the standard model. In: Yoshiura, H., Sakurai, K., Rannenberg, K., Murayama, Y., Kawamura, S.-i. (eds.) IWSEC 2006. LNCS, vol.\u00a04266, pp. 33\u201347. Springer, Heidelberg (2006)"},{"issue":"1","key":"26_CR18","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2005.03.003","volume":"340","author":"J. Herzog","year":"2005","unstructured":"Herzog, J.: A computational interpretation of Dolev\u2013Yao adversaries. Theoretical Computer Science\u00a0340(1), 57\u201381 (2005)","journal-title":"Theoretical Computer Science"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/978-3-540-31987-0_13","volume-title":"Programming Languages and Systems","author":"R. Janvier","year":"2005","unstructured":"Janvier, R., Lakhnech, Y., Mazar, L.: Completing the picture: Soundness of formal encryption in the presence of active adversaries. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 172\u2013185. Springer, Heidelberg (2005)"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74835-9_40","volume-title":"Computer Security \u2013 ESORICS 2007","author":"S. Kremer","year":"2007","unstructured":"Kremer, S., Mazar\u00e9, L.: Adaptive soundness of static equivalence. In: Biskup, J., L\u00f3pez, J. (eds.) ESORICS 2007. LNCS, vol.\u00a04734, Springer, Heidelberg (2007)"},{"key":"26_CR21","unstructured":"Mazar\u00e9, L.: Computationally sound analysis of protocols using bilinear pairings. In: WITS 2007, pp. 6\u201321 (2007)"},{"key":"26_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/978-3-540-30576-7_10","volume-title":"Theory of Cryptography","author":"D. Micciancio","year":"2005","unstructured":"Micciancio, D., Panjwani, S.: Adaptive security of symbolic encryption. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 169\u2013187. Springer, Heidelberg (2005)"},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/978-3-540-24638-1_8","volume-title":"Theory of Cryptography","author":"D. Micciancio","year":"2004","unstructured":"Micciancio, D., Warinschi, B.: Soundness of formal encryption in the presence of active adversaries. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 133\u2013151. Springer, Heidelberg (2004)"},{"key":"26_CR24","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/100216.100273","volume-title":"STOC 1990","author":"M. Naor","year":"1990","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attack. In: STOC 1990, pp. 427\u2013437. ACM Press, New York (1990)"},{"key":"26_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/3-540-46766-1_35","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"C. Rackoff","year":"1992","unstructured":"Rackoff, C., Simon, D.R.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 433\u2013444. Springer, Heidelberg (1992)"},{"key":"26_CR26","unstructured":"Shoup, V.: Sequences of games: a tool for taming complexity in security proofs. Cryptology ePrint Archive, Report 2004\/332 (2004), \n                  \n                    http:\/\/eprint.iacr.org\/"}],"container-title":["Lecture Notes in Computer Science","Information Security Practice and Experience"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79104-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T13:14:37Z","timestamp":1551446077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79104-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540791034","9783540791041"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79104-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}