Securely reinforcing synchronization for embedded online contests

Wang, W; Xu, P; Yang, LT; Susilo, W; Chen, J

Securely reinforcing synchronization for embedded online contests

Wang, W Xu, P Yang, LT Susilo, W Chen, J

Permalink

Publication Type:: Journal Article
Citation:: ACM Transactions on Embedded Computing Systems, 2017, 16 (2)
Issue Date:: 2017-01-01

Closed Access

	Filename	Description	Size
	a58-wang.pdf	Published Version	429.98 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	Wang, W	en_US
dc.contributor.author	Xu, P	en_US
dc.contributor.author	Yang, LT	en_US
dc.contributor.author	Susilo, W	en_US
dc.contributor.author	Chen, J	en_US
dc.date.issued	2017-01-01	en_US
dc.identifier.citation	ACM Transactions on Embedded Computing Systems, 2017, 16 (2)	en_US
dc.identifier.issn	1539-9087	en_US
dc.identifier.uri	http://hdl.handle.net/10453/125800
dc.description.abstract	© 2017 ACM. When competing in eBay bidding, online games, or e-exams in embedded computing environments, people naturally face asynchronous starts from different computing devices, which is treated as a security risk of online contests. The security risks of online contests also include eavesdropping during data transmission without intended rights, and false starts by malicious competitors, which also means asynchrony in contests. Accordingly, online contests need security guarantees, especially on synchronization. In this article, for synchronic and secure starts in a contest, we update security requirements of confidentiality, anonymity, and synchrony, comparing the current work to our previous work. Based on the updated requirements, we propose a general framework for the Advanced Secure Synchronized Reading (ASSR) system, which can hold multiple contests simultaneously in the cloud. It is important to note that the system can ignore the impacts of heterogeneity among competitors. Considering the heterogeneity both on transmission and computing, we construct a novel Randomness-reused Identity Based Key Encapsulation Mechanism (RIBKEM) to support separable decapsulation, which can shorten both decryption delay and transmission delay with the best efforts. Finally, ASSR enhances synchronization achievement for contest starts with heterogeneous delays of competitors while satisfying other security requirements. As a complement, the analysis on the provable security of ASSR is given, as well as a further analysis on the achievement of synchronization.	en_US
dc.relation.ispartof	ACM Transactions on Embedded Computing Systems	en_US
dc.relation.isbasedon	10.1145/2899000	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject.classification	Computer Hardware & Architecture	en_US
dc.title	Securely reinforcing synchronization for embedded online contests	en_US
dc.type	Journal Article
utslib.citation.volume	2	en_US
utslib.citation.volume	16	en_US
utslib.for	0803 Computer Software	en_US
utslib.for	0805 Distributed Computing	en_US
utslib.for	1006 Computer Hardware	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 Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
pubs.organisational-group	/University of Technology Sydney/Strength - INEXT - Innovation in IT Services and Applications
utslib.copyright.status	closed_access	*
pubs.issue	2	en_US
pubs.publication-status	Published	en_US
pubs.volume	16	en_US

Abstract:

© 2017 ACM. When competing in eBay bidding, online games, or e-exams in embedded computing environments, people naturally face asynchronous starts from different computing devices, which is treated as a security risk of online contests. The security risks of online contests also include eavesdropping during data transmission without intended rights, and false starts by malicious competitors, which also means asynchrony in contests. Accordingly, online contests need security guarantees, especially on synchronization. In this article, for synchronic and secure starts in a contest, we update security requirements of confidentiality, anonymity, and synchrony, comparing the current work to our previous work. Based on the updated requirements, we propose a general framework for the Advanced Secure Synchronized Reading (ASSR) system, which can hold multiple contests simultaneously in the cloud. It is important to note that the system can ignore the impacts of heterogeneity among competitors. Considering the heterogeneity both on transmission and computing, we construct a novel Randomness-reused Identity Based Key Encapsulation Mechanism (RIBKEM) to support separable decapsulation, which can shorten both decryption delay and transmission delay with the best efforts. Finally, ASSR enhances synchronization achievement for contest starts with heterogeneous delays of competitors while satisfying other security requirements. As a complement, the analysis on the provable security of ASSR is given, as well as a further analysis on the achievement of synchronization.

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

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