{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:40:42Z","timestamp":1725752442541},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642412264"},{"type":"electronic","value":"9783642412271"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41227-1_7","type":"book-chapter","created":{"date-parts":[[2013,10,15]],"date-time":"2013-10-15T01:04:52Z","timestamp":1381799092000},"page":"121-138","source":"Crossref","is-referenced-by-count":1,"title":["Input-Aware Equivocable Commitments and UC-secure Commitments with Atomic Exchanges"],"prefix":"10.1007","author":[{"given":"Ioana","family":"Boureanu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serge","family":"Vaudenay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-540-24638-1_19","volume-title":"Theory of Cryptography","author":"M. Backes","year":"2004","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: A general composition theorem for secure reactive systems. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 336\u2013354. Springer, Heidelberg (2004)"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1109\/FOCS.2004.71","volume-title":"Proc. of the 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004","author":"B. Barak","year":"2004","unstructured":"Barak, B., Canetti, R., Nielsen, J.B., Pass, R.: Universally composable protocols with relaxed set-up assumptions. In: Proc. of the 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004, pp. 186\u2013195. IEEE Computer Society, Washington, DC (2004)"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/3-540-46766-1_31","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"D. Beaver","year":"1992","unstructured":"Beaver, D.: Foundations of secure interactive computing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 377\u2013391. Springer, Heidelberg (1992)"},{"key":"7_CR4","unstructured":"Blum, M.: How to prove a theorem so no one else can claim it. In: An Address to the Int. Congress of Mathematicians (August 1986)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"Algorithmic Number Theory","author":"D. Boneh","year":"1998","unstructured":"Boneh, D.: The Decision Diffie-Hellman Problem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 48\u201363. Springer, Heidelberg (1998)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/3-540-48285-7_30","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"S. Brands","year":"1994","unstructured":"Brands, S., Chaum, D.: Distance-Bounding Protocols (Extended Abstract). In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 344\u2013359. Springer, Heidelberg (1994)"},{"key":"7_CR7","unstructured":"Canetti, R.: A Unified Framework for Analyzing Security of Protocols. In: Electronic Colloquium on Computational Complexity (ECCC), vol.\u00a08(16) (2001)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000\/067 (2005), \n                    \n                      http:\/\/eprint.iacr.org\/","DOI":"10.1109\/SFCS.2001.959888"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-642-00457-5_35","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2009","unstructured":"Canetti, R., Dakdouk, R.R.: Towards a theory of extractable functions. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 595\u2013613. Springer, Heidelberg (2009)"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally Composable Commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 19\u201341. Springer, Heidelberg (2001)"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally Composable Two-Party and Multi-Party Secure Computation. In: The 34th Annual ACM Symposium on Theory of Computing (STOC 2002), pp. 494\u2013503 (2002)","DOI":"10.1145\/509907.509980"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/978-3-540-78967-3_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"N. Chandran","year":"2008","unstructured":"Chandran, N., Goyal, V., Sahai, A.: New Constructions for UC Secure Computation Using Tamper-Proof Hardware. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 545\u2013562. Springer, Heidelberg (2008)"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Security in Communication Networks","year":"2003","unstructured":"Cimato, S., Galdi, C., Persiano, G. (eds.): SCN 2002. LNCS, vol.\u00a02576. Springer, Heidelberg (2003)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"R. Cramer","year":"1998","unstructured":"Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 13\u201325. Springer, Heidelberg (1998)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-642-00457-5_19","volume-title":"Theory of Cryptography","author":"I. Damg\u00e5rd","year":"2009","unstructured":"Damg\u00e5rd, I., Nielsen, J.B., Wichs, D.: Universally composable multiparty computation with partially isolated parties. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 315\u2013331. Springer, Heidelberg (2009)"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/3-540-45708-9_37","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"I.B. Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I.B., Nielsen, J.B.: Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 581\u2013596. Springer, Heidelberg (2002)"},{"key":"7_CR17","unstructured":"Dent, A.W. The hardness of the DHK problem in the generic group model (2006) a.dent@rhul.ac.uk13277 (received April 24, 2006), (last revised May 9, 2006)"},{"key":"7_CR18","first-page":"7","volume-title":"Proc. of 16th USENIX Security Symposium on USENIX Security Symposium, SS 2007","author":"S. Drimer","year":"2007","unstructured":"Drimer, S., Murdoch, S.J.: Keep your enemies close: distance bounding against smartcard relay attacks. In: Proc. of 16th USENIX Security Symposium on USENIX Security Symposium, SS 2007, pp. 7:1\u20137:16. USENIX Association, Berkeley (2007)"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In: 27th Annual Symposium on Foundations of Computer Science, pp. 174\u2013187 (October 1986)","DOI":"10.1109\/SFCS.1986.47"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1145\/22145.22178","volume-title":"Proc. of the Seventeenth Annual ACM Symposium on Theory of Computing, STOC 1985","author":"S. Goldwasser","year":"1985","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: Proc. of the Seventeenth Annual ACM Symposium on Theory of Computing, STOC 1985, pp. 291\u2013304. ACM, New York (1985)"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/978-3-540-45146-4_32","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J.C. Herzog","year":"2003","unstructured":"Herzog, J.C., Liskov, M., Micali, S.: Plaintext awareness via key registration. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 548\u2013564. Springer, Heidelberg (2003)"},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1145\/1060590.1060687","volume-title":"Proc. of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, STOC 2005","author":"Y.T. Kalai","year":"2005","unstructured":"Kalai, Y.T., Lindell, Y., Prabhakaran, M.: Concurrent general composition of secure protocols in the timing model. In: Proc. of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, STOC 2005, pp. 644\u2013653. ACM, New York (2005)"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-540-72540-4_7","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J. Katz","year":"2007","unstructured":"Katz, J.: Universally Composable Multi-party Computation Using Tamper-Proof Hardware. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 115\u2013128. Springer, Heidelberg (2007)"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/3-540-45682-1_23","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"M. Liskov","year":"2001","unstructured":"Liskov, M., Lysyanskaya, A., Micali, S., Reyzin, L., Smith, A.: Mutually independent commitments. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 385\u2013401. Springer, Heidelberg (2001)"},{"key":"7_CR25","unstructured":"Mayes, K., Cobourne, S., Markantonakis, K.: Near field technology in challenging environments. In: Smart Card Technology Int., NFC and Contactless, pp. 65\u201369 (2011)"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/3-540-46766-1_32","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"S. Micali","year":"1992","unstructured":"Micali, S., Rogaway, P.: Secure computation (abstract). In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 392\u2013404. Springer, Heidelberg (1992)"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","year":"2000","unstructured":"Welzl, E., Montanari, U., Rolim, J.D.P. (eds.): ICALP 2000. LNCS, vol.\u00a01853. Springer, Heidelberg (2000)"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-540-78967-3_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"T. Moran","year":"2008","unstructured":"Moran, T., Segev, G.: David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 527\u2013544. Springer, Heidelberg (2008)"},{"key":"7_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/BFb0054135","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"T. Okamoto","year":"1998","unstructured":"Okamoto, T., Uchiyama, S.: A new public-key cryptosystem as secure as factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 308\u2013318. Springer, Heidelberg (1998)"},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Teranishi, I., Ogata, W.: Relationship between standard model plaintext awareness and message hiding. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E91-A, 244\u2013261 (2008)","DOI":"10.1093\/ietfec\/e91-a.1.244"},{"key":"7_CR32","unstructured":"Ventre, C., Visconti, I.: Message-aware commitment schemes (2008) (unpublished manuscript)"}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41227-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T11:24:20Z","timestamp":1558610660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41227-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642412264","9783642412271"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41227-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}