Signcryption provides confidentiality and authenticity efficiently;it can be used to design compact communication protocol.Arbitration mechanism is used for settling disputes in signcryption,but the information that the judge gets also brings some security problems.This paper points out two problems:in some scheme,the arbitrator can decrypt all the signcryptions of a receiver while be gets some kinds of arbitration message;in another schemes,the arbitration mechanism cannot protect the integrity of plain- text.Analyze the two kinds of problems and concludes their reasons separately,we proposed a resolvent that can solve the two prob- lem by changing a secure arbitration message.Based on the attack and analysis,this paper proposes a secure arbitral signcryption (SASC)scheme and proves its IND-CCA2 security and UF-CMA security in random oracle model.Furthermore,SASC is a secure- ly arbitral signcryption scheme,it can protect the integrity of plaintexts by an arbitration message associated with plaintext;and the scheme can resist decryption attacks of arbitrator,even he gets the arbitration message.SASC does not increase computation nor communication overloads;it has no limitation to the length of plaintext,which makes SASC more convenient.Proofs and analysis show that SASC is an efficient and secure scheme.
Signcryption provides confidentiality and authenticity efficiently;it can be used to design compact communication protocol.Arbitration mechanism is used for settling disputes in signcryption,but the information that the judge gets also brings some security problems.This paper points out two problems:in some scheme,the arbitrator can decrypt all the signcryptions of a receiver while be gets some kinds of arbitration message;in another schemes,the arbitration mechanism cannot protect the integrity of plain- text.Analyze the two kinds of problems and concludes their reasons separately,we proposed a resolvent that can solve the two prob- lem by changing a secure arbitration message.Based on the attack and analysis,this paper proposes a secure arbitral signcryption (SASC)scheme and proves its IND-CCA2 security and UF-CMA security in random oracle model.Furthermore,SASC is a secure- ly arbitral signcryption scheme,it can protect the integrity of plaintexts by an arbitration message associated with plaintext;and the scheme can resist decryption attacks of arbitrator,even he gets the arbitration message.SASC does not increase computation nor communication overloads;it has no limitation to the length of plaintext,which makes SASC more convenient.Proofs and analysis show that SASC is an efficient and secure scheme.
Perfect concurrent signature was introduced as an efficient approach to solving the problem of fair exchange of signatures. Almost all fair exchange e-commerce protocols that have been proposed until now either do not provide message privacy protection or adopt the sign-then-encrypt scheme to provide confidentiality. However, confidentiality is an important requirement of e-commerce protocols. This paper proposed a new concept called perfect concurrent signcryption which combined the concepts of perfect concurrent signature and signcryption together to resolve the confidentiality problem in e-commerce systems. It also proposed a certificateless perfect concurrent signcryption scheme and proved its security in the random oracle model. The scheme published the two ambiguous signcryptions in any order. Compared with the sign-then-encrypt scheme, this scheme enjoys shorter message length and less operation cost, which makes the scheme has wide application prospects.
By introducing signcryption technology into concurrent signature,a signcryption-based concurrent signature scheme was presented,which was proven to have the existential unforgeability against adaptive chosen messages attacks under the random oracle model,Based on this scheme,a fair exchange protocol was proposed,which could be used to exchange digital goods.This protocol did not need secure communications channel,in which two parties generate sym-metrical ambiguous signatures and individual keystones were released by themselves,which ensured the properties of confidentiality,ambiguousness and fairness,which made our protocol could be used in e-commerce payment,e-contract signing,mail authentication,etc.
How to construct a multi message multi receiver signcryption scheme for reusing random numbers on a ring is an urgent task to be solved. Based on the LHY20 standard signature scheme and the LHY21 partial random number reuse security theory, For the first time, a multi message multi receiver signature scheme without trapdoors on the ring is constructed. It is proved that the confidentiality and authentication of the scheme under the random oracle model can be reduced to Indistinguishability against Adaptive Chosen Ciphertext Attacks (IND-CCA2) and Strongly Existential Unforgeability against Chosen Message Attacks (SUF-CMA), respectively. In terms of authentication, it is stronger than the multi message multi receiver signature scheme on the LHY21 standard lattice in terms of Existential Unforgeability against Chosen Message Attacks (EUF-CMA). Efficiency analysis shows that compared with the standard signcryption scheme ℰRLWESC, which runs LHY21 independently multiple times, the multi receiver signcryption scheme proposed in this paper reduces ciphertext by nearly 25%. Compared with the multi receiver signcryption scheme on the LHY21 standard lattice, the size of the public and private key in this scheme is reduced from square level to linear level. For a system with n users, it reduces nn−1×100% and nn−3×100%, respectively. The proposed scheme exhibits excellent scalability. For example, when the user scale n>100, the public key size and private key size are reduced by more than 99% and 97%, respectively. This work provides an efficient and scalable post-quantum secure solution for multi-receiver communication scenarios, promotes the practical application of ring-based lattice cryptography in secure multicast systems
Signcryption provides confidentiality and authenticity efficiently, and it can be used to design compact communication protocol. This paper analyzed the domain-verifiable signcryption which Wang proposed, and pointed out the redundant data and computation in his scheme. This paper advanced Wang's scheme and designed a new domain-verifiable signcryption scheme. Based on the signcryption scheme, this paper proposed a new secret transferring protocol. The new scheme provides integrity of ciphertext and correctness of plaintext by 3 steps, and it keeps confidentiality, fairness and non-repudiation. Meanwhile, performance analysis shows that the new scheme is more efficient.
Arbitrated quantum signature (AQS) schemes aim at ensuring the authenticity of a message with the help of an arbitrator. Moreover, they aim at preventing repudiation, both from a sender that denies the origin of a message, and from a receiver who disavows its reception. Such protocols use quantum communication and are often designed to protect quantum messages. In this paper, we study four recently submitted AQS schemes and propose attacks on their security.
Firstly, we look at Zhang, Sun, Zhang and Jia's AQS scheme which aims at signing quantum messages with chained CNOT encryption. We show that the sender can repudiate her messages and make false allegation of reception. Moreover, we show that a dishonest receiver can forge signatures.
Secondly, we analyse Ding, Xin, Yang and Sang's AQS protocol to sign classical messages based on GHZ states. We show that both the sender and the receiver have simple repudiation strategies.
Thirdly, we study Lu, Li, Yu and Han's AQS scheme that uses controlled teleportation to protect quantum messages. We expose forgeries, false allegation attacks and the possibility of repudiation by both parties.
Fourthly, we focus on the AQS scheme by Zhang, Xin, Sun, Li and Li designed to sign classical messages without entangled states. We show that one can disavow the reception of messages, and that information-theoretic security is not achieved for other security goals.