@misc{SianiparWillemsMeinel2019, author = {Sianipar, Johannes Harungguan and Willems, Christian and Meinel, Christoph}, title = {Virtual machine integrity verification in Crowd-Resourcing Virtual Laboratory}, series = {2018 IEEE 11th Conference on Service-Oriented Computing and Applications (SOCA)}, journal = {2018 IEEE 11th Conference on Service-Oriented Computing and Applications (SOCA)}, publisher = {IEEE}, address = {New York}, isbn = {978-1-5386-9133-5}, issn = {2163-2871}, doi = {10.1109/SOCA.2018.00032}, pages = {169 -- 176}, year = {2019}, abstract = {In cloud computing, users are able to use their own operating system (OS) image to run a virtual machine (VM) on a remote host. The virtual machine OS is started by the user using some interfaces provided by a cloud provider in public or private cloud. In peer to peer cloud, the VM is started by the host admin. After the VM is running, the user could get a remote access to the VM to install, configure, and run services. For the security reasons, the user needs to verify the integrity of the running VM, because a malicious host admin could modify the image or even replace the image with a similar image, to be able to get sensitive data from the VM. We propose an approach to verify the integrity of a running VM on a remote host, without using any specific hardware such as Trusted Platform Module (TPM). Our approach is implemented on a Linux platform where the kernel files (vmlinuz and initrd) could be replaced with new files, while the VM is running. kexec is used to reboot the VM with the new kernel files. The new kernel has secret codes that will be used to verify whether the VM was started using the new kernel files. The new kernel is used to further measuring the integrity of the running VM.}, language = {en} } @misc{SianiparSukmanaMeinel2019, author = {Sianipar, Johannes Harungguan and Sukmana, Muhammad Ihsan Haikal and Meinel, Christoph}, title = {Moving sensitive data against live memory dumping, spectre and meltdown attacks}, series = {26th International Conference on Systems Engineering (ICSEng)}, journal = {26th International Conference on Systems Engineering (ICSEng)}, publisher = {IEEE}, address = {New York}, isbn = {978-1-5386-7834-3}, pages = {8}, year = {2019}, abstract = {The emergence of cloud computing allows users to easily host their Virtual Machines with no up-front investment and the guarantee of always available anytime anywhere. But with the Virtual Machine (VM) is hosted outside of user's premise, the user loses the physical control of the VM as it could be running on untrusted host machines in the cloud. Malicious host administrator could launch live memory dumping, Spectre, or Meltdown attacks in order to extract sensitive information from the VM's memory, e.g. passwords or cryptographic keys of applications running in the VM. In this paper, inspired by the moving target defense (MTD) scheme, we propose a novel approach to increase the security of application's sensitive data in the VM by continuously moving the sensitive data among several memory allocations (blocks) in Random Access Memory (RAM). A movement function is added into the application source code in order for the function to be running concurrently with the application's main function. Our approach could reduce the possibility of VM's sensitive data in the memory to be leaked into memory dump file by 2 5\% and secure the sensitive data from Spectre and Meltdown attacks. Our approach's overhead depends on the number and the size of the sensitive data.}, language = {en} } @misc{ShakiFischer2019, author = {Shaki, Samuel and Fischer, Martin H.}, title = {Commentary on: E. H. Toomarian ; E. M. Hubbard, On the genesis of spatial-numerical associations: Evolutionary and cultural factors co-construct the mental number line. - (Neuroscience \& Biobehavioral Reviews. - vol 95, 2018, pg 189 - 190)}, series = {Neuroscience \& biobehavioral reviews : official journal of the International Behavioral Neuroscience Society}, volume = {98}, journal = {Neuroscience \& biobehavioral reviews : official journal of the International Behavioral Neuroscience Society}, publisher = {Elsevier}, address = {Oxford}, issn = {0149-7634}, doi = {10.1016/j.neubiorev.2018.12.018}, pages = {335 -- 335}, year = {2019}, language = {en} } @misc{SeidelKrentzMeinel2019, author = {Seidel, Felix and Krentz, Konrad-Felix and Meinel, Christoph}, title = {Deep En-Route Filtering of Constrained Application Protocol (CoAP) Messages on 6LoWPAN Border Routers}, series = {2019 IEEE 5th World Forum on Internet of Things (WF-IoT)}, journal = {2019 IEEE 5th World Forum on Internet of Things (WF-IoT)}, publisher = {Institute of Electrical and Electronics Engineers}, address = {New York}, isbn = {978-1-5386-4980-0}, doi = {10.1109/WF-IoT.2019.8767262}, pages = {201 -- 206}, year = {2019}, abstract = {Devices on the Internet of Things (IoT) are usually battery-powered and have limited resources. Hence, energy-efficient and lightweight protocols were designed for IoT devices, such as the popular Constrained Application Protocol (CoAP). Yet, CoAP itself does not include any defenses against denial-of-sleep attacks, which are attacks that aim at depriving victim devices of entering low-power sleep modes. For example, a denial-of-sleep attack against an IoT device that runs a CoAP server is to send plenty of CoAP messages to it, thereby forcing the IoT device to expend energy for receiving and processing these CoAP messages. All current security solutions for CoAP, namely Datagram Transport Layer Security (DTLS), IPsec, and OSCORE, fail to prevent such attacks. To fill this gap, Seitz et al. proposed a method for filtering out inauthentic and replayed CoAP messages "en-route" on 6LoWPAN border routers. In this paper, we expand on Seitz et al.'s proposal in two ways. First, we revise Seitz et al.'s software architecture so that 6LoWPAN border routers can not only check the authenticity and freshness of CoAP messages, but can also perform a wide range of further checks. Second, we propose a couple of such further checks, which, as compared to Seitz et al.'s original checks, more reliably protect IoT devices that run CoAP servers from remote denial-of-sleep attacks, as well as from remote exploits. We prototyped our solution and successfully tested its compatibility with Contiki-NG's CoAP implementation.}, language = {en} } @misc{SchuettRothkegelTrukenbrodetal.2019, author = {Sch{\"u}tt, Heiko Herbert and Rothkegel, Lars Oliver Martin and Trukenbrod, Hans Arne and Engbert, Ralf and Wichmann, Felix A.}, title = {Predicting fixation densities over time from early visual processing}, series = {Perception}, volume = {48}, journal = {Perception}, publisher = {Sage Publ.}, address = {London}, issn = {0301-0066}, pages = {64 -- 65}, year = {2019}, abstract = {Bottom-up saliency is often cited as a factor driving the choice of fixation locations of human observers, based on the (partial) success of saliency models to predict fixation densities in free viewing. However, these observations are only weak evidence for a causal role of bottom-up saliency in natural viewing behaviour. To test bottom-up saliency more directly, we analyse the performance of a number of saliency models---including our own saliency model based on our recently published model of early visual processing (Sch{\"u}tt \& Wichmann, 2017, JoV)---as well as the theoretical limits for predictions over time. On free viewing data our model performs better than classical bottom-up saliency models, but worse than the current deep learning based saliency models incorporating higher-level information like knowledge about objects. However, on search data all saliency models perform worse than the optimal image independent prediction. We observe that the fixation density in free viewing is not stationary over time, but changes over the course of a trial. It starts with a pronounced central fixation bias on the first chosen fixation, which is nonetheless influenced by image content. Starting with the 2nd to 3rd fixation, the fixation density is already well predicted by later densities, but more concentrated. From there the fixation distribution broadens until it reaches a stationary distribution around the 10th fixation. Taken together these observations argue against bottom-up saliency as a mechanistic explanation for eye movement control after the initial orienting reaction in the first one to two saccades, although we confirm the predictive value of early visual representations for fixation locations. The fixation distribution is, first, not well described by any stationary density, second, is predicted better when including object information and, third, is badly predicted by any saliency model in a search task.}, language = {en} } @misc{SchwetlickTrukenbrodEngbert2019, author = {Schwetlick, Lisa and Trukenbrod, Hans Arne and Engbert, Ralf}, title = {The Influence of Visual Long Term Memory on Eye Movements During Scene Viewing}, series = {Perception}, volume = {48}, journal = {Perception}, number = {S1}, publisher = {Sage Publ.}, address = {London}, issn = {0301-0066}, pages = {138 -- 138}, year = {2019}, language = {en} } @misc{Schorsch2019, author = {Schorsch, Jonathan}, title = {Olive Oil, Anointing, Ecstasy, and Ecology}, series = {Ritual Dynamics in Jewish and Christian Contexts : Between Bible and Liturgy}, volume = {34}, journal = {Ritual Dynamics in Jewish and Christian Contexts : Between Bible and Liturgy}, publisher = {Brill}, address = {Leiden}, isbn = {978-90-04-40595-0}, issn = {1388-2074}, doi = {10.1163/9789004405950_012}, pages = {215 -- 236}, year = {2019}, language = {en} } @misc{SchlosserKossmannBoissier2019, author = {Schlosser, Rainer and Kossmann, Jan and Boissier, Martin}, title = {Efficient Scalable Multi-Attribute Index Selection Using Recursive Strategies}, series = {2019 IEEE 35th International Conference on Data Engineering (ICDE)}, journal = {2019 IEEE 35th International Conference on Data Engineering (ICDE)}, publisher = {IEEE}, address = {New York}, isbn = {978-1-5386-7474-1}, issn = {1084-4627}, doi = {10.1109/ICDE.2019.00113}, pages = {1238 -- 1249}, year = {2019}, abstract = {An efficient selection of indexes is indispensable for database performance. For large problem instances with hundreds of tables, existing approaches are not suitable: They either exhibit prohibitive runtimes or yield far from optimal index configurations by strongly limiting the set of index candidates or not handling index interaction explicitly. We introduce a novel recursive strategy that does not exclude index candidates in advance and effectively accounts for index interaction. Using large real-world workloads, we demonstrate the applicability of our approach. Further, we evaluate our solution end to end with a commercial database system using a reproducible setup. We show that our solutions are near-optimal for small index selection problems. For larger problems, our strategy outperforms state-of-the-art approaches in both scalability and solution quality.}, language = {en} } @misc{SalzwedelVoellerReibis2019, author = {Salzwedel, Annett and V{\"o}ller, Heinz and Reibis, Rona Katharina}, title = {Vocational reintegration in coronary heart disease patients - the holistic approach of the WHO biopsychosocial concept}, series = {European journal of preventive cardiology : the official ESC journal for primary \& secondary cardiovascular prevention, rehabilitation and sports cardiology}, volume = {26}, journal = {European journal of preventive cardiology : the official ESC journal for primary \& secondary cardiovascular prevention, rehabilitation and sports cardiology}, number = {13}, publisher = {Sage Publ.}, address = {London}, issn = {2047-4873}, doi = {10.1177/2047487319850699}, pages = {1383 -- 1385}, year = {2019}, language = {en} } @misc{RoederVogtWilliam2019, author = {R{\"o}der, Katrin and Vogt-William, Christine}, title = {Shame and shamelessness in Anglophone literature and media}, series = {European journal of English studies : official journal of the European Society for the Study of English (ESSE)}, volume = {23}, journal = {European journal of English studies : official journal of the European Society for the Study of English (ESSE)}, number = {3}, publisher = {Routledge, Taylor \& Francis Group}, address = {Abingdon}, issn = {1382-5577}, doi = {10.1080/13825577.2019.1655242}, pages = {239 -- 248}, year = {2019}, language = {en} }