{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T15:42:53Z","timestamp":1770219773683,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642041372","type":"print"},{"value":"9783642041389","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04138-9_29","type":"book-chapter","created":{"date-parts":[[2009,8,28]],"date-time":"2009-08-28T08:28:34Z","timestamp":1251448114000},"page":"411-428","source":"Crossref","is-referenced-by-count":9,"title":["On Tamper-Resistance from a Theoretical Viewpoint"],"prefix":"10.1007","author":[{"given":"Paulo","family":"Mateus","sequence":"first","affiliation":[]},{"given":"Serge","family":"Vaudenay","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","first-page":"186","volume-title":"Annual ACM Symposium on Theory of Computing: 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: Annual ACM Symposium on Theory of Computing: FOCS 2004, pp. 186\u2013195. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-45539-6_17","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"J.L. Camenisch","year":"2000","unstructured":"Camenisch, J.L., Michels, M.: Confirmer signature schemes secure against adaptive adversaries (Extended abstract). In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 243\u2013258. Springer, Heidelberg (2000)"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-540-76900-2_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"R. Canetti","year":"2007","unstructured":"Canetti, R.: Obtaining universally composable security: Towards the bare bones of trust. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 88\u2013112. Springer, Heidelberg (2007)"},{"key":"29_CR4","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\u201340. Springer, Heidelberg (2001)"},{"key":"29_CR5","first-page":"494","volume-title":"Annual ACM Symposium on Theory of Computing: STOC 2002","author":"R. Canetti","year":"2002","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: Annual ACM Symposium on Theory of Computing: STOC 2002, pp. 494\u2013503. ACM Press, New York (2002)"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/0-387-34805-0_20","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"D. Chaum","year":"1990","unstructured":"Chaum, D., Van Antwerpen, H.: Undeniable signatures. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 212\u2013216. Springer, Heidelberg (1990)"},{"key":"29_CR7","unstructured":"Cramer, R.: Modular design of secure, yet practical cryptographic protocols. Phd thesis, University of Amsterdam (1996)"},{"key":"29_CR8","unstructured":"Damg\u00e5rd, I.: On \u03a3-protocols. Lecture notes, University of Aahrus (2005), \n                    \n                      http:\/\/www.daimi.au.dk\/%7Eivan\/Sigma.pdf"},{"key":"29_CR9","unstructured":"Desmedt, Y.: Major security problems with the unforgeable (feige)-fiat-shamir proofs of identity and how to overcome them. In: The 6th Worldwide Congress on Computer and Communications Security and Protection: Securicom 1988, pp. 147\u2013149. SEDEP (1988)"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-47721-7_9","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"Y.G. Desmedt","year":"1987","unstructured":"Desmedt, Y.G., Quisquater, J.-J.: Public-key systems based on the difficulty of tampering. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 111\u2013117. Springer, Heidelberg (1987)"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/3-540-46416-6_19","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"Y.G. Desmedt","year":"1991","unstructured":"Desmedt, Y.G., Yung, M.: Weaknesses of undeniable signature schemes. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 205\u2013220. Springer, Heidelberg (1991)"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1145\/22145.22178","volume-title":"Proceedings 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: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, STOC 1985, pp. 291\u2013304. ACM Press, New York (1985)"},{"issue":"1","key":"29_CR13","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal of Computing\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM Journal of Computing"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/11761679_4","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"V. Gratzer","year":"2006","unstructured":"Gratzer, V., Naccache, D.: Alien vs. quine, the vanishing circuit and other tales from the industry\u2019s crypt. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 48\u201358. Springer, Heidelberg (2006)"},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/BFb0053457","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"M. Jakobsson","year":"1995","unstructured":"Jakobsson, M.: Blackmailing using undeniable signatures. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 425\u2013427. Springer, Heidelberg (1995)"},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-68339-9_13","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Jakobsson","year":"1996","unstructured":"Jakobsson, M., Sako, K., Impagliazzo, R.: Designated verifier proofs and their applications. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 143\u2013154. Springer, Heidelberg (1996)"},{"key":"29_CR17","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":"29_CR18","unstructured":"Mateus, P.: Attacking zero-knowledge proof systems. Habilitation thesis, Department of Mathematics, Instituto Superior T\u00e9cnico, 1049-001 Lisboa, Portugal, 2005. Awarded the Portuguese IBM Scientific Prize (2005) ( in Portuguese)"},{"key":"29_CR19","first-page":"9","volume-title":"Proceedings of the First Workshop on Quantum Security: QSec 2007","author":"P. Mateus","year":"2007","unstructured":"Mateus, P., Moura, F., Rasga, J.: Transferring proofs of zero-knowledge systems with quantum correlations. In: Dini, P., et al. (eds.) Proceedings of the First Workshop on Quantum Security: QSec 2007, p. 9. IEEE Computer Society Press, Los Alamitos (2007)"},{"key":"29_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/11958239_2","volume-title":"Progress in Cryptology - VIETCRYPT 2006","author":"J. Monnerat","year":"2006","unstructured":"Monnerat, J., Vaudenay, S.: Short 2-move undeniable signatures. In: Nguyen, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol.\u00a04341, pp. 19\u201336. Springer, Heidelberg (2006)"},{"key":"29_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-540-45146-4_19","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R. Pass","year":"2003","unstructured":"Pass, R.: On deniability in the common reference string and random oracle model. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 316\u2013337. Springer, Heidelberg (2003)"},{"key":"29_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-540-72540-4_13","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"T. Ristenpart","year":"2007","unstructured":"Ristenpart, T., Yilek, S.: The power of proofs-of-possession: Securing multiparty signatures against rogue-key attacks. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 228\u2013245. Springer, Heidelberg (2007)"},{"key":"29_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/3-540-45682-1_32","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"R.L. Rivest","year":"2001","unstructured":"Rivest, R.L., Shamir, A., Tauman, Y.: How to leak a secret. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 552\u2013565. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems - CHES 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04138-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T06:31:44Z","timestamp":1538807504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04138-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041372","9783642041389"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04138-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}