Secure Information Flow for IoT Applications

Tri Ngo - The University of Danang – University of Science and Technology, Vietnam
Nhat Vien Duy Nguyen - The University of Danang – University of Science and Technology, Vietnam


Citation Format:



DOI: http://dx.doi.org/10.30630/joiv.3.2.231

Abstract


This paper discusses how to ensure security, i.e., confidentiality and integrity properties, for data in IoT applications. While confidentiality could be assessed via information flow analysis, integrity is ensured by error-correcting codes. In addition to errors, many communication channels also cause erasures, i.e., the demodulator cannot decide which symbol the received waveform represents. The paper proposes a method that might correct both errors and erasures together. Our method is efficient in reducing memory storage as well as decoding complexity.

Keywords


Confidentiality; Integrity; Information Flow; Erasure; Separating Matrix; Covering Design.

Full Text:

PDF

References


K. A. S. Abdel-Ghaffar and J. H. Weber, “Separating erasures from errors for decoding”, Proceedings of the IEEE International Symposium on Information Theory, Toronto, Canada, pp. 215-219, July 6-11, 2008.

J. H. Weber, Lecture Notes: Error-Correcting Codes, Delft University of Technology, 2007.

J. H. Dinitz, D.R. Stinson, Contemporary Design Theory, A Collection of Surveys, A Wiley-Inter-Science Publication, 1992.

C. Di, D. Proietti, I.E. Telatar, T. J. Richardson, and R. L. Urbanke, “Finite-length analysis of low-density parity-check codes on the binary erasure channel”, IEEE Trans. Inform. Theory, vol. 48, no. 6, pp. 1570-1579, June 2002.

T. M. Ngo, M. Huisman, “Complexity and information flow analysis for multi-threaded programs”, Eur. Phys. J. Spec. Top. 226 (10), 2375–2392 (2017)

H. D. L. Hollmann and L. M. G. M. Tolhuizen, “On parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size,” IEEE Trans. Inform. Theory, vol. 53, no. 2, pp. 823-828, February 2007.

La Jolla Covering Repository, http://www.ccrwest.org/cover.html.

R. M. Roth, Introduction to Coding Theory. Cambridge, UK: Cambridge University Press, 2006.

M. Schwartz and A. Vardy, “On the stopping distance and the stopping redundancy of codes,” IEEE Trans. Inform. Theory, vol. 52, no. 3, pp. 922-932, March 2006.

J. H. Weber and K. A. S. Abdel-Ghaffar, “Results on parity-check matrices with optimal stopping and/or dead-end set enumerators,” IEEE Trans. Inform. Theory, vol. 54, no. 3, pp. 1368-1374, March 2008.

S. Lin and D. J. Costello, Jr., Error Control Coding, Pearson Education International, 2004.

F. J. Mac Williams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland Publishing Company, 1977.

S. A. Vanstone and P. C. van Oorschot, An Introduction to Error-Correcting Codes with Applications, Norwell, MA: Kluwer, 1989.

J. A. Goguen, J. Meseguer, “Security policies and security models”. IEEE Symposium on Security and Privacy, pp. 11–20 (1982).




Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

__________________________________________________________________________
JOIV : International Journal on Informatics Visualization
ISSN 2549-9610  (print) | 2549-9904 (online)
Organized by Department of Information Technology - Politeknik Negeri Padang, and Institute of Visual Informatics - UKM and Soft Computing and Data Mining Centre - UTHM
W : http://joiv.org
E : joiv@pnp.ac.id, hidra@pnp.ac.id, rahmat@pnp.ac.id

View JOIV Stats

Creative Commons License is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.