{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:27:01Z","timestamp":1759638421328},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,9,30]],"date-time":"2015-09-30T00:00:00Z","timestamp":1443571200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s00145-015-9218-0","type":"journal-article","created":{"date-parts":[[2015,9,30]],"date-time":"2015-09-30T18:51:22Z","timestamp":1443639082000},"page":"152-190","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Bounded Tamper Resilience: How to Go Beyond the Algebraic Barrier"],"prefix":"10.1007","volume":"30","author":[{"given":"Ivan","family":"Damg\u00e5rd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Faust","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pratyay","family":"Mukherjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Venturi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,30]]},"reference":[{"key":"9218_CR1","doi-asserted-by":"crossref","unstructured":"D. Aggarwal, Y. Dodis, T. Kazana, M. Obremski, Non-malleable reductions and applications, in STOC (2015)","DOI":"10.1145\/2746539.2746544"},{"key":"9218_CR2","unstructured":"D. Aggarwal, Y. Dodis, S. Lovett, Non-malleable codes from additive combinatorics, in STOC, (2014), pp. 774\u2013783"},{"key":"9218_CR3","unstructured":"D. Aggarwal, S. Dziembowski, T. Kazana, M. Obremski, Leakage-resilient non-malleable codes, in TCC, (2015), pp. 398\u2013426"},{"key":"9218_CR4","doi-asserted-by":"crossref","unstructured":"S. Agrawal, D. Gupta, H.K. Maji, O. Pandey, M. Prabhakaran, Explicit non-malleable codes against bit-wise tampering and permutations, in CRYPTO, (2015), pp 538\u2013557.","DOI":"10.1007\/978-3-662-47989-6_26"},{"key":"9218_CR5","unstructured":"S. Agrawal, D. Gupta, H.K. Maji, O. Pandey, M. Prabhakaran, A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations, in TCC, (2015), pp. 375\u2013397"},{"key":"9218_CR6","unstructured":"S. Agrawal, Y. Dodis, V. Vaikuntanathan, D. Wichs, On continual leakage of discrete log representations, in ASIACRYPT, (2013), pp. 401\u2013420"},{"key":"9218_CR7","unstructured":"J. Alwen, Y. Dodis, D. Wichs, Leakage-resilient public-key cryptography in the bounded-retrieval model, in CRYPTO, (2009), pp. 36\u201354"},{"key":"9218_CR8","unstructured":"R. Anderson, M. Kuhn, Tamper resistance: a cautionary note, in WOEC\u201996: Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce, (USENIX Association, Berkeley, 1996), p. 1"},{"key":"9218_CR9","unstructured":"B. Applebaum, D. Harnik, Y. Ishai, Semantic security under related-key attacks and applications, in ICS, (2011), pp. 45\u201360"},{"key":"9218_CR10","unstructured":"M. Bellare, D. Cash, Pseudorandom functions and permutations provably secure against related-key attacks, in CRYPTO, (2010), pp. 666\u2013684"},{"key":"9218_CR11","unstructured":"M. Bellare, D. Cash, R. Miller, Cryptography secure against related-key attacks and tampering. In ASIACRYPT, (2011), pp. 486\u2013503"},{"key":"9218_CR12","unstructured":"M. Bellare, T. Kohno, A theoretical treatment of related-key attacks: RKA-PRPs, RKA-PRFs, and applications, in EUROCRYPT, (2003), pp. 491\u2013506"},{"key":"9218_CR13","unstructured":"M. Bellare, K.G. Paterson, S. Thomson. RKA security beyond the linear barrier: IBE, encryption and signatures, in ASIACRYPT, (2012), pp. 331\u2013348"},{"key":"9218_CR14","doi-asserted-by":"crossref","unstructured":"R. Bhattacharyya, A. Roy, Secure message authentication against related key attack, in FSE (2013)","DOI":"10.1007\/978-3-662-43933-3_16"},{"key":"9218_CR15","doi-asserted-by":"crossref","unstructured":"D. Boneh, R.A. DeMillo, R.J. Lipton, On the importance of eliminating errors in cryptographic computations. J. Cryptol., 14(2):101\u2013119 (2001)","DOI":"10.1007\/s001450010016"},{"key":"9218_CR16","unstructured":"D. Boneh, S. Halevi, M. Hamburg, R. Ostrovsky, Circular-secure encryption from decision diffie-hellman, in CRYPTO, (2008), pp. 108\u2013125"},{"key":"9218_CR17","unstructured":"J. Camenisch, N. Chandran, V. Shoup, A public key encryption scheme secure against key dependent chosen plaintext and adaptive chosen ciphertext attacks, in EUROCRYPT, (2009), pp. 351\u2013368"},{"key":"9218_CR18","unstructured":"E. Chattopadhyay, D. Zuckerman. Non-malleable codes against constant split-state tampering, in FOCS, (2014), pp. 306\u2013315"},{"key":"9218_CR19","unstructured":"M. Cheraghchi, V. Guruswami, Capacity of non-malleable codes, in Innovations in Theoretical Computer Science, ITCS, (2014), pp. 155\u2013168"},{"key":"9218_CR20","unstructured":"M. Cheraghchi, V. Guruswami, Non-malleable coding against bit-wise and split-state tampering, in TCC, (2014), pp. 440\u2013464"},{"key":"9218_CR21","unstructured":"S.G. Choi, A. Kiayias, T. Malkin, BiTR: Built-in tamper resilience, in ASIACRYPT, (2011), pp. 740\u2013758"},{"key":"9218_CR22","doi-asserted-by":"crossref","unstructured":"S. Coretti, Y. Dodis, B. Tackmann, D. Venturi, Non-malleable encryption: simpler, shorter, stronger. IACR Cryptol. ePrint Archive, 772 (2015)","DOI":"10.1007\/978-3-662-49096-9_13"},{"key":"9218_CR23","unstructured":"S. Coretti, U. Maurer, B. Tackmann, D. Venturi, From single-bit to multi-bit public-key encryption via non-malleable codes, in TCC, (2015), pp. 532\u2013560"},{"key":"9218_CR24","unstructured":"R. Cramer, Modular Design of Secure yet Practical Cryptographic Protocols. PhD thesis, University of Amsterdam, (1996)"},{"key":"9218_CR25","unstructured":"G. Di Crescenzo, R.J. Lipton, S. Walfish, Perfectly secure password protocols in the bounded retrieval model, in TCC, (2006), pp. 225\u2013244"},{"key":"9218_CR26","unstructured":"D. Dachman-Soled, Y.T. Kalai, Securing circuits against constant-rate tampering, in CRYPTO, (2012), pp. 533\u2013551"},{"key":"9218_CR27","unstructured":"D. Dachman-Soled, Y.T. Kalai, Securing circuits and protocols against 1\/poly(k) tampering rate, in TCC, (2014), pp. 540\u2013565"},{"key":"9218_CR28","unstructured":"D. Dachman-Soled, F.-H. Liu, E. Shi, H.-S. Zhou, Locally decodable and updatable non-malleable codes and their applications, in TCC, (2015), pp. 427\u2013450"},{"key":"9218_CR29","unstructured":"I. Damg\u00e5rd, S. Faust, P. Mukherjee, D. Venturi, Bounded tamper resilience: How to go beyond the algebraic barrier, in ASIACRYPT, (2013), pp. 140\u2013160"},{"key":"9218_CR30","unstructured":"I. Damg\u00e5rd, S. Faust, P. Mukherjee, D. Venturi, The chaining lemma and its application, in ICITS, (2015), pp. 181\u2013196"},{"key":"9218_CR31","unstructured":"Y. Dodis, K. Haralambiev, A. L\u00f3pez-Alt, D. Wichs, Cryptography against continuous memory attacks, in FOCS, (2010), pp. 511\u2013520"},{"key":"9218_CR32","unstructured":"Y. Dodis, K. Haralambiev, A. L\u00f3pez-Alt, D. Wichs, Efficient public-key cryptography in the presence of key leakage, in ASIACRYPT, (2010), pp. 613\u2013631"},{"key":"9218_CR33","unstructured":"Y. Dodis, R. Ostrovsky, L. Reyzin, A. Smith, Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM J. Comput.\n                           38(1), 97\u2013139 (2008)"},{"key":"9218_CR34","unstructured":"S. Dziembowski, Intrusion-resilience via the bounded-storage model, in TCC, (2006), pp. 207\u2013224"},{"key":"9218_CR35","unstructured":"S. Dziembowski, T. Kazana, M. Obremski, Non-malleable codes from two-source extractors, in CRYPTO, (2013), pp. 239\u2013257"},{"key":"9218_CR36","unstructured":"S. Dziembowski, T. Kazana, D. Wichs, One-time computable self-erasing functions, in TCC, (2011), pp. 125\u2013143"},{"key":"9218_CR37","unstructured":"S. Dziembowski, K. Pietrzak, D. Wichs, Non-malleable codes, in ICS, (2010), pp. 434\u2013452"},{"key":"9218_CR38","unstructured":"S. Faust, M. Kohlweiss, G.A. Marson, D. Venturi, On the non-malleability of the fiat-shamir transform, in INDOCRYPT, (2012), pp. 60\u201379"},{"key":"9218_CR39","doi-asserted-by":"crossref","unstructured":"S. Faust, P. Mukherjee, J.B. Nielsen, D. Venturi, Continuous non-malleable codes, in TCC (2014)","DOI":"10.1007\/978-3-642-54242-8_20"},{"key":"9218_CR40","unstructured":"S. Faust, P. Mukherjee, J.B. Nielsen, D. Venturi, A tamper and leakage resilient von Neumann architecture, in PKC, (2015), pp. 579\u2013603"},{"key":"9218_CR41","unstructured":"S. Faust, P. Mukherjee, D. Venturi, D. Wichs, Efficient non-malleable codes and key-derivation for poly-size tampering circuits, in EUROCRYPT, (2014), pp. 111\u2013128"},{"key":"9218_CR42","unstructured":"S. Faust, K. Pietrzak, D. Venturi, Tamper-proof circuits: How to trade leakage for tamper-resilience. In ICALP (1), (2011), pp. 391\u2013402"},{"key":"9218_CR43","unstructured":"A. Fiat, A. Shamir, How to prove yourself: practical solutions to identification and signature problems, in CRYPTO, (1986), pp. 186\u2013194"},{"key":"9218_CR44","unstructured":"M. Fischlin, R. Fischlin, The representation problem based on factoring, in CT-RSA, (2002), pp. 96\u2013113"},{"key":"9218_CR45","unstructured":"D. Genkin, Y. Ishai, M. Prabhakaran, A. Sahai, E. Tromer, Circuits resilient to additive attacks with applications to secure computation, in STOC, (2014), pp. 495\u2013504"},{"key":"9218_CR46","unstructured":"R. Gennaro, A. Lysyanskaya, T. Malkin, S. Micali, T. Rabin, Algorithmic tamper-proof (ATP) security: theoretical foundations for security against hardware tampering, in TCC, (2004), pp. 258\u2013277"},{"key":"9218_CR47","unstructured":"V. Goyal, A. O\u2019Neill, V. Rao, Correlated-input secure hash functions, in TCC, (2011), pp. 182\u2013200"},{"key":"9218_CR48","unstructured":"J. Groth, Simulation-sound NIZK proofs for a practical language and constant size group signatures, in ASIACRYPT, (2006), pp. 444\u2013459"},{"key":"9218_CR49","unstructured":"L.C. Guillou, J.-J. Quisquater, A \u201cparadoxical\u201d identity-based signature scheme resulting from zero-knowledge, in CRYPTO, (1988), pp. 216\u2013231"},{"key":"9218_CR50","unstructured":"Y. Ishai, M. Prabhakaran, A. Sahai, D. Wagner, Private circuits II: keeping secrets in tamperable circuits, in EUROCRYPT, (2006), pp. 308\u2013327"},{"key":"9218_CR51","doi-asserted-by":"crossref","unstructured":"Z. Jafargholi, D. Wichs, Tamper detection and continuous non-malleable codes, in TCC, (2015), pp. 451\u2013480,","DOI":"10.1007\/978-3-662-46494-6_19"},{"key":"9218_CR52","unstructured":"Y.T. Kalai, B. Kanukurthi, A. Sahai, Cryptography with tamperable and leaky memory, in CRYPTO, (2011), pp. 373\u2013390"},{"key":"9218_CR53","unstructured":"J. Katz, V. Vaikuntanathan, Signature schemes with bounded leakage resilience, In ASIACRYPT, (2009), pp. 703\u2013720"},{"key":"9218_CR54","unstructured":"A. Kiayias, Y. Tselekounis, Tamper resilient circuits: the adversary at the gates, in ASIACRYPT, (2013), pp. 161\u2013180"},{"key":"9218_CR55","unstructured":"F.-H. Liu, A. Lysyanskaya, Tamper and leakage resilience in the split-state model, in CRYPTO, (2012), pp. 517\u2013532"},{"key":"9218_CR56","unstructured":"S. Lucks, Ciphers secure against related-key attacks, in FSE, (2004), pp. 359\u2013370"},{"key":"9218_CR57","unstructured":"M. Naor, G. Segev, Public-key cryptosystems resilient to key leakage, in CRYPTO, (2009), pp. 18\u201335"},{"key":"9218_CR58","unstructured":"T. Okamoto, Provably secure and practical identification schemes and corresponding signature schemes, in CRYPTO, (1992), pp. 31\u201353"},{"key":"9218_CR59","unstructured":"K. Pietrzak, Subspace LWE, in TCC, (2012), pp. 548\u2013563"},{"key":"9218_CR60","doi-asserted-by":"crossref","unstructured":"S. Pohlig, M. Hellman, An improved algorithm for computing logarithms over and its cryptographic significance. IEEE Trans. Inform. Theory, 24(1), 106\u2013110 (1978)","DOI":"10.1109\/TIT.1978.1055817"},{"key":"9218_CR61","unstructured":"B. Qin, S. Liu, T.H. Yuen, R.H. Deng, K. Chen, Continuous non-malleable key derivation and its application to related-key security, in PKC, (2015), pp. 557\u2013578"},{"key":"9218_CR62","unstructured":"H. Wee, Public key encryption against related key attacks, in PKC, (2012), pp. 262\u2013279"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9218-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-015-9218-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9218-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9218-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:13:14Z","timestamp":1586333594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-015-9218-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,30]]},"references-count":62,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["9218"],"URL":"https:\/\/doi.org\/10.1007\/s00145-015-9218-0","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,30]]},"assertion":[{"value":"18 April 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2015","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}