A Rational Approach to Cryptographic Protocols

This work initiates an analysis of several cryptographic protocols from a rational point of view using a game-theoretical approach, which allows us to represent not only the protocols but also possible misbehaviours of parties. Concretely, several concepts of two-person games and of two-party cryptographic protocols are here combined in order to model the latters as the formers. One of the main advantages of analysing a cryptographic protocol in the game-theory setting is the possibility of describing improved and stronger cryptographic solutions because possible adversarial behaviours may be taken into account directly. With those tools, protocols can be studied in a malicious model in order to find equilibrium conditions that make possible to protect honest parties against all possible strategies of adversaries

Examples of rational toral rank complex

In "A Hosse diagram for rational toral tanks," we see a CW complex ${\mathcal T}(X)$, which gives a rational homotopical classification of almost free toral actions on spaces in the rational homotopy type of $X$ associated with rational toral ranks and also presents certain relations in them. We call it the {\it rational toral rank complex} of $X$. It represents a variety of toral actions. In this note, we will give effective 2-dimensional examples of it when $X$ is a finite product of odd spheres. This is a combinatorial approach in rational homotopy theory.Comment: 8 page

Rational-operator-based depth-from-defocus approach to scene reconstruction

This paper presents a rational-operator-based approach to depth from defocus (DfD) for the reconstruction of three-dimensional scenes from two-dimensional images, which enables fast DfD computation that is independent of scene textures. Two variants of the approach, one using the Gaussian rational operators (ROs) that are based on the Gaussian point spread function (PSF) and the second based on the generalized Gaussian PSF, are considered. A novel DfD correction method is also presented to further improve the performance of the approach. Experimental results are considered for real scenes and show that both approaches outperform existing RO-based methods

Detecting and determining preserved measures and integrals of rational maps

In this paper we use the method of discrete Darboux polynomials to calculate preserved measures and integrals of rational maps. The approach is based on the use of cofactors and Darboux polynomials and relies on the use of symbolic algebra tools. Given sufficient computing power, most, if not all, rational preserved integrals can be found (and even some non-rational ones). We show, in a number of examples, how it is possible to use this method to both determine and detect preserved measures and integrals of the considered rational maps. Many of the examples arise from the Kahan-Hirota-Kimura discretization of completely integrable systems of ordinary differential equations