liu.seSearch for publications in DiVA
Change search
Link to record
Permanent link

Direct link
BETA
Publications (10 of 29) Show all publications
Asplund, M., Lövhall, J. & Nadjm-Tehrani, S. (2018). In-store payments using Bitcoin. In: 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS): . Paper presented at 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS). IEEE
Open this publication in new window or tab >>In-store payments using Bitcoin
2018 (English)In: 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS), IEEE, 2018Conference paper, Published paper (Refereed)
Abstract [en]

The possibility of in-store payments would further increase the potential usefulness of cryptocurrencies. However, this would require much faster transaction verification than current solutions provide (one hour for Bitcoin) since customers are likely not prepared to wait a very long time for their purchase to be accepted by a store. We propose a solution for enabling in-store payments with waiting times in the order of a few seconds, which is still compatible with the current Bitcoin protocol. The idea is based on a payment card in combination with a protocol for ensuring that losing a card does not mean losing the money on it. We analyse the required transaction verification delay and also the potentially added risks that the solution brings compared to current systems.

Place, publisher, year, edition, pages
IEEE, 2018
Series
International Conference on New Technologies Mobility and Security, ISSN 2157-4952
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-152219 (URN)10.1109/NTMS.2018.8328738 (DOI)000448864200068 ()978-1-5386-3662-6 (ISBN)978-1-5386-3663-3 (ISBN)
Conference
9th IFIP International Conference on New Technologies, Mobility and Security (NTMS)
Note

Funding agencies: Research Centre on Resilient Information and Control Systems (RICS) - Swedish civil contingencies agency (MSB)

Available from: 2018-10-22 Created: 2018-10-22 Last updated: 2019-06-19
Lin, C.-Y., Nadjm-Tehrani, S. & Asplund, M. (2018). Timing-Based Anomaly Detection in SCADA Networks. In: Critical Information Infrastructures Security: . Paper presented at CRITIS, Lucca, Italy, 8-13 October, 2017 (pp. 48-59). Springer
Open this publication in new window or tab >>Timing-Based Anomaly Detection in SCADA Networks
2018 (English)In: Critical Information Infrastructures Security, Springer, 2018, p. 48-59Conference paper, Published paper (Refereed)
Abstract [en]

Supervisory Control and Data Acquisition (SCADA) systems that operate our critical infrastructures are subject to increased cyber attacks. Due to the use of request-response communication in polling, SCADA traffic exhibits stable and predictable communication patterns. This paper provides a timing-based anomaly detection system that uses the statistical attributes of the communication patterns. This system is validated with three datasets, one generated from real devices and two from emulated networks, and is shown to have a False Positive Rate (FPR) under 1.4%. The tests are performed in the context of three different attack scenarios, which involve valid messages so they cannot be detected by whitelisting mechanisms. The detection accuracy and timing performance are adequate for all the attack scenarios in request-response communications. With other interaction patterns (i.e. spontaneous communications), we found instead that 2 out of 3 attacks are detected.

Place, publisher, year, edition, pages
Springer, 2018
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349
Keywords
SCADA, Industrial Control System (ICS), Anomaly detection, Traffic periodicity
National Category
Computer Systems
Identifiers
urn:nbn:se:liu:diva-154394 (URN)10.1007/978-3-319-99843-5_5 (DOI)978-3-319-99842-8 (ISBN)978-3-319-99843-5 (ISBN)
Conference
CRITIS, Lucca, Italy, 8-13 October, 2017
Projects
RICS (Resilient Information and Control Systems)
Available from: 2019-02-11 Created: 2019-02-11 Last updated: 2019-02-15Bibliographically approved
Asplund, M. & Nadjm-Tehrani, S. (2016). Attitudes and Perceptions of IoT Security in Critical Societal Services. IEEE Access, 4, 2130-2138
Open this publication in new window or tab >>Attitudes and Perceptions of IoT Security in Critical Societal Services
2016 (English)In: IEEE Access, E-ISSN 2169-3536, Vol. 4, p. 2130-2138Article in journal (Refereed) Published
Abstract [en]

