Related papers: Cryptographic Hardening of d-Sequences
Recently, graph matching algorithms have been successfully applied to the problem of network de-anonymization, in which nodes (users) participating to more than one social network are identified only by means of the structure of their links…
The aim of this paper is to endow the well-known family of hypercubic quantization hashing methods with theoretical guarantees. In hypercubic quantization, applying a suitable (random or learned) rotation after dimensionality reduction has…
Dynamic Source Routing (DSR) is a well known source routing protocol for ad hoc networks. The algorithm depends on the cooperative participation of the nodes that enables route discovery from a source node to a destination node. However, if…
CNNs perform remarkably well when the training and test distributions are i.i.d, but unseen image corruptions can cause a surprisingly large drop in performance. In various real scenarios, unexpected distortions, such as random noise,…
Recently, we have shown the advantages of two-way quantum communications in continuous variable quantum cryptography. Thanks to this new approach, two honest users can achieve a non-trivial security enhancement as long as the Gaussian…
Analysis of the convergence rates of modern convex optimization algorithms can be achived through binary means: analysis of emperical convergence, or analysis of theoretical convergence. These two pathways of capturing information diverge…
True random number generator (TRNG) plays a vital role in a variety of security applications and protocols. The security and privacy of an asset rely on the encryption, which solely depends on the quality of random numbers. Memory chips are…
The increasing sophistication of available quantum networks has seen a corresponding growth in the pursuit of multi-partite cryptographic protocols. Whilst the use of multi-partite entanglement is known to offer an advantage in certain…
We study a distributed consensus-based stochastic gradient descent (SGD) algorithm and show that the rate of convergence involves the spectral properties of two matrices: the standard spectral gap of a weight matrix from the network…
Gatherings of thousands to millions of people frequently occur for an enormous variety of events, and automated counting of these high-density crowds is useful for safety, management, and measuring significance of an event. In this work, we…
We develop cryptographically secure techniques to guarantee unconditional privacy for respondents to polls. Our constructions are efficient and practical, and are shown not to allow cheating respondents to affect the ``tally'' by more than…
When studying networks using random graph models, one is sometimes faced with situations where the notion of adjacency between nodes reflects multiple constraints. Traditional random graph models are insufficient to handle such situations.…
Mean value and cross-covariance function of chaotic binary sequences are evaluated for chaotic maps with specific properties. We also take into account the effect of fixed- and floating-point representations on statistical properties of…
We study the properties of random graphs where for each vertex a {\it neighbourhood} has been previously defined. The probability of an edge joining two vertices depends on whether the vertices are neighbours or not, as happens in Small…
Motivated by cryptographic applications, we investigate two machine learning approaches to modular multiplication: namely circular regression and a sequence-to-sequence transformer model. The limited success of both methods demonstrated in…
The prime numbers look like a randomly chosen sequence of natural numbers, but there is still no strict theory to determine 'Randomness'. In these years, cryptography has developed a battery of statistical tests for randomness. In this…
Mapping network flows provides insight into the organization of networks, but even though many real-networks are bipartite, no method for mapping flows takes advantage of the bipartite structure. What do we miss by discarding this…
A uniform $k$-{\sc dag} generalizes the uniform random recursive tree by picking $k$ parents uniformly at random from the existing nodes. It starts with $k$ ''roots''. Each of the $k$ roots is assigned a bit. These bits are propagated by a…
There is evidence that address matching plays a crucial role in many areas such as express delivery, online shopping and so on. Address has a hierarchical structure, in contrast to unstructured texts, which can contribute valuable…
Guaranteeing the security of information transmitted through the Internet, against passive or active attacks, is a major concern. The discovery of new pseudo-random number generators with a strong level of security is a field of research in…