Related papers: Comment on "Provably secure biometric-based client…

Recently, Abdalla et al. proposed a new gateway-oriented password-based authenticated key exchange (GPAKE) protocol among a client, a gateway, and an authentication server, where each client shares a human-memorable password with a trusted…

Non-interactive key exchange (NIKE) enables two or multiple parties (just knowing the public system parameters and each other's public key) to derive a (group) session key without the need for interaction. Recently, NIKE in multi-party…

The widespread use of wireless sensor networks (WSNs) that are consisted of resource-constrained sensor nodes in communication with gateways in open-space environments and industries has highlighted the need for a secure yet fast…

The need for secrecy and security is essential in communication. Secret sharing is a conventional protocol to distribute a secret message to a group of parties, who cannot access it individually but need to cooperate in order to decode it.…

Anonymity in networked communication is vital for many privacy-preserving tasks. Secure key distribution alone is insufficient for high-security communications, often knowing who transmits a message to whom and when must also be kept hidden…

In all existing protocols of private communication with encryption and decryption, the pre-shared key can be used for only one time. We give a deterministic quantum key expansion protocol where the pre-shared key can be recycled. Our…

A quantum digital signature protocol based on quantum mechanics is proposed in this paper. The security of the protocol relies on the existence of quantum one-way functions by quantum information theorem. This protocol involves a so-called…

Previous Web access authentication systems often use either the Web or the Mobile channel individually to confirm the claimed identity of the remote user. This paper proposes a new protocol using multifactor authentication system that is…

We consider a setup in which the channel from Alice to Bob is less noisy than the channel from Eve to Bob. We show that there exist encoding and decoding which accomplish error correction and authentication simultaneously; that is, Bob is…

This paper proposes the use of sets of keys, together with corresponding identifiers, for use in wireless sensor networks and similar resource-constrained applications. A specific cryptographic scheme described in the paper is based on the…

Symmetric private information retrieval is a cryptographic task allowing a user to query a database and obtain exactly one entry without revealing to the owner of the database which element was accessed. The task is a variant of general…

Semi-quantum cryptography involves at least one user who is semi-quantum or "classical" in nature. Such a user can only interact with the quantum channel in a very restricted way. Many semi-quantum key distribution protocols have been…

One of the most important issues in peer-to-peer networks is anonymity. The major anonymity for peer-to-peer users concerned with the users' identities and actions which can be revealed by any other members. There are many approaches…

Semi-quantum communication, a model introduced in 2007 by M. Boyer, D. Kenigsberg, and T. Mor (PRL 99 140501), involves the use of fully-quantum users and semi-quantum, or "classical" users. These restricted users are only allowed to…

Ensuring the correctness of distributed system implementations remains a challenging and largely unaddressed problem. In this paper we present a protocol that can be used to certify the safety of consensus implementations. Our proposed…

Recently, a mutual semi-quantum key agreement protocol using Bell states is proposed by Yan et al. (Mod. Phys. Lett. A, 34, 1950294, 2019). The proposed protocol tries to help a quantum participant share a key with a classical participant…

We propose an electronic payment protocol for typical customer-merchant relations which does not require a trusted (signed) payment descriptor to be sent from the merchant to the customer. Instead, the destination "account" number for the…

We consider attacks on two-way quantum key distribution protocols in which an undetectable eavesdropper copies all messages in the message mode. We show that under the attacks there is no disturbance in the message mode and that the mutual…

Catch 22 of cryptography - "Before two parties can communicate in secret, they must first communicate in secret". The weakness of classical cryptographic communication systems is that secret communication can only take place after a key is…

This paper suggests a message authentication scheme, which can be efficiently used for secure digital signature creation. The algorithm used here is an adjusted union of the concepts which underlie projective geometry and group structure on…