A quiet revolution that impacts several sectors, ranging over transport, home automation, energy, industrial control, and health services is undergoing with addition of new networked devices leading to enhanced services. In this paper, we aim to identify information security requirements that are common over several (vertical) sectors, and in particular, ones that impact critical societal services, namely, the energy, water, and health management systems. We present the results of an interview-based study where actors in these sectors were asked about their perceptions and attitudes on the security of Internet of Things (IoT). We set these perceptions and attitudes in context through a literature review of IoT security, and relate to current challenges in this area. This paper demonstrates that despite an overall optimistic view on IoT in critical societal services, there is a lack of consensus on risks related to IoT security.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2016
Keywords
Internet of Things, security, risk, critical infrastructure, health
National Category
Computer Systems
Identifiers
urn:nbn:se:liu:diva-130081 (URN)10.1109/ACCESS.2016.2560919 (DOI)000377414800010 ()
Note

Funding Agencies|Vinnova; Formas; Swedish Energy Agency under IoT Strategy Program; RICS:The Research Centre on Resilient Information and Control Systems - Swedish Civil Contingencies Agency; CENIIT Project [14.04]

Available from: 2016-07-06 Created: 2016-07-06 Last updated: 2018-08-14Bibliographically approved
Vergara Alonso, E. J. & Nadjm-Tehrani, S. (2016). Fairness and Incentive Considerations in Energy Apportionment Policies. ACM Transactions on Modeling and Performance Evaluation of Computing Systems, 2(1)
Open this publication in new window or tab >>Fairness and Incentive Considerations in Energy Apportionment Policies
2016 (English)In: ACM Transactions on Modeling and Performance Evaluation of Computing Systems, ISSN 2376-3639, Vol. 2, no 1Article in journal (Refereed) Published
Abstract [en]

The energy consumption of a system is determined by the system component usage patterns and interactions between the coexisting entities and resources. Energy accounting plays an essential role to reveal the contribution of each entity to the total consumption and for energy management. Unfortunately, energy accounting inherits the apportionment problem of accounting in general, which does not have a general single best solution. In this paper we leverage cooperative game theory commonly used in cost allocation problems to study the energy apportionment problem, i.e., the problem of prescribing the actual energy consumption of a system to the consuming entities (e.g., applications, processes or users of the system).

We identify five relevant fairness properties for energy apportionment and present a detailed categorisation and analysis of eight previously proposed energy apportionment policies from different fields in computer and communication systems. In addition, we propose two novel energy apportionment policies based on cooperative game theory which provide strong fairness notion and a rich incentive structure. Our comparative analysis in terms of the identified five fairness properties as well as information requirement and computational complexity shows that there is a trade-off between fairness and the other evaluation criteria. We provide guidelines to select an energy apportionment policy depending on the purpose of the apportionment and the characteristics of the system.

Place, publisher, year, edition, pages
ACM Digital Library, 2016
Keywords
energy apportionment, energy accounting, cooperative game theory, energy management
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-138088 (URN)10.1145/2970816 (DOI)
Available from: 2017-06-08 Created: 2017-06-08 Last updated: 2018-08-14Bibliographically approved
Vergara, E. J., Nadjm-Tehrani, S. & Asplund, M. (2016). Fairness and Incentive Considerations in Energy Apportionment Policies. ACM Transactions on Modeling and Performance Evaluation of Computing Systems, 2(1)
Open this publication in new window or tab >>Fairness and Incentive Considerations in Energy Apportionment Policies
2016 (English)In: ACM Transactions on Modeling and Performance Evaluation of Computing Systems, ISSN 2376-3639, Vol. 2, no 1Article in journal (Refereed) Published
Abstract [en]

The energy consumption of a system is determined by the system component usage patterns and interactions between the coexisting entities and resources. Energy accounting plays an essential role in revealing the contribution of each entity to the total consumption and for energy management. Unfortunately, energy accounting inherits the apportionment problem of accounting in general, which does not have a general single best solution. In this article, we leverage cooperative game theory, which is commonly used in cost allocation problems to study the energy apportionment problem, that is, the problem of prescribing the actual energy consumption of a system to the consuming entities (e.g., applications, processes, or users of the system).

