{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:56:45Z","timestamp":1760241405678,"version":"build-2065373602"},"reference-count":18,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2018,3,10]],"date-time":"2018-03-10T00:00:00Z","timestamp":1520640000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Network coding approaches typically consider an unrestricted recoding of coded packets in the relay nodes to increase performance. However, this can expose the system to pollution attacks that cannot be detected during transmission, until the receivers attempt to recover the data. To prevent these attacks while allowing for the benefits of coding in mesh networks, the cache coding protocol was proposed. This protocol only allows recoding at the relays when the relay has received enough coded packets to decode an entire generation of packets. At that point, the relay node recodes and signs the recoded packets with its own private key, allowing the system to detect and minimize the effect of pollution attacks and making the relays accountable for changes on the data. This paper analyzes the delay performance of cache coding to understand the security-performance trade-off of this scheme. We introduce an analytical model for the case of two relays in an erasure channel relying on an absorbing Markov chain and an approximate model to estimate the performance in terms of the number of transmissions before successfully decoding at the receiver. We confirm our analysis using simulation results. We show that cache coding can overcome the security issues of unrestricted recoding with only a moderate decrease in system performance.<\/jats:p>","DOI":"10.3390\/info9030062","type":"journal-article","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T13:13:48Z","timestamp":1520860428000},"page":"62","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Performance of the Cache Coding Protocol"],"prefix":"10.3390","volume":"9","author":[{"given":"Behnaz","family":"Maboudi","sequence":"first","affiliation":[{"name":"Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan 45195, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6262-4834","authenticated-orcid":false,"given":"Hadi","family":"Sehat","sequence":"additional","affiliation":[{"name":"Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan 45195, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5918-7250","authenticated-orcid":false,"given":"Peyman","family":"Pahlevani","sequence":"additional","affiliation":[{"name":"Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan 45195, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5325-8863","authenticated-orcid":false,"given":"Daniel E.","family":"Lucani","sequence":"additional","affiliation":[{"name":"Department of Engineering, Aarhus University, 8000 Aarhus, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,3,10]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Zhang, C., Fang, Y., and Zhu, X. (2009, January 19\u201325). Throughput-Delay Tradeoffs in Large-Scale MANETs with Network Coding. Proceedings of the IEEE INFOCOM 2009, Rio de Janeiro, Brazil.","DOI":"10.1109\/INFCOM.2009.5061922"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/18.850663","article-title":"Network information flow","volume":"46","author":"Ahlswede","year":"2000","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/TNET.2003.818197","article-title":"An algebraic approach to network coding","volume":"46","author":"Koetter","year":"2003","journal-title":"IEEE ACM Trans. Netw."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"4413","DOI":"10.1109\/TIT.2006.881746","article-title":"A Random Linear Network Coding Approach to Multicast","volume":"11","author":"Ho","year":"2006","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Joy, J., Yu-Ting, Y., Perez, V., Lu, D., and Gerla, M. (2014, January 3\u20136). A new approach to coding in content-based MANETs. Proceedings of the 2014 International Conference on Computing, Networking and Communications (ICNC), Honolulu, HI, USA.","DOI":"10.1109\/ICCNC.2014.6785326"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"4413","DOI":"10.1007\/s10207-016-0351-z","article-title":"An efficient homomorphic MAC-based scheme against data and tag pollution attacks in network coding-enabled wireless networks","volume":"16","author":"Esfahani","year":"2017","journal-title":"Int. J. Inf. Secur."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Lee, S.H., Gerla, M., Krawczyk, H., Lee, K.W., and Quaglia, E. (2011, January 25\u201327). Performance evaluation of secure network coding using homomorphic signature. Proceedings of the International Symposium on Network Coding, Beijing, China.","DOI":"10.1109\/ISNETCOD.2011.5978945"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Katz, J., Krawczyk, H., and Rabin, T. (2010, January 26\u201328). Secure network coding over the integers. Proceedings of the 13th International Conference on Practice and Theory in Public Key Cryptography, Paris, France.","DOI":"10.1007\/978-3-642-13013-7_9"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Agrawal, S., and Boneh, D. (2009, January 2\u20135). Homomorphic MACs: MAC-Based Integrity for Network Coding. Proceedings of the 7th Applied Cryptography and Network Security, (ACNS 2009), Paris, France.","DOI":"10.1007\/978-3-642-01957-9_18"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Dong, J., Curtmola, R., and Nita-Rotaru, C. (2009, January 16\u201319). Practical defenses against pollution attacks in intra-flow network coding for wireless mesh networks. Proceedings of the Second ACM Conference on Wireless Network Security, Zurich, Switzerland.","DOI":"10.1145\/1514274.1514292"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Lucani, D.E., M\u00e9dard, M., and Stojanovic, M. (2009, January 15\u201316). Broadcasting in time-division duplexing: A random linear network coding approach. Proceedings of the Network Coding, Theory, and Applications, 2009, (NetCod\u201909), Lausanne, Switzerland.","DOI":"10.1109\/NETCOD.2009.5191395"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Khamfroush, H., Pahlevani, P., Lucani, D.E., and Hundeboll, M. (2014, January 10\u201314). On the coded packet relay network in the presence of neighbors: Benefits of speaking in a crowded room. Proceedings of the IEEE International Conference on Communications (ICC), Sydney, Australia.","DOI":"10.1109\/ICC.2014.6883605"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1109\/JSAC.2014.2384291","article-title":"On optimal policies for network-coded cooperation: Theory and implementation","volume":"33","author":"Khamfroush","year":"2015","journal-title":"IEEE J. Sel. Area Commun."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"4413","DOI":"10.1109\/TCOMM.2014.2367016","article-title":"Network-Coded Cooperation over Time-Varying Channels","volume":"62","author":"Khamfroush","year":"2014","journal-title":"IEEE Trans. Commun."},{"key":"ref_15","unstructured":"Kemeny, J.G., and Snell, J.L. (1960). Finite Markov Chains, D. Van Nostrand."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1675","DOI":"10.1109\/TCOMM.2017.2657621","article-title":"Markov chain model for the decoding probability of sparse network coding","volume":"65","author":"Garrido","year":"2017","journal-title":"IEEE Trans. Commun."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"2330","DOI":"10.1109\/TIT.2011.2177562","article-title":"On coding for delay\u2014Network coding for time-division duplexing","volume":"58","author":"Lucani","year":"2012","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Pedersen, M.V., Heide, J., and Fitzek, F.H. (2011, January 9\u201313). Kodo: An open and research oriented network coding library. Proceedings of the International Conference on Research in Networking, Valencia, Spain.","DOI":"10.1007\/978-3-642-23041-7_15"}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/9\/3\/62\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T14:56:34Z","timestamp":1760194594000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/9\/3\/62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,10]]},"references-count":18,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2018,3]]}},"alternative-id":["info9030062"],"URL":"https:\/\/doi.org\/10.3390\/info9030062","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2018,3,10]]}}}