Related papers: Multiparty Non-Interactive Key Exchange and More F…
Quantum public-key encryption (PKE), where public-keys and/or ciphertexts can be quantum states, is an important primitive in quantum cryptography. Unlike classical PKE (e.g., RSA or ECC), quantum PKE can leverage quantum-secure…
We consider the problem where a group of n nodes, connected to the same broadcast channel (e.g., a wireless network), want to generate a common secret bitstream, in the presence of an adversary Eve, who tries to obtain information on the…
Let $\mathcal X$ be a genus 2 curve defined over a field $K$, $\mbox{char} K = p \geq 0$, and $\mbox{Jac} (\mathcal X, \iota)$ its Jacobian, where $\iota$ is the principal polarization of $\mbox{Jac} (\mathcal X)$ attached to $\mathcal X$.…
Quantum homomorphic encryption (QHE) is an encryption method that allows quantum computation to be performed on one party's private data with the program provided by another party, without revealing much information about the data nor the…
This Paper proposes an ECDH key exchange method and an ECsig Digital Signature Authentication method based on group with Koblits curve, man-in-the-middle attack prevention method for SA payload and initiator identification payload to design…
In this paper, we consider the problem of secret key generation for multiple parties. Multi-user networks usually require a trusted party to efficiently distribute keys to the legitimate users and this process is a weakness against…
Elliptic curve cryptography (ECC) is used in many security systems due to its small key size and high security as compared to the other cryptosystems. In many well-known security systems substitution box (S-box) is the only non-linear…
We introduce a device-independent quantum key distribution protocol for N parties, using the multipartite Hardy paradox to certify genuine multipartite nonlocality. Unlike traditional multipartite protocols that extract the key from…
Background: The kidney exchange problem (KEP) addresses the matching of patients in need for a replacement organ with compatible living donors. Ideally many medical institutions should participate in a matching program to increase the…
Though the multilinear maps have many cryptographic applications, secure and efficient construction of such maps is an open problem. Many multilinear maps like GGH, GGH15, CLT, and CLT15 have been and are being proposed, while none of them…
In this writing, we introduce a novel biometric-authenticated key exchange protocol that allows secure and privacy-preserving key establishment between a stateless biometric sensing system and a "smart" user token that possesses biometric…
In this survey, we describe a general key exchange protocol based on semidirect product of (semi)groups (more specifically, on extensions of (semi)groups by automorphisms), and then focus on practical instances of this general idea. This…
Let Sp($k$) denote the number of the $\lfloor k/2\rfloor$-element subsets of a finite $k$-element set. We prove that the least size of a generating subset of the Boolean lattice with $n$ atoms (or, equivalently, the powerset lattice of an…
Key-agreement protocols whose security is proven in the random oracle model are an important alternative to protocols based on public-key cryptography. In the random oracle model, the parties and the eavesdropper have access to a shared…
After 38 years of birthday Diffie-Hellman Key Exchange (DHKE), there are many proposed improvements in the DHKE protocol to encounter modern security issues. This protocol seems quite simple to be implemented, but it can be vulnerable to…
Substitution boxes with thorough cryptographic strengths are essential for the development of strong encryption systems. They are the only portions capable of inducing nonlinearity in symmetric encryption systems. Bijective substitution…
Elliptic curve multiplications can be improved by replacing the standard ladder algorithm's base 2 representation of the scalar multiplicand, with mixed-base representations with power-of-2 bases, processing the n bits of the current digit…
Known key exchange schemes offering information-theoretic (unconditional) security are complex and costly to implement. Nonetheless, they remain the only known methods for achieving unconditional security in key exchange. Therefore, the…
We consider secret key generation for a "pairwise independent network" model in which every pair of terminals observes correlated sources that are independent of sources observed by all other pairs of terminals. The terminals are then…
Supersingular elliptic curve isogeny graphs underlie isogeny-based cryptography. For isogenies of a single prime degree $\ell$, their structure has been investigated graph-theoretically. We generalise the notion of $\ell$-isogeny graphs to…