PROBABLE APPROACH TO SAFETY ASSESSMENT INFORMATION FROM THREATS

It is well known that the main goal of information protection is to ensure a given level of its security. The specified level of information security is characterized by the state of its protection from threats, which provides an acceptable risk of its destruction, alteration, theft, and blocking. Risks depend on the level of engineering and technical protection of information (ITZI), which is determined by the resources of the system. The more resource for information protection, the higher the level of security. With an unlimited resource, you can get an arbitrarily small probability of a threat being realized.

Many-body localization enables iterative quantum optimization

We suggest an iterative quantum protocol, allowing to solve optimization problems with a glassy energy landscape. It is based on a periodic cycling around the tricritical point of the many-body localization transition. This ensures that each iteration leads to a non-exponentially small probability to find a lower local energy minimum. The other key ingredient is to tailor the cycle parameters to a currently achieved optimal state (the "reference" state) and to reset them once a deeper minimum is found. We show that, if the position of the tricritical point is known, the algorithm allows to approach the absolute minimum with any given precision in a polynomial time.

Approximate Minimum Selection with Unreliable Comparisons

We consider the approximate minimum selection problem in presence of independent random comparison faults. This problem asks to select one of the smallest k elements in a linearly-ordered collection of n elements by only performing unreliable pairwise comparisons: whenever two elements are compared, there is a small probability that the wrong comparison outcome is observed. We design a randomized algorithm that solves this problem with a success probability of at least $$1-q$$ 1 - q for $$q \in (0, \frac{n-k}{n})$$ q ∈ ( 0 , n - k n ) and any $$k \in [1, n-1]$$ k ∈ [ 1 , n - 1 ] using $$O\big ( \frac{n}{k} \big \lceil \log \frac{1}{q} \big \rceil \big )$$ O ( n k ⌈ log 1 q ⌉ ) comparisons in expectation (if $$k \ge n$$ k ≥ n or $$q \ge \frac{n-k}{n}$$ q ≥ n - k n the problem becomes trivial). Then, we prove that the expected number of comparisons needed by any algorithm that succeeds with probability at least $$1-q$$ 1 - q must be $${\varOmega }(\frac{n}{k}\log \frac{1}{q})$$ Ω ( n k log 1 q ) whenever q is bounded away from $$\frac{n-k}{n}$$ n - k n , thus implying that the expected number of comparisons performed by our algorithm is asymptotically optimal in this range. Moreover, we show that the approximate minimum selection problem can be solved using $$O( (\frac{n}{k} + \log \log \frac{1}{q}) \log \frac{1}{q})$$ O ( ( n k + log log 1 q ) log 1 q ) comparisons in the worst case, which is optimal when q is bounded away from $$\frac{n-k}{n}$$ n - k n and $$k = O\big ( \frac{n}{\log \log \frac{1}{q}}\big )$$ k = O ( n log log 1 q ) .

A dynamical quantum Cheshire Cat effect and implications for counterfactual communication

Here we report a type of dynamic effect that is at the core of the so called “counterfactual computation” and especially “counterfactual communication” quantum effects that have generated a lot of interest recently. The basic feature of these counterfactual setups is the fact that particles seem to be affected by actions that take place in locations where they never (more precisely, only with infinitesimally small probability) enter. Specifically, the communication/computation takes place without the quantum particles that are supposed to be the information carriers travelling through the communication channel or entering the logic gates of the computer. Here we show that something far more subtle is taking place: It is not necessary for the particle to enter the region where the controlling action takes place; it is enough for the controlled property of the particle, (i.e., the property that is being controlled by actions in the control region), to enter that region. The presence of the controlled property, without the particle itself, is possible via a quantum Cheshire Cat type effect in which a property can be disembodied from the particle that possesses it. At the same time, we generalize the quantum Cheshire Cat effect to dynamical settings, in which the property that is “disembodied” from the particle possessing it propagates in space, and leads to a flux of “disembodied” conserved quantities.

Hiding Data in Plain Sight: Towards Provably Unbreakable Encryption with Short Secret Keys and One-Way Functions

It has long been known that cryptographic schemes offering provably unbreakable security exist, namely the One Time Pad (OTP). The OTP, however, comes at the cost of a very long secret key - as long as the plain-text itself. In this paper we propose an encryption scheme which we (boldly) claim offers the same level of security as the OTP, while allowing for much shorter keys, of size polylogarithmic in the computing power available to the adversary. The Scheme requires a large sequence of truly random words, of length polynomial in the both plain-text size and the logarithm of the computing power the adversary has. We claim that it ensures such an attacker cannot discern the cipher output from random data, except with small probability. We also show how it can be adapted to allow for several plain-texts to be encrypted in the same cipher output, with almost independent keys. Also, we describe how it can be used in lieu of a One Way Function.