We identify five relevant fairness properties for energy apportionment and present a detailed categorisation and analysis of eight previously proposed energy apportionment policies from different fields in computer and communication systems. In addition, we propose two novel energy apportionment policies based on cooperative game theory that provide strong fairness notion and a rich incentive structure. Our comparative analysis in terms of the identified five fairness properties as well as information requirement and computational complexity shows that there is a tradeoff between fairness and the other evaluation criteria. We provide guidelines to select an energy apportionment policy depending on the purpose of the apportionment and the characteristics of the system.

Place, publisher, year, edition, pages
ACM Press, 2016
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:liu:diva-134269 (URN)10.1145/2970816 (DOI)
Available from: 2019-02-11 Created: 2019-02-11 Last updated: 2019-02-20Bibliographically approved
Asplund, M. (2015). Model-based Membership Verification in Vehicular Platoons. In: Proceedings: 2015 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshops . Paper presented at The 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshops, Rio de Janeiro, Brazil, 22 June 2015 (pp. 125-132). IEEE Computer Society
Open this publication in new window or tab >>Model-based Membership Verification in Vehicular Platoons
2015 (English)In: Proceedings: 2015 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshops , IEEE Computer Society, 2015, p. 125-132Conference paper, Published paper (Refereed)
Abstract [en]

Cooperative vehicular systems have the potentialto significantly increase traffic efficiency and safety. However,they also raise the question of to what extent information thatis received from other vehicles can be trusted. In this paperwe present a novel approach for increasing the trustworthinessof cooperative driving through a model-based approach forverifying membership views in vehicular platoons. We define aformal model for platoon membership, cooperative awarenessclaims, and membership verification mechanisms. With the helpof a satisfiability solver, we are able to quantitatively analysethe impact of different system parameters on the verifiability ofreceived information. Our results demonstrate the importance ofcross validating received messages, as well as the surprising diffi-culty in establishing correct membership views despite powerfulverification mechanisms.

Place, publisher, year, edition, pages
IEEE Computer Society, 2015
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-123682 (URN)10.1109/DSN-W.2015.21 (DOI)978-1-4673-8044-7 (ISBN)
Conference
The 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshops, Rio de Janeiro, Brazil, 22 June 2015
Projects
Verifiable real-time coordination for safe cooperative driving
Available from: 2016-01-08 Created: 2016-01-08 Last updated: 2018-01-10Bibliographically approved
Asplund, M. & Nadjm-Tehrani, S. (2015). Rapid selection and dissemination of urgent messages over delay-tolerant networks (DTNs). In: J. Rodrigues (Ed.), Advances in Delay-Tolerant Networks (DTNs): Architecture and Enhanced Performance (pp. 187-203). Elsevier
Open this publication in new window or tab >>Rapid selection and dissemination of urgent messages over delay-tolerant networks (DTNs)
2015 (English)In: Advances in Delay-Tolerant Networks (DTNs): Architecture and Enhanced Performance / [ed] J. Rodrigues, Elsevier, 2015, p. 187-203Chapter in book (Refereed)
Abstract [en]

Today many new applications are emerging that take advantage of wireless communication in handheld and embedded devices. Some of these emerging applications, such as information sharing in vehicular systems, have strong requirements for timely message dissemination, even if the network is not always 100% connected. In this chapter we discuss message differentiation mechanisms that can be used in intermittently connected networks to improve delivery and latency properties when messages have a limited time to live in the network. We present a simulation-based study on a large-scale vehicular scenario comparing different prioritisation mechanisms for a partition-tolerant manycast protocol. We show that negative effects of overloads can be significantly reduced by using information within the message about how far it has spread and how much time is remaining.

Place, publisher, year, edition, pages
Elsevier, 2015
Series
Woodhead Publishing Series in Electronic and Optical Materials ; 67
Keywords
Delay-tolerant networks, Vehicular, Message differentiation, Message delay
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-114292 (URN)10.1533/9780857098467.2.187 (DOI)978-0-85709-840-5 (ISBN)978-0-85709-846-7 (ISBN)
Available from: 2015-02-17 Created: 2015-02-17 Last updated: 2018-08-14Bibliographically approved
Bianzino, A. P., Asplund, M., Vergara Alonso, E. J. & Nadjm-Tehrani, S. (2014). Cooperative proxies: Optimally trading energy and quality of service in mobile devices. Computer Networks, 75(Part A), 297-312
Open this publication in new window or tab >>Cooperative proxies: Optimally trading energy and quality of service in mobile devices
2014 (English)In: Computer Networks, ISSN 1389-1286, E-ISSN 1872-7069, Vol. 75, no Part A, p. 297-312Article in journal (Refereed) Published
Abstract [en]

