Related papers: A new key exchange protocol based on the decomposi…
Some protected password change protocols were proposed. However, the previous protocols were easily vulnerable to several attacks such as denial of service, password guessing, stolen-verifier and impersonation atacks etc. Recently, Chang et…
A new approach to quantum cryptography to be called KCQ, keyed communication in quantum noise, is developed on the basis of quantum detection and communication theory for classical information transmission. By the use of a shared secret key…
Until recently, techniques for obtaining lower bounds for kernelization were one of the most sought after tools in the field of parameterized complexity. Now, after a strong influx of techniques, we are in the fortunate situation of having…
In the standard set reconciliation problem, there are two parties $A_1$ and $A_2$, each respectively holding a set of elements $S_1$ and $S_2$. The goal is for both parties to obtain the union $S_1 \cup S_2$. In many distributed computing…
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subset of variables yields a subproblem of the reduced complexity…
The characteristics of high loss rate, resource constraint, being eager for good security haven't been fully considered in the existing key establishment protocols of wireless sensor networks. Analyzing the key establishing problem from the…
We propose a new cryptosystem based on polycyclic groups. The cryptosystem is based on the fact that the word problem can be solved effectively in polycyclic groups, while the known solutions to the conjugacy problem are far less efficient.
Decomposition puzzles are pencil-and-paper logic puzzles that involve partitioning a rectangular grid into several regions to satisfy certain rules. In this paper, we construct a generic card-based protocol called printing protocol, which…
This paper presents a novel methodology to test the security of the Diffie-Hellman public key exchange protocol. The security of many cryptographic schemes rely on the hardness of this problem. We are presenting a purely statistical test to…
In this paper, we study the isomorphism problem for central extensions. More precisely, in some new situations, we provide necessary and sufficient conditions for two central extensions to be isomorphic. We investigate the case when the…
We present a new key exchange protocol based on circulant matrices acting on matrices over a congruence-simple semiring. We describe how to compute matrices with the necessary properties for the implementation of the protocol. Additionally,…
We analyze a cryptographic protocol for generating a distributed secret key from correlations that violate a Bell inequality by a sufficient amount, and prove its security against eavesdroppers, constrained only by the assumption that any…
To achieve security in wireless networks, it is important to be able to encrypt and authenticate messages sent among sensor nodes. Due to resource constraints, achieving such key agreement in wireless sensor networks in nontrivial. Blom's…
The conjugacy search problem in a group G is the problem of recovering an x in G from given g in G and h=x^{-1}gx. This problem is in the core of several recently suggested public key exchange protocols, most notably the one due to Anshel,…
In this paper, we proposed an identification and data encrypt key manage protocol that can be used in some security system based on such secure devices as secure USB memories or RFIDs, which are widely used for identifying persons or other…
A novel secure communication protocol is presented, based on an entangled pair of qubits and allowing asymptotically secure key distribution and quasi-secure direct communication. Since the information is transferred in a deterministic…
With the advent of modern communications systems, much attention has been put on developing methods for securely transferring information between constituents of wireless sensor networks. To this effect, we introduce a mathematical…
This paper is devoted to the construction of order reduced method of fourth order problems. A framework is presented such that a problem on a high-regularity space can be deduced in a constructive way to an equivalent problem on three…
This paper presents a prepare-and-measure scheme using $N$-dimensional quantum particles as information carriers where $N$ is a prime power. One of the key ingredients used to resist eavesdropping in this scheme is to depolarize all Pauli…
An important subcase of the hidden subgroup problem is equivalent to the shift problem over abelian groups. An efficient solution to the latter problem would serve as a building block of quantum hidden subgroup algorithms over solvable…