Related papers: On Security Properties of All-or-nothing Transform…
For a probability distribution $P$ on an at most countable alphabet $\mathcal A$, this article gives finite sample bounds for the expected occupancy counts $\mathbb E K_{n,r}$ and probabilities $\mathbb E M_{n,r}$. Both upper and lower…
This paper presents a general expression for a number-theoretic Hilbert transform (NHT). The transformations preserve the circulant nature of the discrete Hilbert transform (DHT) matrix together with alternating values in each row being…
A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. It was conjectured that in each completely…
We initiate an investigation of structures on the set of real numbers having the property that path components of definable sets are definable. All o\nobreakdash-\hspace{0pt}minimal structures on $(\mathbb{R},<)$ have the property, as do…
Uncertainty relations lie at the very core of quantum mechanics, and form the cornerstone of essentially all quantum cryptographic applications. In particular, they play an important role in cryptographic protocols in the…
An ordered structure is called o-minimalistic if it has all the first-order features of an o-minimal structure. We propose a theory, DCTC (Definable Completeness/Type Completeness), that describes many properties of o-minimalistic…
We study combinatorial structures arising from finite-time transition probabilities of the Totally Asymmetric Simple Exclusion Process with open boundary conditions. While much of the existing combinatorial theory regarding the TASEP…
The Balanced-Pairwise-Affinities (BPA) feature transform is designed to upgrade the features of a set of input items to facilitate downstream matching or grouping related tasks. The transformed set encodes a rich representation of high…
We explain how to see finite combinatorics of preorders implicit in the {text} of basic topological definitions or arguments in (Bourbaki, General topology, Ch.I), and define a concise combinatorial notation such that complete definitions…
We show that (in ZFC) every infinite set S can be equipped with 2^|S| complete metrics which generate mutually non-homeomorphic scattered order topologies on S. Furthermore, we show that (in ZFC) every uncountable set S can be equipped with…
An experiment or theory is classically explainable if it can be reproduced by some noncontextual ontological model. In this work, we adapt the notion of ontological models and generalized noncontextuality so it applies to the framework of…
In this note a notion of generalized topological entropy for arbitrary subsets of the space of all sequences in a compact topological space is introduced. It is shown that for a continuous map on a compact space the generalized topological…
Certified randomness guaranteed to be unpredictable by adversaries is central to information security. The fundamental randomness inherent in quantum physics makes certification possible from devices that are only weakly characterised, i.e.…
An S-approximation space is a novel approach to study systems with uncertainty that are not expressible in terms of inclusion relations. In this work, we further examined these spaces, mostly from a topological point of view by a…
Basic techniques to prove the unconditional security of quantum cryptography are described. They are applied to a quantum key distribution protocol proposed by Bennett and Brassard in 1984. The proof considers a practical variation on the…
Almost sure reachability refers to the property of a stochastic system whereby, from any initial condition, the system state reaches a given target set with probability one. In this paper, we study the problem of certifying almost sure…
We consider the level of information security provided by random linear network coding in network scenarios in which all nodes comply with the communication protocols yet are assumed to be potential eavesdroppers (i.e. "nice but curious").…
Optimal solutions of combinatorial optimization problems can be sensitive to changes in the cost of one or more elements of the ground set E. Single and set tolerances measure the supremum / infimum possible change such that the current…
Let $X$ be an irreducible shift of finite type (SFT) of positive entropy, and let $B_n(X)$ be its set of words of length $n$. Define a random subset $\omega$ of $B_n(X)$ by independently choosing each word from $B_n(X)$ with some…
A general theory of permutation orbifolds is developed for arbitrary twist groups. Explicit expressions for the number of primaries, the partition function, the genus one characters, the matrix elements of modular transformations and for…