This work studies the energy and quality of service (QoS) trade-off in the context of mobile devices with two communication interfaces (a high energy and a low energy interface). We propose an optimisation scheme during underload scenarios where proxy groups are dynamically formed exploiting both interfaces. The scheme integrates a reward mechanism that compensates a proxy while carrying other group members’ traffic, and deals with churn (joining and leaving of nodes) in a cell area. For traffic flows that approximate knowledge about current services we show that the scheme can achieve energy savings of 60% for all mobile nodes as whole. We also demonstrate the impact on disruption-sensitive flows as a function of the traffic mix, and that the use of rewards for selection of proxies is a fair mechanism in the long term.

Place, publisher, year, edition, pages
Elsevier, 2014
Keywords
Green networks, Mobile, Energy efficiency, User terminals, Wireless communication energy, Bandwidth sharing
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-114290 (URN)10.1016/j.comnet.2014.10.013 (DOI)000347602900019 ()
Projects
Swedish national Graduate school in computer science (CUGS)
Available from: 2015-02-17 Created: 2015-02-17 Last updated: 2018-08-14Bibliographically approved
Asplund, M. (2014). Poster: Securing Vehicular Platoon Membership. In: Proceedings of IEEE Vehicular Networking Conference (VNC): . Paper presented at IEEE Vehicular Networking Conference (pp. 119-120). IEEE Computer Society
Open this publication in new window or tab >>Poster: Securing Vehicular Platoon Membership
2014 (English)In: Proceedings of IEEE Vehicular Networking Conference (VNC), IEEE Computer Society, 2014, p. 119-120Conference paper, Poster (with or without abstract) (Refereed)
Abstract [en]

Vehicular platoons have the potential to bring considerable fuel-savings and increase traffic efficiency. A key component for the next generation platoon systems is a secure membership component which can accommodate membership changes in a dynamic and potentially hostile environment. In this poster paper we analyse the conditions for creating a secure membership protocol which is resilient to attacks and faults in the communication protocols.

Place, publisher, year, edition, pages
IEEE Computer Society, 2014
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-114294 (URN)10.1109/VNC.2014.7013324 (DOI)978-1-4799-7660-7 (ISBN)
Conference
IEEE Vehicular Networking Conference
Projects
Verifiable real-time coordination for safe cooperative driving
Available from: 2015-02-17 Created: 2015-02-17 Last updated: 2018-01-11Bibliographically approved
Viel, B. & Asplund, M. (2014). Why is fingerprint-based indoor localization still so hard?. In: IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops): . Paper presented at The Sixth International Workshop on Information Quality and Quality of Service for Pervasive Computing, 24-28 March 2014, Budapest, Hungary (pp. 443-448). IEEE Computer Society
Open this publication in new window or tab >>Why is fingerprint-based indoor localization still so hard?
2014 (English)In: IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops), IEEE Computer Society, 2014, p. 443-448Conference paper, Published paper (Refereed)
Abstract [en]

Wireless indoor localization systems and especially signal strength fingerprinting techniques have been the subject of significant research efforts in the last decades. However, most of the proposed solutions require a costly site-survey to build the radio map which can be used to match radio signatures with specific locations. We investigate a novel indoor localization system that addresses the data collection problem by progressively and semi-autonomously creating a radio-map with limited interaction cost. Moreover, we investigate how spatiotemporal and hardware properties-based variations can affect the RSSI values collected and significantly influence the resulting localization. We show the impact of these fluctuations on our system and discuss possible mitigations.

Place, publisher, year, edition, pages
IEEE Computer Society, 2014
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-108326 (URN)10.1109/PerComW.2014.6815247 (DOI)000341402900091 ()2-s2.0-84901368208 (Scopus ID)978-1-4799-2736-4 (ISBN)
Conference
The Sixth International Workshop on Information Quality and Quality of Service for Pervasive Computing, 24-28 March 2014, Budapest, Hungary
Available from: 2014-06-26 Created: 2014-06-26 Last updated: 2018-01-11Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0003-1916-3398

Search in DiVA

Show all publications