{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,8]],"date-time":"2022-07-08T00:10:13Z","timestamp":1657239013375},"reference-count":25,"publisher":"Oxford University Press (OUP)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"DOI":"10.1093\/comjnl\/bxw060","type":"journal-article","created":{"date-parts":[[2016,9,9]],"date-time":"2016-09-09T01:33:49Z","timestamp":1473384829000},"source":"Crossref","is-referenced-by-count":0,"title":["Bounds for Message Authentication with Distortion"],"prefix":"10.1093","author":[{"given":"Shaoquan","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2016,9,8]]},"reference":[{"key":"2016090818333954000_bxw060v1.1","doi-asserted-by":"crossref","unstructured":"Baracca, P. , Laurenti, N. and Tomasin, S. (2012) Physical layer authentication over MIMO fading wiretap channels. IEEE Trans. Wirel. Commun., Vol. 11, 2564\u20132573.","DOI":"10.1109\/TWC.2012.051512.111481"},{"key":"2016090818333954000_bxw060v1.2","doi-asserted-by":"crossref","unstructured":"Bloch, M. and Barros, J. (2011) Physical Layer Security: From Information Theory to Security Engineering, Cambridge University Press.","DOI":"10.1017\/CBO9780511977985"},{"key":"2016090818333954000_bxw060v1.3","doi-asserted-by":"crossref","unstructured":"Cao, D. and Kang, W. (2015) Message Authentication with Correlated Sources, IEEE Symp. Inf. Theory 2015, June 14\u201319, pp. 2934\u20132938, Hong Kong.","DOI":"10.1109\/ISIT.2015.7282994"},{"key":"2016090818333954000_bxw060v1.4","doi-asserted-by":"crossref","unstructured":"Cover, T. M. and Thomas, J.A. (2006) Elements of Information Theory, Wiley.","DOI":"10.1002\/047174882X"},{"key":"2016090818333954000_bxw060v1.5","doi-asserted-by":"crossref","unstructured":"Csisz\u00e1r, I. and K\u00f6rner, J. (2011) Information Theory: Coding Theorem for Discrete Memoryless System, Cambridge University Press.","DOI":"10.1017\/CBO9780511921889"},{"key":"2016090818333954000_bxw060v1.6","doi-asserted-by":"crossref","unstructured":"Di Crescenzo, G. , Graveman, R. F. , Ge, R. and Arce, G.R. (2005) Approximate message authentication and biometric entity authentication, FC 2005, In S. Patrick, A., Yung, M. (eds.), LNCS, Vol. 3570, pp. 240\u2013254. Springer, Heidelberg.","DOI":"10.1007\/11507840_22"},{"key":"2016090818333954000_bxw060v1.7","unstructured":"de Bruijn, N.G. (1981) Asymptotic Methods in Analysis, (3rd edn). Dover Publication, Inc."},{"key":"2016090818333954000_bxw060v1.8","doi-asserted-by":"crossref","unstructured":"Ge, R. , Arce, G. R. and Di Crescenzo, G. (2006) Approximate message authentication codes for N-ary alphabets. IEEE Trans. Inf. Forensics Secur., 1.","DOI":"10.1109\/TIFS.2005.863504"},{"key":"2016090818333954000_bxw060v1.9","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1974.tb02751.x"},{"key":"2016090818333954000_bxw060v1.10","unstructured":"Graveman, R. F. and Fu, K. (1999) Approximate Message Authentication Codes, In Proc. 3rd Annual Fedlab Symp. Adv. Telecommunications\/ Information Distribution, Vol. 1, College Park, MD."},{"key":"2016090818333954000_bxw060v1.11","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2014.2320634"},{"key":"2016090818333954000_bxw060v1.12","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2015.2405891"},{"key":"2016090818333954000_bxw060v1.13","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2015.2442523"},{"key":"2016090818333954000_bxw060v1.14","doi-asserted-by":"crossref","unstructured":"Kittichokechai, K. and Caire, G. (2015) Secret Key-based Authentication with a Privacy Constraint, IEEE Symposium on Information Theory 2015, June 14\u201319, pp. 1791\u20131795, Hong Kong.","DOI":"10.1109\/ISIT.2015.7282764"},{"key":"2016090818333954000_bxw060v1.15","unstructured":"Korzhik, V. , Yakovlev, V. , Luna, G. M. , Chesnokov, R. (2007) Performance Evaluation of Keyless Authentication Based on Noisy Channel, In Proc. MMM-ACNS 2007, Gorodetsky, V et al. (Eds.), CCIS 1, Springer, Berlin, pp. 115\u2013126."},{"key":"2016090818333954000_bxw060v1.16","doi-asserted-by":"crossref","unstructured":"Martinian, E. , Wornell, G. W. and Chen, B. (2001) On Authentication with Distortion Constraints, IEEE Symposium on Information Theory 2001, June 24\u201329, pp. 6, Washington, DC.","DOI":"10.1109\/ISIT.2001.935869"},{"key":"2016090818333954000_bxw060v1.17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850123"},{"key":"2016090818333954000_bxw060v1.18","doi-asserted-by":"crossref","unstructured":"Stinson, D. R. (2006) Cryptography: Theory and Practice (3rd edn). Chapman & Hall\/CRC.","DOI":"10.1201\/9781420057133"},{"key":"2016090818333954000_bxw060v1.19","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2006.873601"},{"key":"2016090818333954000_bxw060v1.20","unstructured":"Tonien D. , Safavi-Naini R. , Nickolas P. and Desmedt Y. (2009) Unconditionally Secure Approximate Message Authentication, the 2rd International Workshop on Coding and Cryptology (IWCC 2009), Chee, Y. et al. (Eds.), LNCS 5557, pp. 233\u2013247."},{"key":"2016090818333954000_bxw060v1.21","doi-asserted-by":"crossref","unstructured":"Venkatesan, R. , Koon, S. M. , Jakubowski, M. H. and Moulin, P. (2000) Robust Image Hashing, Proc. IEEE Int. Conf. Image Process. (ICIP), Vol. 3, pp. 664\u2013666.","DOI":"10.1109\/ICIP.2000.899541"},{"key":"2016090818333954000_bxw060v1.22","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2002.802018"},{"key":"2016090818333954000_bxw060v1.23","doi-asserted-by":"publisher","DOI":"10.1109\/83.967402"},{"key":"2016090818333954000_bxw060v1.24","doi-asserted-by":"publisher","DOI":"10.1109\/6046.923823"},{"key":"2016090818333954000_bxw060v1.25","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2007.916273"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/60\/4\/497\/11077784\/bxw060.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T23:46:13Z","timestamp":1657237573000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxw060"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,8]]},"references-count":25,"alternative-id":["10.1093\/comjnl\/bxw060"],"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxw060","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,8]]}}}