{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T11:38:47Z","timestamp":1777549127345,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662464939","type":"print"},{"value":"9783662464946","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46494-6_20","type":"book-chapter","created":{"date-parts":[[2015,3,9]],"date-time":"2015-03-09T21:17:58Z","timestamp":1425935878000},"page":"481-501","source":"Crossref","is-referenced-by-count":12,"title":["Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model"],"prefix":"10.1007","author":[{"given":"Ronald","family":"Cramer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carles","family":"Padr\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chaoping","family":"Xing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-319-04268-8_14","volume-title":"Information Theoretic Security","author":"H. Ahmadi","year":"2014","unstructured":"Ahmadi, H., Safavi-Naini, R.: Detection of Algebraic Manipulation in the Presence of Leakage. In: Padr\u00f3, C. (ed.) ICITS 2013. LNCS, vol.\u00a08317, pp. 238\u2013258. Springer, Heidelberg (2014)"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"3210","DOI":"10.1109\/TIT.2006.876244","volume":"52","author":"L.M.J. Bazzi","year":"2006","unstructured":"Bazzi, L.M.J., Mitter, S.K.: Some Randomized Code Constructions from Group Actions. IEEE Trans. Inf. Theory\u00a052, 3210\u20133219 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-540-76900-2_25","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"A. Broadbent","year":"2007","unstructured":"Broadbent, A., Tapp, A.: Information-theoretic security without an honest majority. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 410\u2013426. Springer, Heidelberg (2007), \n                    \n                      http:\/\/arxiv.org\/abs\/0706.2010"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1023\/A:1013856431727","volume":"25","author":"S. Cabello","year":"2002","unstructured":"Cabello, S., Padr\u00f3, C., S\u00e1ez, G.: Secret sharing schemes with detection of cheaters for a general access structure. Des. Codes Cryptogr.\u00a025, 175\u2013188 (2002)","journal-title":"Des. Codes Cryptogr."},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-540-78967-3_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"R. Cramer","year":"2008","unstructured":"Cramer, R., Dodis, Y., Fehr, S., Padr\u00f3, C., Wichs, D.: Information-theoretic security without an honest majority. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 471\u2013488. Springer, Heidelberg (2008)"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1007\/s11425-013-4654-5","volume":"56","author":"R. Cramer","year":"2013","unstructured":"Cramer, R., Fehr, S., Padr\u00f3, C.: Algebraic manipulation detection codes. Sci. China Math.\u00a056, 1349\u20131358 (2013)","journal-title":"Sci. China Math."},{"key":"20_CR7","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-Malleable Codes. In: Innovations in Computer Science, ICS 2010, pp. 434\u2013452 (2010)"},{"key":"20_CR8","unstructured":"Fan, Y., Lin, L.: Thresholds of random quasi-abelian codes (2013), \n                    \n                      http:\/\/arxiv.org\/pdf\/1306.5377.pdf"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-11799-2_7","volume-title":"Theory of Cryptography","author":"D. Gordon","year":"2010","unstructured":"Gordon, D., Ishai, Y., Moran, T., Ostrovsky, R., Sahai, A.: On Complete Primitives for Fairness. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 91\u2013108. Springer, Heidelberg (2010)"},{"key":"20_CR10","unstructured":"Guruswami, V., Smith, A.: Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate. In: FOCS 2010, pp. 723\u2013732 (2010), Full version available at arXiv.org, arXiv:1004.4017 [cs.IT]"},{"key":"20_CR11","unstructured":"Karpovski, M., Wang, Z.: Algebraic Manipulation Detection Codes and Their Applications for Design of Secure Communication or Computation Channels (2011) (manuscript), \n                    \n                      http:\/\/mark.bu.edu\/papers\/226.pdf"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Wang, Z., Karpovsky, M.: Algebraic manipulation detection codes and their applications for design of secure cryptographic devices. In: IEEE 17th International On-Line Testing Symposium, IOLTS 2011, pp. 234\u2013239 (2011)","DOI":"10.1109\/IOLTS.2011.5994535"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-30057-8_16","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"H. Wee","year":"2012","unstructured":"Wee, H.: Public Key Encryption against Related Key Attacks. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol.\u00a07293, pp. 262\u2013279. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46494-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:42:21Z","timestamp":1559126541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46494-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662464939","9783662464946"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46494-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}