High-capacity three-party quantum secret sharing with superdense coding

This paper presents a scheme for high-capacity three-party quantum secret sharing with quantum superdense coding, following some ideas in the work by Liuet al （2002 Phys. Rev. A 65 022304） and the quantum secret sharing scheme by Deng et al （2008 Phys. Lett. A 372 1957）. Instead of using two sets of nonorthogonal states, the boss Alice needs only to prepare a sequence of Einstei^Podolsky-l^osen pairs in d-dimension. The two agents Bob and Charlie encode their information with dense coding unitary operations, and security is checked by inserting decoy photons. The scheme has a high capacity and intrinsic efficiency as each pair can carry 21bd bits of information, and almost all the pairs can be used for carrying useful information.

Three-party reference frame independent quantum key distribution protocol

We present a three-party reference frame independent quantum key distribution protocol which can be implemented without any alignment of reference frames between the sender and the receiver.The protocol exploits entangled states to establish a secret key among three communicating parties.We derive the asymptotic key rate for the proposed protocol against collective attacks and perform a finite-size key security analysis against general attacks in the presence of statistical fluctuations.We investigate the impact of reference frame misalignment on the stability of our protocol,and we obtain a transmission distance of 180 km,200 km,and 230 km for rotation of reference framesβ=π/6,β=π/8 andβ=0,respectively.Remarkably,our results demonstrate that our proposed protocol is not heavily affected by an increase in misalignment of reference frames as the achievable transmission distances are still comparable to the case where there is no misalignment in reference frames(whenβ=0).We also simulate the performance of our protocol for a fixed number of signals.Our results demonstrate that the protocol can achieve an effective key generation rate over a transmission distance of about 120 km with realistic 107 finite data signals and approximately achieve 195 km with 109 signals.Moreover,our proposed protocol is robust against noise in the quantum channel and achieves a threshold error rate of 22.7%.

Efficient and secure three-party authenticated key exchange protocol for mobile environments

Yang and Chang (2009) proposed a three-party authenticated key exchange protocol for securing communications in mobile-commerce environments. Their protocol reduces computation and communication costs by employing elliptic curve cryptosystems. However, Tan (2010) pointed out that Yang and Chang (2009)'s protocol cannot withstand impersonation and parallel attacks, and further proposed an enhanced protocol to resist these attacks. This paper demonstrates that Tan (2010)'s approach still suffers from impersonation attacks, and presents an efficient and secure three-party authenticated key exchange protocol to overcome shown weaknesses.

Simple Three-Party Password Authenticated Key Exchange Protocol

Three-party password authenticated key exchange (3PAKE) protocol plays a significant role in the history of secure communication area in which two clients agree a robust session key in an authentic manner based on passwords. In recent years, researchers focused on developing simple 3PAKE (S-3PAKE) protocol to gain system e?ciency while preserving security robustness for the system. In this study, we first demonstrate how an undetectable on-line dictionary attack can be successfully applied over three existing S-3PAKE schemes. An error correction code (ECC) based S-3PAKE protocol is then introduced to eliminate the identified authentication weakness.

An Efficient Three-Factor Authenticated Key Agreement Technique Using FCM Under HC-IoT Architectures

The Human-Centered Internet of Things(HC-IoT)is fast becoming a hotbed of security and privacy concerns.Two users can establish a common session key through a trusted server over an open communication channel using a three-party authenticated key agreement.Most of the early authenticated key agreement systems relied on pairing,hashing,or modular exponentiation processes that are computationally intensive and cost-prohibitive.In order to address this problem,this paper offers a new three-party authenticated key agreement technique based on fractional chaotic maps.The new scheme uses fractional chaotic maps and supports the dynamic sensing of HC-IoT devices in the network architecture without a password table.The projected security scheme utilized a hash function,which works well for the resource-limited HC-IoT architectures.Test results show that our new technique is resistant to password guessing attacks since it does not use a password.Furthermore,our approach provides users with comprehensive privacy protection,ensuring that a user forgery attack causes no harm.Finally,our new technique offers better security features than the techniques currently available in the literature.