GraphCrypto: Next generation data security approach towards sustainable smart city building

Mishra, AK; Puthal, D; Tripathy, AK

GraphCrypto: Next generation data security approach towards sustainable smart city building

Mishra, AK Puthal, D

Tripathy, AK

Permalink

Publisher:: ELSEVIER
Publication Type:: Journal Article
Citation:: Sustainable Cities and Society, 2021, 72
Issue Date:: 2021-09-01

Closed Access

	Filename	Description	Size
	1-s2.0-S2210670721003401-main.pdf	Published version	5.34 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Mishra, AK
dc.contributor.author	Puthal, D https://orcid.org/0000-0002-8332-278X
dc.contributor.author	Tripathy, AK
dc.date.accessioned	2022-05-14T00:26:27Z
dc.date.available	2022-05-14T00:26:27Z
dc.date.issued	2021-09-01
dc.identifier.citation	Sustainable Cities and Society, 2021, 72
dc.identifier.issn	2210-6707
dc.identifier.issn	2210-6715
dc.identifier.uri	http://hdl.handle.net/10453/157332
dc.description.abstract	Data confidentiality and integrity are essential security goals in the data communication in the smart city or similar applications. Despite significant changes in modern data communication systems and devices, the cryptosystems are still the primary option to achieve data security. Several cryptosystems have been developed, implemented and standardized to date. However, there is always a continuous demand for a new cryptosystem for providing security during data communication. In this paper, a novel symmetric cryptosystem is presented for achieving data confidentiality. The proposed cryptosystem is a graph-based system, where an algebraic structure of directed graphs along with a novel operation is defined to provide the base of the cryptosystem. Here, a directed graph represents a plaintext, a ciphertext, and a secret key as well. The defined operation is used for encrypting and decrypting plaintext and ciphertext graphs. The proposed cryptosystem provides a simplified transformation process and representation of plaintext to plaintext graph. The correctness of the proposed cryptosystem is validated, and also shown that the conventional brute-force approach to obtain the key from either plaintext or ciphertext is exponential and this computational time is significantly higher than AES. This implies that the proposed cryptosystem is highly secured against this attack. The proposed cryptosystem is implemented and compared with AES and the results infer that it incurs a marginally higher execution time than the AES for larger plaintext due to the involvement of matrix operations.
dc.language	English
dc.publisher	ELSEVIER
dc.relation.ispartof	Sustainable Cities and Society
dc.relation.isbasedon	10.1016/j.scs.2021.103056
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	0502 Environmental Science and Management, 1205 Urban and Regional Planning
dc.title	GraphCrypto: Next generation data security approach towards sustainable smart city building
dc.type	Journal Article
utslib.citation.volume	72
utslib.for	0502 Environmental Science and Management
utslib.for	1205 Urban and Regional Planning
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Information, Systems and Modelling
utslib.copyright.status	closed_access	*
dc.date.updated	2022-05-14T00:26:22Z
pubs.publication-status	Published
pubs.volume	72

Abstract:

Data confidentiality and integrity are essential security goals in the data communication in the smart city or similar applications. Despite significant changes in modern data communication systems and devices, the cryptosystems are still the primary option to achieve data security. Several cryptosystems have been developed, implemented and standardized to date. However, there is always a continuous demand for a new cryptosystem for providing security during data communication. In this paper, a novel symmetric cryptosystem is presented for achieving data confidentiality. The proposed cryptosystem is a graph-based system, where an algebraic structure of directed graphs along with a novel operation is defined to provide the base of the cryptosystem. Here, a directed graph represents a plaintext, a ciphertext, and a secret key as well. The defined operation is used for encrypting and decrypting plaintext and ciphertext graphs. The proposed cryptosystem provides a simplified transformation process and representation of plaintext to plaintext graph. The correctness of the proposed cryptosystem is validated, and also shown that the conventional brute-force approach to obtain the key from either plaintext or ciphertext is exponential and this computational time is significantly higher than AES. This implies that the proposed cryptosystem is highly secured against this attack. The proposed cryptosystem is implemented and compared with AES and the results infer that it incurs a marginally higher execution time than the AES for larger plaintext due to the involvement of matrix operations.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/157332