Change search
Refine search result
3456789 251 - 300 of 884
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 251.
    Fischer-Hübner, Simone
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Angulo, Julio
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Pulls, Tobias
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    How can Cloud Users be Supported in Deciding on, Tracking and Controlling How their Data are Used?2014In: Privacy and Identity Management for Emerging Services and Technologies: 8th IFIP WG 9.2, 9.5, 9.6/11.7, 11.4, 11.6 International Summer School, Nijmegen, The Netherlands, June 17-21, 2013, Revised Selected Papers, Springer, 2014, p. 77-92Conference paper (Refereed)
    Abstract [en]

    Transparency is a basic privacy principle and factor of social trust. However, the processing of personal data along a cloud chain is often rather intransparent to the data subjects concerned. Transparency Enhancing Tools (TETs) can help users in deciding on, tracking and controlling their data in the cloud. However, TETs for enhancing privacy also have to be designed to be both privacy-preserving and usable. In this paper, we provide requirements for usable TETs for the cloud. The requirements presented in this paper were derived in two ways; at a stakeholder workshop and through a legal analysis. Here we discuss design principles for usable privacy policies and give examples of TETs which enable end users to track their personal data. We are developing them using both privacy and usability as design criteria.

  • 252.
    Fischer-Hübner, Simone
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Berthold, Stefan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Privacy Enhancing Technologies.2017In: Computer and Information Security Handbook / [ed] John Vacca, Morgan Kaufmann Publishers, 2017, 3, p. 759-778Chapter in book (Refereed)
    Abstract [en]

    In our modern information age, recent technical developments and trends, such as mobile and pervasive computing, big data, cloud computing, and Web 2.0 applications, increasingly pose privacy dilemmas. Due to the low costs and technical advances of storage technologies, masses of personal data can easily be stored. Once disclosed, these data may be retained forever, often without the knowledge of the individuals concerned, and be removed with difficulty. Hence, it has become hard for individuals to manage and control their personal spheres. Both legal and technical means are needed to protect privacy and to (re-)establish the individuals' control. This chapter provides an overview to the area of Privacy-Enhancing Technologies (PETs), which help to protect privacy by technically enforcing legal privacy principles. It will start with defining the legal foundations of PETs, and will present a classification of PETs as well as a definition of traditional privacy properties that PETs are addressing and metrics for measuring the level of privacy that PETs are providing. Then, a selection of the most relevant PETs is presented.

  • 253.
    Fischer-Hübner, Simone
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Berthold, Stefan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Privacy-Enhancing Technologies2013In: Computer and Information Security Handbook, Elsevier, 2013, 2, p. 755-772Chapter in book (Other academic)
    Abstract [en]

    In our modern information age, recent technical developments and trends, such as mobile and pervasive computing, cloud computing, and Web 2.0 applications, increasingly pose privacy dilemmas. Due to the low costs and technical advances of storage technologies, masses of personal data can easily be stored. Once disclosed, these data may be retained forever, often without the knowledge of the individuals concerned, and be removed with difficulty. Hence, it has become hard for individuals to manage and control their personal spheres. Both legal and technical means are needed to protect privacy and to (re)establish the individuals’ control. This chapter provides an overview to the area of privacy-enhancing technologies (PETs), which help to protect privacy by technically enforcing legal privacy principles. It will start with defining the legal foundations of PETs and will present a classification of PETs as well as a definition of traditional privacy properties that PETs are addressing and metrics for measuring the level of privacy that PETs are providing. Then, a selection of the most relevant PETs is presented.

  • 254.
    Fischer-Hübner, Simone
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    de Leeuw, ElisabethMitchell, Chris
    Policies and Research in Identity Management: Third IFIP WG 11.6 Working Conference, IDMAN 2013, London, UK, April 8-9, 2013. Proceedings2013Conference proceedings (editor) (Refereed)
  • 255.
    Fischer-Hübner, Simone
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013). Karlstad University, Faculty of Economic Sciences, Communication and IT, Centre for HumanIT.
    Hermann, Dominik
    University of Bamberg, Germany.
    Benutzbare Lösungen für den Datenschutz2018In: Sicherheitskritische Mensch-Computer-Interaktion: Interaktive Technologien und Soziale Medien im Krisen- und Sicherheitsmanagement / [ed] Christian Reuter, Wiesbaden, Tyskland: Springer, 2018, p. 119-138Chapter in book (Refereed)
  • 256.
    Fischer-Hübner, Simone
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Martucci, Leon
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Privacy in Social Collective Intelligence System,2014In: Social Collective Intelligence / [ed] Miorandi, D., Maltese, V., Rovatsos, M., Nijholt, A., & Stewart, J., Heidellberg: Springer, 2014Chapter in book (Refereed)
  • 257.
    Fischer-Hübner, Simone
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Martucci, Leonardo A.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Privacy in Social Collective Intelligence Systems2014In: Social Collective Intelligence: Combining the Powers of Humans and Machines to Build a Smarter Society / [ed] Miorandi, D., Maltese, V., Rovatsos, M., Nijholt, A., Stewart, J., Switzerland: Springer, 2014, 1, p. 105-124Chapter in book (Refereed)
    Abstract [en]

    The impact of Social Collective Intelligent Systems (SCIS) on the individual right of privacy is discussed in this chapter under the light of the relevant privacy principles of the European Data Protection Legal Framework and the Organization for Economic Co-operation and Development (OECD) Privacy Guidelines. This chapter analyzes the impact and limits of profiling, provenance and reputation on the right of privacy and review the legal privacy protection for profiles. From the technical perspective, we discuss opportunities and challenges for designing privacy-preserving systems for SCIS concerning collectives and decentralized systems. Furthermore, we present a selection of privacy-enhancing technologies that are relevant for SCIS: anonymous credentials, transparency-enhancing tools and the PrimeLife Policy Language. Finally, we discuss how these technologies can help to enforce the main legal principles of the European Data Protection Legal Framework, and argue how provenance and reputation can be designed in a privacy preserving manner.

  • 258.
    Fischer-Hübner, Simone
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Martucci, Leonardo
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Fritsch, Lothar
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Pulls, Tobias
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Herold, Sebastian
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Iwaya, Leonardo H
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Alfredsson, Stefan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Albin, Zuccato
    ATEA Sverige AB, Stockholm, Sweden.
    A MOOC on Privacy by Design and the GDPR2018In: Information Security Education: Towards a Cybersecure Society / [ed] Lynette Drevin, Marianthi Theocharidou, Cham, Switzerland: Springer, 2018, p. 95-107Conference paper (Refereed)
    Abstract [en]

    In this paper we describe how we designed a massive open online course (mooc) on Privacy by Design with a focus on how to achieve compliance with the eu gdpr principles and requirements in it engineering and management. This mooc aims at educating both professionals and undergraduate students, i.e., target groups with distinct educational needs and requirements, within a single course structure. We discuss why developing and publishing such a course is a timely decision and fulfills the current needs of the professional and undergraduate education. The mooc is organized in five modules, each of them with its own learning outcomes and activities. The modules focus on different aspects of the gdpr that data protection officers have to be knowledgeable about, ranging from the legal basics, to data protection impact assessment methods, and privacy-enhancing technologies. The modules were delivered using hypertext, digital content and three video production styles: slides with voice-over, talking heads and interviews. The main contribution of this work is the roadmap on how to design a highly relevant mooc on privacy by design and the gdpr aimed at an heterogeneous audience.

  • 259.
    Framner, Erik
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Fischer-Hübner, Simone
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Lorünser, Thomas
    Austrian Institute of Techno Department of Safety and Security, Austria .
    Alaqra, Alaa
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Pettersson, John Sören
    Karlstad University, Faculty of Arts and Social Sciences (starting 2013), Centre for HumanIT (from 2013). Karlstad University, Faculty of Arts and Social Sciences (starting 2013), Karlstad Business School (from 2013).
    Making secret sharing based cloud storage usable2019In: Information and Computer Security, E-ISSN 2056-4961, Vol. 27, no 5, p. 647-667Article in journal (Refereed)
    Abstract [en]

    The purpose of this paper is to develop a usable configuration management for Archistar, whichutilizes secret sharing for redundantly storing data over multiple independent storage clouds in a secure andprivacy-friendly manner. Selecting the optimal secret sharing parameters, cloud storage servers and othersettings for securely storing the secret data shares, while meeting all of end user’s requirements and otherrestrictions, is a complex task. In particular, complex trade-offs between different protection goals and legalprivacy requirements need to be made.

  • 260.
    Fransson, Andreas
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Lindow, Erik
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Automatisk systemanalys i relation till GDPR med hjälp av spindlar2018Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [sv]

    GDPR är en lag som trädde i kraft den 25 Maj 2018 och ersatte i Sverige Personuppgiftslagen; lagen gäller för organisationer som hanterar personuppgifter tillhörande EU-medborgare eller personer som befinner sig i EU. Om en organisation inte följer GDPR kan det leda till betydande ekonomiska avgifter. Många hemsidor hanterar personuppgifter, både direkt genom t.ex. inloggningsuppgifter men också indirekt genom t.ex. tredjepartsförfrågningar. Det är därför många som är ansvariga för hemsidor nu står inför en stor utmaning, nämligen att följa GDPR. Den här rapporten beskriver utvecklingen av ett verktyg som vi utvecklade för att få en överblick över om hemsidan följer GDPR eller inte i vissa aspekter. Verktyget bygger på olika komponenter som analyserar en del av hemsidan var och deras sammanställda resultat visas i ett webbgränssnitt för användaren. Målet med verktyget var att kunna hitta minst ett fabricerat GDPR-relaterat fel i en testmiljö och det lyckades vi med. Verktyget kan inte säga om en sida följer GDPR eller inte men det kan peka ut potentiella problemområden som t.ex. på förhand ikryssade boxar, osäkra tredjepartsförfrågningar och informationsläckage via en rad webbteknologier. Denna information kan användas för att få en snabb överblick över problem och som grund för vidare analys.

  • 261.
    Fransson, Helge
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Lundh, Richard
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    ESB - Permanent överföring av meddelanden mellan två beställningssystem: Asynkront kösystem2018Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    An Enterprise Service Bus (ESB) is a software for bridging multiple systems, where you want to ensure that communication between systems occurs without data loss. This is tominimize the consequences of traffic interference.The aim of this bachelor dissertation is to see if it is possible to create a ESB for Netgain,which ensures that their two systems, one, a web based order form, the other a processingengine, that processes the orders, can communicate without data disappearing at transfer.This to ensure a more stable transfer than what they have today.

    The focus of the work has therefore been to write a system that is and feels stable for bothusers and administrators. Desired was also to write an administrator view to control thesystem and to write the project in JavaScript. Consideration was also given to how thetwo systems look, as these purchased systems can not be modified, we had to rely on theirbuilt-in api:s.

  • 262.
    Fredrik, Jonsson
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Event and conference management system based on near field communication2015Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    The meeting and conference industry is very varied, and conference designers strive to optimise the resources used during an event or conference. During several years of working in the conference and meeting industry the author found that some tasks associated with meetings and conferences are still handled manually. It was from the experience of these sometimes labour-intensive tasks that the idea sprung to introduce computer support. This thesis describes the development of a prototype in a mobile environment using Near Field Communication (NFC) as an identification token for an attendee at a conference or meeting. The conference centre where the conference and meeting scenario incorporated in the developed prototype is gathered from the author’s current place of work. As the prototype is developed as proof-of-concept it is not complete and needs to be developed further in order to be of use for a conference designer. The gain in reduced work can in some cases be quite intuitive, and in some other cases needs to be analysed. During the development of the prototype the author gained new knowledge in how mobile operating systems (OS) can differ compared to developing for OS aimed for stationary computers. One key difference was that the OS could at any time close or pause the application in order to free or save resources, such as memory or power, this behaviour needs to be managed and taken into consideration when developing for mobile OS. The author also learned how to use NFC and develop applications using NFC with an attendee-driven approach, which is important as the meeting industry strives to reduce the use of resources by making it more attendee-driven. The main idea behind the attendee-driven approach is to shift the tasks that are normally handled by the arranger of the conference, over to the conference attendee, e.g, the conference attendee books his or her lecture online, reducing the need of staff at a reservation call center.  

  • 263.
    Fredriksson, Niclas
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Design & implementation av kösystemet Inline2019Independent thesis Basic level (degree of Bachelor), 180 HE creditsStudent thesis
  • 264.
    Fritsch, Lothar
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Comments on ”The grant life cycle – a researcher’s handbook”2017Report (Other academic)
    Abstract [en]

    The grant proposing introduction tutorial for young researchers is undergoing revision at Karlstad University. The Grants and Innovation Office (GIO) has requested suggestions for improvements from researchers. This document is a review of the existing document, including suggestions, critique and recommendations for complementary information in support of the GIO presentation at the Computer Science Department on March 29, 2017.

  • 265.
    Fritsch, Lothar
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    How Big Data Helps SDN with data Protection and Privacy2018In: Big Data and Software Defined Networks / [ed] Javid Taheri, London, UK: Institution of Engineering and Technology, 2018, p. 339-351Chapter in book (Refereed)
  • 266.
    Fritsch, Lothar
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Partial commitment – "Try before you buy" and "Buyer’s remorse" for personal data in Big Data & Machine learning2017In: Trust Management XI: 11th IFIP WG 11.11 International Conference, IFIPTM 2017, Gothenburg, Sweden, June 12-16, 2017, Proceedings / [ed] Jan-Phillip Steghöfer, Babak Esfandiari, Cham, Switzerland: Springer, 2017, Vol. 505, p. 3-11Conference paper (Refereed)
    Abstract [en]

    The concept of partialcommitment is discussed in the context of personal privacy management in datascience. Uncommitted, promiscuous or partially committed user’s data may eitherhave a negative impact on model or data quality, or it may impose higherprivacy compliance cost on data service providers. Many Big Data (BD) andMachine Learning (ML) scenarios involve the collection and processing of largevolumes of person-related data. Data is gathered about many individuals as wellas about many parameters in individuals. ML and BD both spend considerable resourceson model building, learning, and data handling. It is therefore important toany BD/ML system that the input data trained and processed is of high quality,represents the use case, and is legally processes in the system. Additionalcost is imposed by data protection regulation with transparency, revocation andcorrection rights for data subjects. Data subjects may, for several reasons, only partially accept a privacypolicy, and chose to opt out, request data deletion or revoke their consent fordata processing. This article discusses the concept of partial commitment andits possible applications from both the data subject and the data controllerperspective in Big Data and Machine Learning.

  • 267.
    Fritsch, Lothar
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Privacy dark patterns in identity management2017In: Open Identity Summit 2017: Proceedings / [ed] Lothar Fritsch, Heiko Roßnagel, Detlef Hühnlein, Bonn: Gesellschaft für Informatik, 2017, p. 93-104Conference paper (Refereed)
    Abstract [en]

    This article presents three privacy dark patterns observed in identity management. Dark patterns are software design patterns that intentionally violate requirements, in the given case privacy requirements for identity management. First, the theoretical background is presented, and then next, the observed patterns are documented, described and formalized. The resulting dark patterns show how security is used as obfuscation of data collection, how the seemingly harmless collection of additional data is advertised to end users, and how the use of anonymization technology is actively discouraged by service providers.

  • 268.
    Fritsch, Lothar
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Summary of the 2nd 7DAV008 Peer Review PhD course deployment, 28-September-2017: Technical report LOF2017-3.2017Report (Other (popular science, discussion, etc.))
    Abstract [en]

    The course is intended to teach 1st-year doctoral students about peer reviewing as part of the scientific production cycle. As preparation for the course, the students receive a reading list with articles covering various aspects of peer review. Students then have to select one article they will summarize in a 10-minute presentation for the seminar group. Another student will complement as a respondent with a 5-minute slot for presentation.

     A half-day seminar is then held where the students will present and discuss their reviewed articles. This is followed up with a session on various professional and ethical issues to consider when acting as a reviewer. A following session shows and discusses examples of review reports, with possible contributions of student-received reviews. Finally, the course introduces Easychair, a platform for managing peer reviews.  Following the seminar course, the students have to perform five peer reviews in collaboration with and instruction from their supervisors. The course will be completed when the seminar and five reviews are completed.

  • 269.
    Fritsch, Lothar
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Fischer-Hübner, Simone
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Applications of Privacy and Security Research in the Upcoming Battlefield of Things2018In: Proceedings of the 17th European Conference on Cyber Warfare and Security / [ed] Audun Jøsang, Reading: Academic Conferences and Publishing International Limited, 2018Conference paper (Refereed)
    Abstract [en]

    This article presents the results of a trend scouting study on the applicability of contemporary information privacy and information security research in future defence scenarios in a 25-year-horizon. We sketch the expected digital warfare and defence environment as a “battlefield of things” where connected objects, connected soldiers and automated and autonomous sensing and acting systems are core elements. Based on this scenario, we discuss current research in information security and information privacy and their relevance and applicability for the future scenario.

  • 270.
    Fritsch, Lothar
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Fischer-Hübner, Simone
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Implications of Privacy & Security Research for the Upcoming Battlefield of Things2019In: Journal of Information Warfare, ISSN 1445-3312, Vol. 17, no 4, p. 72-87Article in journal (Refereed)
    Abstract [en]

    This article presents the results of a trend-scouting study on the applicability of contemporary information privacy and information security research in future defence scenarios in a 25-year-horizon. The authors sketch the expected digital warfare and defence environment as a‘Battlefield of Things’ in which connected objects, connected soldiers, and automated and autonomous sensing and acting systems are core elements. Based on this scenario, the authors discuss current research in information security and information privacy and their relevance and applicability for the future scenario.

  • 271.
    Fritsch, Lothar
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Momen, Nurul
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Derived Partial Identities Generated from App Permissions2017In: Open Identity Summit 2017: Proceedings / [ed] Lothar Fritsch, Heiko Roßnagel, Detlef Hühnlein, Bonn: Gesellschaft für Informatik, 2017, p. 117-130Conference paper (Refereed)
    Abstract [en]

    This article presents a model of partial identities derived from app permissions that is based on Pfitzmann and Hansen’s terminology for privacy [PH10]. The article first shows how app permissions accommodate the accumulation of identity attributes for partial digital identities by building a model for identity attribute retrieval through permissions. Then, it presents an experimental survey of partial identity access for selected app groups. By applying the identity attribute retrieval model on the permission access log from the experiment, we show how apps’ permission usage is providing to identity profiling.

  • 272.
    Fritsch, Lothar
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Roßnagel, HeikoFraunhofer IAO, Fraunhofer Gesellschaft, Stuttgart.Hühnlein, DetlefECSEC GmbH.
    Open Identity Summit 2017: Proceedings2017Conference proceedings (editor) (Refereed)
  • 273.
    Fritsch, Lothar
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Tjostheim, Ingvar
    Nork Regnesentral.
    Kitkowska, Agnieszka
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    I’m Not That Old Yet! The Elderly and Us in HCI and Assistive Technology2018In: Proceedings of the Mobile Privacy and Security for an Ageing Population workshop at the 20th International Conference on Human-Computer Interaction with Mobile Devices and Services (MobileHCI) 2018, Barcelona: University of Bath; Cranfield university; Northumbria university, Newcastle; University of Portsmouth , 2018Conference paper (Other academic)
    Abstract [en]

    Recent HCI research in information security and privacy focuses on the Elderly. It aims at the provision of inclu-sive, Elderly-friendly interfaces for security and data protection features. Much attention is put on care situa-tions where the image of the Elderly is that of sick or disabled persons not mastering contemporary infor-mation technology. That population is however a frac-tion of the group called the Elderly. In this position pa-per, we argue that the Elderly are a very diverse popu-lation. We discuss issues rising from researchers and software architects’ misconception of the Elderly as technology-illiterate and unable. We suggest a more nuanced approach that includes changing personal abil-ities over the course of life.

  • 274.
    Garcia, Johan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    A clustering-based analysis of DPI-labeled video flow characteristics in cellular networks2017In: Proceedings of the IM 2017 - 2017 IFIP/IEEE International Symposium on Integrated Network Management, New York: IEEE, 2017, p. 1-4Conference paper (Refereed)
    Abstract [en]

    Using a specially instrumented deep packet inspection (DPI) appliance placed inside the core network of a commercial cellular operator we collect data from almost four million flows produced by a `heavy-hitter' subset of the customer base. The data contains per packet information for the first 100 packets in each flow, along with the classification done by the DPI engine. The data is used with unsupervised learning to obtain clusters of typical video flow behaviors, with the intent to quantify the number of such clusters and examine their characteristics. Among the flows identified as belonging to video applications by the DPI engine, a subset are actually video application signaling flows or other flows not carrying actual transfers of video data. Given that DPI-labeled data can be used to train supervised machine learning models to identify flows carrying video transfers in encrypted traffic, the potential presence and structure of such `noise' flows in the ground truth is important to examine. In this study K-means and DBSCAN is used to cluster the flows marked by the DPI engine as being from a video application. The clustering techniques identify a set of 4 to 6 clusters with archetypal flow behaviors, and a subset of these clusters are found to represent flows that are not actually transferring video data.

  • 275.
    Garcia, Johan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    A Fragment Hashing Approach for Scalable and Cloud-Aware Network File Detection2018In: Proceedings of NTMS 2018 Conference and Workshop, New York: IEEE, 2018, p. 1-5Conference paper (Refereed)
    Abstract [en]

    Monitoring networks for the presence of some particular set of files can, for example, be important in order to avoid exfiltration of sensitive data, or combat the spread of Child Sexual Abuse (CSA) material. This work presents a scalable system for large-scale file detection in high-speed networks. A multi-level approach using packet sampling with rolling and block hashing is introduced. We show that such approach together with a well tuned implementation can perform detection of a large number of files on the network at 10 Gbps using standard hardware. The use of packet sampling enables easy distribution of the monitoring processing functionality, and allows for flexible scaling in a cloud environment. Performance experiments on the most run-time critical hashing parts shows a single-thread performance consistent with 10Gbps line rate monitoring. The file detectability is examined for three data sets over a range of packet sampling rates. A conservative sampling rate of 0.1 is demonstrated to perform well for all tested data sets. It is also shown that knowledge of the file size distribution can be exploited to allow lower sampling rates to be configured for two of the data sets, which in turn results in lower resource usage.

  • 276.
    Garcia, Johan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    An Evaluation of Side-Information Assisted Forensic Hash Matching2014In: Computer Software and Applications Conference Workshops (COMPSACW), 2014 IEEE 38th International) / [ed] Chang, CK; Gao, Y; Hurson, A; Matskin, M; McMillin, B; Okabe, Y; Seceleanu, C; Yoshida, K, IEEE, 2014, p. 331-336Conference paper (Refereed)
    Abstract [en]

    Investigations involving digital forensics typically include file hash matching procedures at one or more steps in the examination. File hash matching is typically done by computing a complete file hash value for each file on a storage device and comparing that to a pre-computed hash list. This work examines how various improvements to the basic technique impact the time required to perform hash matching. Specifically, side-information assisted approaches are evaluated in this work. By utilizing side-information such as file sizes and pre-hashes in addition to the traditional hash values, we find that it is possible to considerably decrease the amount of time required to perform file hash matching. A simulation model is used to evaluate the potential time saving over a range of storage devices and using five different empirically derived file size distribution datasets totaling 36 million file sizes. The results indicate that side-information assisted hashing provides a considerable reduction of the time required, ranging between 5% and 99%, with the majority of cases providing reductions with more than 50%.

  • 277.
    Garcia, Johan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Computer Assisted Reasoning as a Support for Knowledge Management2014In: ECKM 2014 - Proceedings og the 15th European Conference on Knowledge Management: Polytechnic Institute of Santarem Portugal 4-5 September 2014 / [ed] Vivas, C. & Sequeira, P., Academic Conferences Limited, 2014, Vol. 3, p. 377-385Conference paper (Refereed)
  • 278.
    Garcia, Johan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Duplications and Misattributions of File Fragment Hashes in Image and Compressed Files2018In: Proceedings of NTMS 2018 Conference and Workshop, New York: IEEE, 2018, p. 1-5Conference paper (Refereed)
    Abstract [en]

    Hashing is used in a wide variety of security contexts. Hashes of parts of files, fragment hashes, can be used to detect remains of deleted files in cluster slack, to detect illicit files being sent over a network, to perform approximate file matching, or to quickly scan large storage devices using sector sampling. In this work we examine the fragment hash uniqueness and hash duplication characteristics of five different data sets with a focus on JPEG images and compressed file archives. We consider both block and rolling hashes and evaluate sizes of the hashed fragments ranging from 16 to 4096 bytes. During an initial hash generation phase hash metadata is created for each data set, which in total becomes several several billion hashes. During the scan phase each other data set is scanned and hashes checked for potential matches in the hash metadata. Three aspects of fragment hashes are examined: 1) the rate of duplicate hashes within each data set, 2) the rate of hash misattribution where a fragment hash from the scanned data set matches a fragment in the hash metadata although the actual file is not present in the scan set, 3) to what extent it is possible to detect fragments from files in a hashed set when those files have been compressed and embedded in a zip archive. The results obtained are useful as input to dimensioning and evaluation procedures for several application areas of fragment hashing.

  • 279.
    Garcia, Johan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Examining the Performance for Forensic Detection of Rare Videos Under Time Constraints2015In: SECRYPT 2015: Proceedings of the 12th International Conference on Security and Cryptography / [ed] Mohammad S. Obaidat, Pascal Lorenz, Pierangela Samarati, SciTePress, 2015, p. 419-426Conference paper (Refereed)
  • 280.
    Garcia, Johan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Quantifying the Benefits of File Size Information for Forensic Hash Matching2012In: Proceedings of the International Conference on Security and Cryptography (SECRYPT 2012) / [ed] Pierangela Samarati, Wenjing Lou, Jianying Zhou, Rome: INSTICC Press, 2012Conference paper (Refereed)
  • 281.
    Garcia, Johan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    The GATM Computer Assisted Reasoning Framework in a Security Policy Reasoning Context2014In: Proceedings of COGNITIVE 2014, The Sixth International Conference on Advanced Cognitive Technologies and Applications, International Academy, Research and Industry Association (IARIA), 2014, p. 215-219Conference paper (Refereed)
    Abstract [en]

    Humans are often faced with the need to make decisions regarding complex issues where multiple interests need to be balanced, and where there are a number of complex arguments weighing in opposite directions. The ability of humans to understand and internalize the underlying argumentation structure resulting from reasoning about complex issues is limited by the human cognitive ability. The cognitive limit can manifest itself both in relation to an inappropriate level and amount of detail in the presentation of information, as well as in the structuring of the information and the representation of the interrelationships between constituting arguments. The GATM model provides a structured way to represent reasoning, and can be useful both in the decision-making process as well as when communicating a decision. In this work a component-based overview of the GATM model is provided in the context of security policy reasoning, where previous work has shown that decision-making transparency and improved understanding of the reasoning behind a security policy may lead to a beneficial impact on policy compliance.

  • 282.
    Garcia, Johan
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Alfredsson, Stefan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Brunstrom, Anna
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Delay metrics and delay characteristics: A study of four Swedish HSDPA+ and LTE networks2015In: 2015 European Conference on Networks and Communications (EuCNC), IEEE, 2015, p. 234-238Conference paper (Refereed)
    Abstract [en]

    Network delays and user perceived latencies are of major importance in many applications in cellular networks. Delays can be measured with multiple approaches and at different protocol layers. This work involves a detailed examination of several delay metrics from a network, transport, and application perspective. The study explores base delay as well as latency under load, capturing also the effect of buffering. The examination is based on a comprehensive active measurement campaign performed in the networks of four Swedish operators. The results show that the delay captured by different metrics can vary significantly, with delay captured from the TCP three-way-handshake and adaptive ping measurements giving the most consistent results for base network delay in our measurements. As expected, when background traffic is introduced measured delay increases by an order of magnitude due to buffering in the network, highlighting the importance of also capturing latency under load when describing network performance. Finally, using an analytic model of flow completion time, we show that well-selected network measurements can provide a good prediction of higher layer delay performance.

  • 283.
    Garcia, Johan
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Alfredsson, Stefan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Brunström, Anna
    Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science. Karlstad University, Faculty of Economic Sciences, Communication and IT, Centre for HumanIT.
    A Measurement Based Study of TCP Protocol Efficiency in Cellular Networks2014In: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), 2014 12th International Symposium on, IEEE, 2014, p. 131-136Conference paper (Refereed)
    Abstract [en]

    This paper examines the efficiency of resource utilization with respect to short-lived TCP flows in various cellular networks. The examination is done from the vantage point of an end-user who would like to use as much as possible of the cellular transmission resources that are available at any given time, thus minimizing the delays associated with communication. Based on a comprehensive measurement campaign we first derive network characteristics with regards to base RTT, RTT under load, and average throughput. A protocol efficiency metric is introduced to capture how efficiently short TCP flows are in fact able to use the instantaneously available transmission resources in a cellular network. The measurements show that short TCP connections have low efficiency in 3. SG (HSPA+) and 4G (LTE) mobile broadband networks, and that the improved latency and throughput characteristics of 4G in relation to 3. SG nevertheless results in lower short-flow efficiency for 4G.

  • 284.
    Garcia, Johan
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Alfredsson, Stefan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Brunström, Anna
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Estimating data transfer capacity for intermittent connectivity: A transport aware model2016In: 2016 IEEE 27th Annual International Symposium On Personal, Indoor, And Mobile Radio Communications (PIMRC), New York: IEEE, 2016, p. 1-6Conference paper (Refereed)
    Abstract [en]

    Communication performed with mobile devices will experience varying levels of connectivity as the communication device moves in and out of coverage. A subset of mobile communication devices operate under conditions where the connectivity is characterized by relatively short contact periods occurring intermittently. In this paper we propose a model to predict the amount of data that can be transferred during such short contact periods. The model includes aspects of the transport layer slow-start behavior and is validated using data from a long-running measurement campaign in the networks of four Swedish cellular networks. Further validation of the modeling assumptions is performed by employing a numerical optimization technique based on non-linear least squares regression using the iterative Levenberg-Marquardt approach. The model is then used to explore the relevant parameter space.

  • 285.
    Garcia, Johan
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Alfredsson, Stefan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Brunström, Anna
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Examining cellular access systems on trains: Measurements and change detection2017In: Proceedings of the 1st Network Traffic Measurement and Analysis Conference, New York: IEEE, 2017, p. 1-6Conference paper (Refereed)
    Abstract [en]

    Abstract:Access to reliable high-quality communication services on trains is important for today's mobile users. Train-mounted aggregation routers that provide WiFi access to train passengers and bundle external communication over multiple cellular modems/links is an efficient way of providing such services. Still, the characteristics of such systems have received limited attention in the literature. In this paper we examine the communication characteristics of such systems based on a large data set gathered over six months from an operational Swedish railway system. We characterize the conditions in terms of usage load, train velocity profiles, and observed throughput and delay as well as the relation between these parameters. Furthermore, we examine the data from an anomaly detection perspective. Based on a changepoint detection method, we examine how the collected metrics varies over the six months. Being able to detect shifts in the metrics over time can help detect anomalous changes in the hardware or environment, and also further helps explain the factors affecting the observed behaviors.

  • 286.
    Garcia, Johan
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Alfredsson, Stefan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Brunström, Anna
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Examining TCP Short Flow Performance in Cellular Networks Through Active and Passive Measurements2015In: AllThingsCellular '15 Proceedings of the 5th Workshop on All Things Cellular: Operations, Applications and Challenges / [ed] David Choffnes and Kobus Van der Merwe, Association for Computing Machinery (ACM), 2015, p. 7-12Conference paper (Refereed)
    Abstract [en]

    In this study we examine the conditions in a current cellular network by examining data passively collected in the core of a cellular operator during a 24-hour period. More than 2 billion traffic measurement data points from over 500,000 cellular users are analyzed. The analysis characterizes the Time-of-Day (ToD) variations for traffic intensity and session length and serves as a complement to the active measurements also performed. A comprehensive active measurement campaign was completed in the HSDPA+ and LTE networks of the four major Swedish operators. We collect around 50,000 data points from stationary cellular modems and analyze the ToD variation pattern for underlying network layer metrics such as delay and throughput. In conjunction with the time-varying session size distribution obtained from the passive measurements, we then analyze the ToD impact on TCP flows of varying sizes. The ToD effects are examined using time series analysis with Lomb-Scargle periodograms and differential Bayesian Information Criterion to allow comparison of the relative impact of the network ToD effects. The results show that ToD effects are predominantly impacting longer-running flows, and although short flows are also impacted they are mostly constrained by other issues such as protocol efficiency.

  • 287.
    Garcia, Johan
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Alfredsson, Stefan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Brunström, Anna
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Beckman, Claes
    Center for Wireless Systems, KTH.
    Train Velocity and Data Throughput: A Large Scale LTE Cellular Measurements Study2017In: Proceedings of the 2017 IEEE 86th Vehicular Technology Conference (VTC Fall), New York: IEEE, 2017, p. 1-6Conference paper (Refereed)
    Abstract [en]

    Train-mounted aggregation routers that provide WiFi access to train passengers and bundle external communication over multiple cellular modems/links is an efficient way of providing communication services on trains. However, the characteristics of such systems have received limited attention in the literature. In this paper we address this gap by examining the communication characteristics of such systems based on a large data set gathered over six months from an operational Swedish railway system. We focus our examination on the relationship between per link throughput and train velocity. Using Levenberg- Marquardt non-linear regression a noticeable critical point is observed for an RS-SINR of around 12 dB. At this point the impact of increased train velocity on per link throughput changes from being negative to becoming positive. Using a machine learning approach we also explore the relative importance of several observed metrics in relation to per link throughput.

  • 288.
    Garcia, Johan
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Brunström, Anna
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Clustering-based separation of media transfers in DPI-classified cellular video and VoIP traffic2018In: 2018 IEEE Wireless Communications and Networking Conference (WCNC), IEEE, 2018Conference paper (Refereed)
    Abstract [en]

    Identifying VoIP and video traffic is often useful in the context of managing a cellular network, and to perform such traffic classification deep packet inspection (DPI) approaches are often used. Commercial DPI classifiers do not necessarily differentiate between, for example, YouTube traffic that arises from browsing inside the YouTube app, and traffic arising from the actual viewing of a YouTube video. Here we apply unsupervised clustering methods on such cellular DPI-labeled VoIP and video traffic to identify the characteristic behavior of the two sub-groups of media-transfer and non media-transfer flows. The analysis is based on a measurement campaign performed inside the core network of a commercial cellular operator, collecting data for more than two billion packets in 40+ million flows. A specially instrumented commercial DPI appliance allows the simultaneous collection of per packet information in addition to the DPI classification output. We show that the majority of flows falls into clusters that are easily identifiable as belonging to one of the traffic sub-groups, and that a surprising majority of DPIlabeled VoIP and video traffic is non-media related.

  • 289.
    Garcia, Johan
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Hurtig, Per
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Deterministic network emulation using KauNetEm2016Conference paper (Other academic)
    Abstract [en]

    This paper presents KauNetEm, an extension to the Linux-based NetEm emulator that provides deterministic network emulation. KauNetEm enables precise and repeatable placement of NetEm emulation effects, a functionality that canconsiderably simplify several aspects of protocol evaluation. KauNetEm can be instructed to drop specific packets, apply a configurable delay or other emulation effects at predefinedpoints in time. The motivation for deterministic emulation, the overall design of KauNetEm, and usage examples are provided

  • 290.
    Garcia, Johan
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Hurtig, Per
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Getting What You Want When You Want It: Deterministic Network Emulation2016Conference paper (Refereed)
    Abstract [en]

    This paper presents KauNetEm, an extension to the Linux-based NetEm emulator that provides deterministic network emulation. KauNetEm enables precise and repeatable placement of NetEm emulation effects, a functionality that can considerably simplify several aspects of protocol evaluation. KauNetEm can be instructed to drop specific packets, apply a configurable delay or other emulation effects at predefined points in time. The motivation for deterministic emulation, the overall design of KauNetEm, and usage examples are provided.

  • 291.
    Garcia, Johan
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Korhonen, Topi
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Efficient Distribution-Derived Features for High-Speed Encrypted Flow Classification2018In: NetAI'18 Proceedings of the 2018 Workshop on Network Meets AI & ML, New York: Association for Computing Machinery (ACM), 2018, p. 21-27Conference paper (Refereed)
    Abstract [en]

    Flow classification is an important tool to enable efficient network resource usage, support traffic engineering, and aid QoS mechanisms. As traffic is increasingly becoming encrypted by default, flow classification is turning towards the use of machine learning methods employing features that are also available for encrypted traffic. In this work we evaluate flow features that capture the distributional properties of in-flow per-packet metrics such as packet size and inter-arrival time. The characteristics of such distributions are often captured with general statistical measures such as standard deviation, variance, etc. We instead propose a Kolmogorov-Smirnov discretization (KSD) algorithm to perform histogram bin construction based on the distributional properties observed in the data. This allows for a richer, histogram based, representation which also requires less resources for feature computation than higher order statistical moments. A comprehensive evaluation using synthetic data from Gaussian and Beta mixtures show that the KSD approach provides Jensen-Shannon distance results surpassing those of uniform binning and probabilistic binning. An empirical evaluation using live traffic traces from a cellular network further shows that when coupled with a random forest classifier the KSD-constructed features improve classification performance compared to general statistical features based on higher order moments, or alternative bin placement approaches.

  • 292.
    Garcia, Johan
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Korhonen, Topi
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    On Runtime and Classification Performance of the Discretize-Optimize (DISCO) Classification Approach2018In: Performance Evaluation Review, ISSN 0163-5999, E-ISSN 1557-9484, Vol. 46, no 3, p. 167-170Article in journal (Refereed)
    Abstract [en]

    Using machine learning in high-speed networks for tasks such as flow classification typically requires either very resource efficient classification approaches, large amounts of computational resources, or specialized hardware. Here we provide a sketch of the discretize-optimize (DISCO) approach which can construct an extremely efficient classifier for low dimensional problems by combining feature selection, efficient discretization, novel bin placement, and lookup. As feature selection and discretization parameters are crucial, appropriate combinatorial optimization is an important aspect of the approach. A performance evaluation is performed for a YouTube classification task using a cellular traffic data set. The initial evaluation results show that the DISCO approach can move the Pareto boundary in the classification performance versus runtime trade-off by up to an order of magnitude compared to runtime optimized random forest and decision tree classifiers.

  • 293.
    Garcia, Johan
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Korhonen, Topi
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Andersson, Ricky
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Västlund, Filip
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Towards Video Flow Classification at a Million Encrypted Flows Per Second2018In: Proceedings of 32nd International Conference on Advanced Information Networking and Applications (AINA) / [ed] Leonard Barolli, Makoto Takizawa, Tomoya Enokido, Marek R. Ogiela, Lidia Ogiela & Nadeem Javaid, Krakow: IEEE, 2018Conference paper (Refereed)
    Abstract [en]

    As end-to-end encryption on the Internet is becoming more prevalent, techniques such as deep packet inspection (DPI) can no longer be expected to be able to classify traffic. In many cellular networks a large fraction of all traffic is video traffic, and being able to divide flows in the network into video and non-video can provide considerable traffic engineering benefits. In this study we examine machine learning based flow classification using features that are available also for encrypted flows. Using a data set of several several billion packets from a live cellular network we examine the obtainable classification performance for two different ensemble-based classifiers. Further, we contrast the classification performance of a statistical-based feature set with a less computationally demanding alternate feature set. To also examine the runtime aspects of the problem, we export the trained models and use a tailor-made C implementation to evaluate the runtime performance. The results quantify the trade-off between classification and runtime performance, and show that up to 1 million classifications per second can be achieved for a single core. Considering that only the subset of flows reaching some minimum flow length will need to be classified, the results are promising with regards to deployment also in scenarios with very high flow arrival rates.

  • 294.
    Garcia, Johan
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Sundberg, Simon
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Brunström, Anna
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Beckman, Claes
    Icomera AB, Gothenburg, Sweden.
    Interactions Between Train Velocity andCellular Link Throughput - An Extensive Study2019In: 2019 IEEE 30th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), 2019Conference paper (Refereed)
    Abstract [en]

    Providing reliable internet connectivity to train passengers can be handled with onboard aggregation routers that use multiple external antennas to simultaneously convey user traffic over multiple links. This work studies the operational characteristics of a large-scale deployment of such a system. The examination focuses on how train velocity is associated with achieved link throughput, and how various interaction effects influence the relationship. A large data set collected over three years is analyzed, indicating that there is a systematic association between train velocity and link throughput that varies over the radio conditions and which is also linked to differences between operators.

  • 295.
    Gashkov, S. B.
    et al.
    Moscow State University, Russia.
    Gashkov, Igor
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Fast Algorithm of Square Rooting in Some Finite Fields of Odd Characteristic2018In: Moscow University Mathematics Bulletin, ISSN 0027-1322, Vol. 73, no 5, p. 176-181Article in journal (Refereed)
    Abstract [en]

    It was proved that the complexity of square root computation in the Galois field GF(3 (s) ), s = 2 (k) r, is equal to O(M(2 (k) )M(r)k + M(r) log(2) r) + 2 (k) kr (1+o(1)), where M (n) is the complexity of multiplication of polynomials of degree n over fields of characteristics 3. The complexity of multiplication and division in the field GF(3 (s) ) is equal to O(M(2 (k) )M(r)) and O(M(2 (k) )M(r)) + r (1+o(1)), respectively. If the basis in the field GF(3 (r) ) is determined by an irreducible binomial over GF(3) or is an optimal normal basis, then the summands 2 (k) kr (1+o(1)) and r (1+o(1)) can be omitted. For M(n) one may take n log(2) n psi(n) where psi(n) grows slower than any iteration of the logarithm. If k grow and r is fixed, than all the estimates presented here have the form O (r) (M (s) log (2) s) = s (log (2) s)(2) psi(s).

  • 296.
    Gehring, Stefan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Technical Options for the Implementation of the Principle of ”Right to be Forgotten”2013Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    The Right-to-be-Forgotten is a part of the new proposal of the Data Protection Directive of the European Union. It was created to react to the challenges in protecting a person’s right of privacy which were caused by the ongoing evolution of technology in our digital age. In the course of the evaluation of the new proposal we created a list of requirements to find technical implementations which could accomplish them. Based on these requirements we established the current state of the art. The EnCoRe project as well as the Vanish project turned out to be the most promising two candidates. EnCoRe on the one hand describes a whole framework which has to be implemented to function. Vanish on the other hand uses existing infrastructures and cryptography to meet its goals. We compared the systems to the requirements of the Right-to-be-Forgotten with the result that both fulfil those to a big extend. Nevertheless there is still much development needed to be able to implement a full-fledged Right-to-be-Forgotten. Therefore future focus should be put on the combination of the different approaches, their further enhancement, securing the environment and improving remote enforcement.

  • 297.
    Geiger, Matthias
    et al.
    University of Bamberg.
    Harrer, Simon
    University of Bamberg.
    Lenhard, Jörg
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Wirtz, Guido
    University of Bamberg.
    BPMN2.0: The state of support and implementation2018In: Future generations computer systems, ISSN 0167-739X, E-ISSN 1872-7115, Vol. 80, p. 250-262Article in journal (Refereed)
  • 298.
    Gerber, Paul
    et al.
    Faculty of Human Sciences, Technische Universität Darmstadt, Germany.
    Volkamer, Melanie
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Renaud, Karen
    College of Science and Engineering, School of Computing Science, Human-Centred Security and Privacy Lead, University of Glasgow, United Kingdom.
    The simpler, the better? Presenting the COPING Android permission-granting interface for better privacy-related decisions2017In: Journal of Information Security and Applications, ISSN 2214-2134, E-ISSN 2214-2126, Vol. 34, no 1, p. 8-26Article in journal (Refereed)
    Abstract [en]

    One of the great innovations of the modern world is the Smartphone app. The sheer multitude of available apps attests to their popularity and general ability to satisfy our wants and needs. The flip side of the functionality these apps offer is their potential for privacy invasion. Apps can, if granted permission, gather a vast amount of very personal and sensitive information. App developers might exploit the combination of human propensities and the design of the Android permission-granting interface to gain permission to access more information than they really need. This compromises personal privacy. The fact that the Android is the globally dominant phone means widespread privacy invasion is a real concern.

    We, and other researchers, have proposed alternatives to the Android permission-granting interface. The aim of these alternatives is to highlight privacy considerations more effectively during app installation: to ensure that privacy becomes part of the decision-making process. We report here on a study with 344 participants that compared the impact of a number of permission-granting interface proposals, including our own (called the COPING interface — COmprehensive PermIssioN Granting) and two Android interfaces. To conduct the comparison we carried out an online study with a mixed-model design.

    Our main finding is that the focus in these interfaces ought to be on improving the quality of the provided information rather than merely simplifying the interface. The intuitive approach is to reduce and simplify information, but we discovered that this actually impairs the quality of the decision. Our recommendation is that further investigation is required in order to find the “sweet spot” where understandability and comprehensiveness are maximised

  • 299.
    Ghazzai, Hakim
    et al.
    Stevens Institute of Technology, Hoboken, NJ, USA.
    Ghorbel, Madi Ben
    The University of British Columbia, Okanagan Campus, Kelowna, BC, Canada.
    Kassler, Andreas
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Hossain, Md Jahangir
    The University of British Columbia, Okanagan Campus, Kelowna, BC, Canada.
    Trajectory Optimization for Cooperative Dual-Band UAV Swarms2018In: 2018 IEEE Global Communications Conference (GLOBECOM 2018), IEEE, 2018Conference paper (Refereed)
    Abstract [en]

    Unmanned aerial vehicles (UAVs) have gained a lot of popularity in diverse wireless communication fields. They can act as high- altitude flying relays to support communications between ground nodes due to their ability to provide line-of- sight links. With the flourishing Internet of Things, several types of new applications are emerging. In this paper, we focus on bandwidth hungry and delay-tolerant applications where multiple pairs of transceivers require the support of UAVs to complete their transmissions. To do so, the UAVs have the possibility to employ two different bands namely the typical microwave and the high-rate millimeter wave bands. In this paper, we develop a generic framework to assign UAVs to supported transceivers and optimize their trajectories such that a weighted function of the total service time is minimized. Taking into account both the communication time needed to relay the message and the flying time of the UAVs, a mixed non-linear programming problem aiming at finding the stops at which the UAVs hover to forward the data to the receivers is formulated. An iterative approach is then developed to solve the problem. First, a mixed linear programming problem is optimally solved to determine the path of each available UAV. Then, a hierarchical iterative search is executed to enhance the UAV stops' locations and reduce the service time. The behavior of the UAVs and the benefits of the proposed framework are showcased for selected scenarios.

  • 300. Ghiglieri, Marco
    et al.
    Volkamer, Melanie
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013). TU Darmstadt.
    Renaud, Karen
    Exploring Consumers' Attitudes of Smart TV Related Privacy Risks2017In: Human Aspects of Information Security, Privacy and Trust: 5th International Conference, HAS 2017, Held as Part of HCI International 2017, Vancouver, BC, Canada, July 9-14, 2017, Proceedings, Cham: Springer, 2017, Vol. 10292, p. 656-674Conference paper (Refereed)
3456789 251 - 300 of 884
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf