Related papers: Multiparty Non-Interactive Key Exchange and More F…
A low storage algorithm for constructing isogenies between ordinary elliptic curves was proposed by Galbraith, Hess and Smart (GHS). We give an improvement of this algorithm by modifying the pseudorandom walk so that lower-degree isogenies…
This article presents a novel method for establishing an information theoretically secure encryption key over wireless channels. It exploits the fact that data transmission over wireless links is accompanied by packet error, while noise…
This thesis explores foundational aspects of quantum information theory and quantum cryptography. First, we investigate quantum correlations in interactive settings, including the CHSH and graph isomorphism games. We aim to distinguish…
We propose a linear algebraic method, rooted in the spectral properties of graphs, that can be used to prove lower bounds in communication complexity. Our proof technique effectively marries spectral bounds with information-theoretic…
Recently, Aaronson et al. (arXiv:2009.07450) showed that detecting interference between two orthogonal states is as hard as swapping these states. While their original motivation was from quantum gravity, we show its applications in quantum…
We describe the design and implementation of efficient signature and key-exchange schemes for the AVR ATmega and ARM Cortex M0 microcontrollers, targeting the 128-bit security level. Our algorithms are based on an efficient Montgomery…
We offer a public key exchange protocol in the spirit of Diffie-Hellman, but we use (small) matrices over a group ring of a (small) symmetric group as the platform. This "nested structure" of the platform makes computation very efficient…
We present two new schemes for quantum key distribution (QKD) that neither require entanglement nor an ideal single-photon source, making them implementable with commercially available single-photon sources. These protocols are shown to be…
Most traditional applications of quantum cryptography are point-to-point communications, in which only two users can exchange keys. In this letter, we present a network scheme that enable quantum key distribution between multi-user with…
We prove that almost every interval exchange transformation, with an associated translation surface of genus $g\geq 2$, can be non-trivially and isometrically embedded in a family of piecewise isometries. In particular this proves the…
We present an efficient quantum algorithm for some independent set problems in graph theory, based on non-abelian adiabatic mixing. We illustrate the performance of our algorithm with analysis and numerical calculations for two different…
Random key graphs represent topologies of secure wireless sensor networks that apply the seminal Eschenauer-Gligor random key predistribution scheme to secure communication between sensors. These graphs have received much attention and also…
The Diffie-Hellman key exchange plays a crucial role in conventional cryptography, as it allows two legitimate users to establish a common, usually ephemeral, secret key. Its security relies on the discrete-logarithm problem, which is…
Secure multi-party quantum computation (MPQC) protocol is a versatile tool that enables error-free distributed quantum computation to a group of $n$ mutually distrustful quantum nodes even when some of the quantum nodes do not follow the…
Quantum networks will provide multi-node entanglement over long distances to enable secure communication on a global scale. Traditional quantum communication protocols consume pair-wise entanglement, which is sub-optimal for distributed…
The dynamic establishment of shared information (e.g. secret key) between two entities is particularly important in networks with no pre-determined structure such as wireless sensor networks (and in general wireless mobile ad-hoc networks).…
Quantum secret-sharing protocols involving N partners (NQSS) are key distribution protocols in which Alice encodes her key into $N-1$ qubits, in such a way that all the other partners must cooperate in order to retrieve the key. On these…
Smart grid is a self-sufficient system. That tracks how the energy is used from its source to its final destination. The smart grid can increase the service quality while reducing the consumption of electricity. However, the safety and…
Reconstruction of evolutionary relationships between species is an important topic in the field of computational biology. Pairwise compatibility graphs (PCGs) are used to model such relationships. A graph is a PCG if its edges can be…
We propose an efficient quantum protocol performing quantum bit commitment, which is a simple cryptographic primitive involved with two parties, called a committer and a verifier. Our protocol is non-interactive, uses no supplemental shared…