Low-Degree Approximation of Random Polynomials

We prove that with “high probability” a random Kostlan polynomial in $$n+1$$ n + 1 many variables and of degree d can be approximated by a polynomial of “low degree” without changing the topology of its zero set on the sphere $$\mathbb {S}^n$$ S n . The dependence between the “low degree” of the approximation and the “high probability” is quantitative: for example, with overwhelming probability, the zero set of a Kostlan polynomial of degree d is isotopic to the zero set of a polynomial of degree $$O(\sqrt{d \log d})$$ O ( d log d ) . The proof is based on a probabilistic study of the size of $$C^1$$ C 1 -stable neighborhoods of Kostlan polynomials. As a corollary, we prove that certain topological types (e.g., curves with deep nests of ovals or hypersurfaces with rich topology) have exponentially small probability of appearing as zero sets of random Kostlan polynomials.

Irreversible Physical Process and Information Height

The time’s arrow of macroscopic physical phenomenon is reflected by irreversible physical process, which essentially occurs from small probability state to high probability state. In this paper, simplified models are proposed to understand the macroscopic physical process. In order to describe the information of a physical system, we defined the full self-information as "information height" to describe the complexity or difficulty of a macrostate of physical system. In this way, the direction of macroscopic physical process is from high information height to low information height. We can judge the direction of physical process by the information height. If we want the macroscopic physical process to evolve from the low information height state to the high information height state, the system need to add extra information and corresponding energy to increase the information height.

Delegating a Product of Group Exponentiations with Application to Signature Schemes (Submission to Special NutMiC 2019 Issue of JMC)

Many public-key cryptosystems and, more generally, cryptographic protocols, use group exponentiations as important primitive operations. To expand the applicability of these solutions to computationally weaker devices, it has been advocated that a computationally weaker client (i.e., capable of performing a relatively small number of modular multiplications) delegates such primitive operations to a computationally stronger server. Important requirements for such delegation protocols include privacy of the client’s input exponent and security of the client’s output, in the sense of detecting, except for very small probability, any malicious server’s attempt to convince the client of an incorrect exponentiation result. Only recently, efficient protocols for the delegation of a fixed-based exponentiation, over cyclic and RSA-type groups with certain properties, have been presented and proved to satisfy both requirements.In this paper we show that a product of many fixed-base exponentiations, over a cyclic groups with certain properties, can be privately and securely delegated by keeping the client’s online number of modular multiplications only slightly larger than in the delegation of a single exponentiation. We use this result to show the first delegations of entire cryptographic schemes: the well-known digital signature schemes by El-Gamal, Schnorr and Okamoto, over the q-order subgroup in ℤp, for p, q primes, as well as their variants based on elliptic curves. Previous efficient delegation results were limited to the delegation of single algorithms within cryptographic schemes.

Mutual inclinations between giant planets and their debris discs in HD 113337 and HD 38529

ABSTRACT HD 113337 and HD 38529 host pairs of giant planets, a debris disc, and wide M-type stellar companions. We measure the disc orientation with resolved images from Herschel and constrain the three-dimensional orbits of the outer planets with Gaia DR2 and Hipparcos astrometry. Resolved disc modelling leaves degeneracy in the disc orientation, so we derive four separate planet–disc mutual inclination (ΔI) solutions. The most aligned solutions give ΔI = 17°–32° for HD 113337 and ΔI = 21°–45○ for HD 38529 (both 1σ). In both systems, there is a small probability (<0.3 per cent) that the planet and disc are nearly aligned (ΔI < 3○). The stellar and planetary companions cause the orbits of disc material to precess about a plane defined by the forced inclination. We determine this as well as the precession time-scale to interpret the mutual inclination results. We find that the debris discs in both systems could be warped via joint influences of the outer planet and stellar companion, potentially explaining the observed misalignments. However, this requires HD 113337 to be old (0.8–1.7 Gyr), whereas if young (14–21 Myr), the observed misalignment in HD 113337 could be inherited from the protoplanetary disc phase. For both systems, the inclination of the stellar spin axis is consistent with the disc and outer planet inclinations, which instead supports system-wide alignment or near alignment. High-resolution observations of the discs and improved constraints on the planetary orbits would provide firmer conclusions about the (mis)alignment status.