Search results

Random wireless network scenario generator.

The Learning with Errors problem (LWE) has become a central topic in recent cryptographic research. In this paper, we present a new solving algorithm combining important ideas from previous work on improving the BKW algorithm and ideas from sieving in lattices. The new algorithm is analyzed and demonstrates an improved asymptotic performance. For Regev parameters q = n^2 and noise level \sigma = n

Guo et al. recently presented a reaction attack against the QC-MDPC McEliece cryptosystem. Their attack is based on the observation that when a bit-flipping decoding algorithm is used in the QC-MDPC McEliece, then there exists a dependence between the secret matrix H and the failure probability of the bit-flipping algorithm. This dependence can be exploited to reveal the matrix H which constitutes

Understanding and measuring security of softwarein terms of vulnerability metrics is important when reviewingand deciding between softwares. The large number of disclosedvulnerabilities will continue to expose software intensivesystems and products to attacks, and the choice of thirdparty software will affect stability and reliability of productsincorporating this software. We collect CVE data fro

Advances in software virtualization and network processing lead to increasing network softwarization. Software network elements running on commodity platforms replace or complement hardware components in cloud and mobile network infrastructure. However, such commodity platforms have a large attack surface and often lack granular control and tight integration of the underlying hardware and software

We point out the risks of protecting relational databases via Searchable Symmetric Encryption (SSE) schemes by proposing an inference attack exploiting the structural properties of relational databases. We show that record-injection attacks mounted on relational databases have worse consequences than their file-injection counterparts on un- structured databases. Moreover, we discuss some technique

In recent years, it has been recognized that the seismic wave equation solved with a finite-difference method in time causes a predictable and removable error through the use of so-called time-dispersion transforms. These transforms were thought not to apply to visco-elastic media. However, in this paper we demonstrate that the time-dispersion transforms remain applicable when the visco-elastic wa

Signal apparition is a recent signal processing advance that has numerous applications in seismic data acquisition and processing. In this paper we review the basic principles of signal apparition and discuss applications related to simultaneous source acquisition. We discuss the generalization of the technique to large number of sources and the application in a full 3D configuration enabling larg

In this paper we develop a number of generic techniques and algorithms in spectral analysis of large linear approximations for use in cryptanalysis. We apply the developed tools for cryptanalysis of ZUC-256 and give a distinguishing attack with complexity around 2236 . Although the attack is only 220 times faster than exhaustive key search, the result indicates that ZUC-256 does not provide a sour

In Vehicular Ad hoc NETworks (VANETs) where safety applications rely on broadcast communications, the hidden terminal problem can severely impact the reliability of these applications. Particularly, in forced flow traffic scenarios as the primary case of safety-critical situations, reliability is paramount for inter-vehicle communications to be useful. Not surprising, in these scenarios, the hidde

The article is an introduction to the festival 'Visioner av Nuet' Stockholm, 1966. The article focuses on the historical event, and contextualizes it to both the discussions on art and technology at the time, and to the planned collaborations with the prominent artists from the American group E.A.T. such as Billy Klüver, John Cage, Robert Rauchenberg and Öyvind Fahlström, - collaborations that nev

In this paper we present a system for performing low rank matrix factorization. Low-rank matrix factorization is an essential problem in many areas including computer vision, with applications in e.g. affine structure-from-motion, photometric stereo, and non-rigid structure from motion. We specifically target structured data patterns, with outliers and large amounts of missing data. Using recently

A well-planned waiting area is crucial for automatic milking systems. In an enclosed waiting area, cows of different rank compete for entering the milking station and they are exposed for a variety of social interactions. Such interactions could increase standing time and delay milking, which may result in stress, lameness, impaired welfare and reduced performance. The aim was to monitor the waiti

The paper considers multi-hop wireless mesh networks that serve multicast periodic packet traffic. The packets from each packet stream are generated at the stream's source node and traverse a number of wireless nodes in order to reach their multiple destination nodes. Packet periodicity means that a common repeatable frame of time slots is defined and that the packets to be transmitted arrive at t

Semanticrolelabelinghasbecomeakeymodule for many language processing applications such as question answering, information extraction, sentiment analysis, and machine translation. To build an unrestricted semantic role labeler, the first step is to develop a comprehensive proposition bank. However, creating such a bank is a costly enterprise, which has only been achieved for a handful of languages.

In this paper, we describe a system that jointly extracts entities appearing in images and mentioned in their ac- companying captions. As input, the entity linking pro- gram takes a segmented image together with its cap- tion. It consists of a sequence of processing steps: part- of-speech tagging, dependency parsing, and coreference resolution that enables us to identify the entities as well as po

In this paper I use Kenneth Burke's theory of aesthetic form from Counter-Statement (1931) to analyze how the gourmet chef Mathias Dahlgren creates a gourmet dinner.

In this paper, we describe the conversion of a heart trans- plantation dataset in the RDF format and its application in a survival prediction program. The International Society for Heart & Lung Trans- plantation (ISHLT) maintains a registry of heart transplantations that it gathers from operations performed worldwide. The US United Net- work for Organ Sharing (UNOS) and the Scandinavian Scandi