Search results for "cryptography"
showing 10 items of 657 documents
Gray visiting Motzkins
2002
We present the first Gray code for Motzkin words and their generalizations: k colored Motzkin words and Schroder words. The construction of these Gray codes is based on the observation that a k colored Motzkin word is the shuffle of a Dyck word by a k-ary variation on a trajectory which is a combination. In the final part of the paper we give some algorithmic considerations and other possible applications of the techniques introduced here.
SAUCE: A web application for interactive teaching and learning of parallel programming
2017
Abstract Prevalent hardware trends towards parallel architectures and algorithms create a growing demand for graduate students familiar with the programming of concurrent software. However, learning parallel programming is challenging due to complex communication and memory access patterns as well as the avoidance of common pitfalls such as dead-locks and race conditions. Hence, the learning process has to be supported by adequate software solutions in order to enable future computer scientists and engineers to write robust and efficient code. This paper discusses a selection of well-known parallel algorithms based on C++11 threads, OpenMP, MPI, and CUDA that can be interactively embedded i…
A novel secure aggregation scheme for wireless sensor networks using stateful public key cryptography
2015
International audience; Wireless sensor networks (WSNs) are nowadays considered as an important part of the Internet of Things (IoT). In these networks, data aggregation plays an essential role in energy preservation. However, WSNs are usually deployed in hostile and unattended environments (e.g. military applications) in which the confidentiality and integrity security services are widely desired. Recently, homomorphic encryptions have been applied to conceal sensitive information during aggregation such that algebraic operations are done directly on ciphertexts without decryption. The main benefit is that they offer the end-to-end data confidentiality and they do not require expensive com…
Enabling early sleeping and early data transmission in wake-up radio-enabled IoT networks
2019
Abstract Wireless sensor networks (WSNs) are one of the key enabling technologies for the Internet of things (IoT). In such networks, wake-up radio (WuR) is gaining its popularity thanks to its on-demand transmission feature and overwhelming energy consumption superiority. Despite this advantage, overhearing still occurs when a wake-up receiver decodes the address of a wake-up call (WuC) which is not intended to it, causing a certain amount of extra energy waste in the network. Moreover, long latency may occur due to WuC address decoding since WuCs are transmitted at a very low data rate. In this paper, we propose two schemes, i.e., early sleeping (ES) and early data transmission (EDT), to …
Computational Complexity and Communication: Coordination in Two-Player Games
2002
The main contribution of this paper is the development and application of cryptographic techniques to the design of strategic communication mechanisms. One of the main assumptions in cryptography is the limitation of the computational power available to agents. We introduce the concept of limited computational complexity, and by borrowing results from cryptography, we construct a communication protocol to establish that every correlated equilibrium of a two-person game with rational payoffs can be achieved by means of computationally restricted unmediated communication. This result provides an example in game theory where limitations of computational abilities of players are helpful in solv…
Pragmatic languages with universal grammars
2012
Abstract This paper constructs the equilibrium for a specific code that can be seen as a “universal grammar” in a class of common interest Sender–Receiver games where players communicate through a noisy channel. We propose a Senderʼs signaling strategy which does not depend on either the game payoffs or the initial probability distribution. The Receiverʼs strategy partitions the set of possible sequences into subsets, with a single action assignment to each of them. The Senderʼs signaling strategy is a Nash equilibrium, i.e. when the Receiver responds best to the Senderʼs strategy, the Sender has no incentive to deviate. An example shows that a tie-breaking decoding is crucial for the block…
A Visual Simulation Framework For Simultaneous Multithreading Architectures
2011
The computing systems, and particularly microarchitectures, are in a continuous expansion reaching an unmanageable complexity by the human mind. In order to understand and control this expansion, researchers need to design and implement larger and more complex systems’ simulators. In the current paradigm the simulators play the key role in going further, by translating all complex processing mechanisms in relevant and easy to understand information. This paper aims to make a suggestive description of the concepts and principles implemented into a Simultaneous Multithreading Architecture. We introduce the SMTAHSim framework, an educational tool that simulates in an interactive manner the imp…
Collaborative body sensor networks: Taxonomy and open challenges
2018
International audience; Single Body Sensor Networks (BSNs) have gained a lot of interest during the past few years. However, the need to monitor the activity of many individuals to assess the group status and take action accordingly has created a new research domain called Collaborative Body Sensor Network (CBSN). In such a new field, understanding CBSN's concept and challenges over the roots requires investigation to allow the development of suitable algorithms and protocols. Although there are many research studies in BSN, CBSN is still in its early phases and studies around it are very few. In this paper, we define and taxonomize CBSN, describe its architecture, and discuss its applicati…
Encriptación óptica empleando llaves Weierstrass-Mandelbrot
2013
[EN] This paper presents the generation of encryption keys using the local oscillating properties of the partial sums of Weierstrass-Mandelbrot fractal function. In this way, the security key can be replicated if the parameters used to obtain it are known. Therefore, these parameters can be sent instead of sending the key. This procedure reduces the amount of information to be sent and prevents possible interception of the key. Moreover, the key can not be affected by data loss or pollution. The effectiveness of the Weierstrass-Mandelbrot keys were demonstrated by computer simulation in a 4f optical encryption system and the double random phase encoding technique. These keys allow us to enc…
Single neuron binding properties and the magical number 7
2008
When we observe a scene, we can almost instantly recognize a familiar object or can quickly distinguish among objects differing by apparently minor details. Individual neurons in the medial temporal lobe of humans have been shown to be crucial for the recognition process, and they are selectively activated by different views of known individuals or objects. However, how single neurons could implement such a sparse and explicit code is unknown and almost impossible to investigate experimentally. Hippocampal CA1 pyramidal neurons could be instrumental in this process. Here, in an extensive series of simulations with realistic morphologies and active properties, we demonstrate how n radial (ob…