Graph-Based Symmetric Crypto-System for Data Confidentiality

Mishra, AK; Obaidat, MS; Puthal, D; Tripathy, AK; Choo, KKR

Graph-Based Symmetric Crypto-System for Data Confidentiality

Mishra, AK Obaidat, MS Puthal, D

Tripathy, AK Choo, KKR

Permalink

Publication Type:: Conference Proceeding
Citation:: 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings, 2018
Issue Date:: 2018-01-01

Closed Access

	Filename	Description	Size
	Graph-Based Symmetric Crypto-System for Data Confidentiality.pdf	Published version	167.17 kB	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	en_US
dc.contributor.author	Obaidat, MS	en_US
dc.contributor.author	Puthal, D https://orcid.org/0000-0002-8332-278X	en_US
dc.contributor.author	Tripathy, AK	en_US
dc.contributor.author	Choo, KKR	en_US
dc.date.issued	2018-01-01	en_US
dc.identifier.citation	2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings, 2018	en_US
dc.identifier.isbn	9781538647271	en_US
dc.identifier.uri	http://hdl.handle.net/10453/134566
dc.description.abstract	© 2018 IEEE. The use of cryptography systems in cyber security domain has become a primary focus to maintain data confidentiality. Several cryptography solutions exist for protecting data against confidentiality attack. Due to the advancement of computing infrastructure, there is always a need for novel security solution to protect data and introduce more complexity to the intruder. In this paper, a novel graph-based crypto-system is proposed to provide data confidentiality during communication between users and devices. The proposed crypto-system uses a set of graphs of order n along with an operation defined over it to form a group algebraic structure. Using this group, plaintext, ciphertext, and secret key are represented as a graph. The encryption and decryption processes are performed over the graphs using the operation defined in the group. It is then demonstrated that the proposed crypto-system is valid, and for a large n value, brute-forcing attempts to derive the key from plaintext or ciphertext is computationally infeasible.	en_US
dc.relation.ispartof	2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings	en_US
dc.relation.isbasedon	10.1109/GLOCOM.2018.8647844	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Graph-Based Symmetric Crypto-System for Data Confidentiality	en_US
dc.type	Conference Proceeding
utslib.for	0804 Data Format	en_US
utslib.for	080303 Computer System Security	en_US
pubs.embargo.period	Not known	en_US
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	*
pubs.publication-status	Published	en_US

Abstract:

© 2018 IEEE. The use of cryptography systems in cyber security domain has become a primary focus to maintain data confidentiality. Several cryptography solutions exist for protecting data against confidentiality attack. Due to the advancement of computing infrastructure, there is always a need for novel security solution to protect data and introduce more complexity to the intruder. In this paper, a novel graph-based crypto-system is proposed to provide data confidentiality during communication between users and devices. The proposed crypto-system uses a set of graphs of order n along with an operation defined over it to form a group algebraic structure. Using this group, plaintext, ciphertext, and secret key are represented as a graph. The encryption and decryption processes are performed over the graphs using the operation defined in the group. It is then demonstrated that the proposed crypto-system is valid, and for a large n value, brute-forcing attempts to derive the key from plaintext or ciphertext is computationally infeasible.

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

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