Search

In blockchain technology, data are stored on decentralized nodes and public to each node in the blockchain network. Hence, the focus of privacy protection in the blockchain guarantees the anonymity of transactions such that attackers cannot attain the users’ personal information through data analysis. Among the existing privacy protection technologies, the scheme based on group signature has good anonymity, but the existing scheme exists a large number of operations that are difficult to apply to wireless terminals. In this paper, using the powerful offloading capability of edge computing, we propose a blockchain node traceable identity privacy technology scheme based on threshold group signature, and the scheme greatly reduces the computing burden of nodes while achieving node privacy protection.

Based on blockchain and quantum signature, a novel E-payment protocol is proposed in this paper. Our E-payment protocol could protect user’s anonymity as the traditional E-payment systems do, and also have unconditional security which the classical E-payment systems can not provide. Our scheme adopt the techniques of blockchain, quantum key distribution, one-time pad and quantum proxy blind signature. Furthermore, compared with the existing quantum E-payment systems, the blockchain technology is introduced to make our scheme more secure.

In the e-commerce scenario, the signature schemes generally have to meet four requirements: public verification, integrity, traceable and efficiency. To achieve the above goals, the paper proposes a identity-based threshold group signature scheme which can not only simplify the process of key management, but also allow to trace the user identities. To protect the user privacy, the scheme blinds the user identities and stores them on the blockchain to prevent the malicious members from tampering with the content. Security analysis shows that the proposed signature, whose difficulty is equivalent to solve the discrete logarithm problem, achieves a high level of anonymity and can resist impersonation attacks. Computational complexity analysis shows that the new method with low computation overhead and high communication efficiency can be effectively adapted to the electronic commerce scene.

Aiming at the problem of trust, we propose a secure multi-party signature scheme based on trust mechanism. In this scheme, we introduce a trust vector with time-stamped and form a trust matrix composed of multi-dimensional vectors to record the behavior of the participants periodically. Finally, a trusted evaluation mechanism is established for the participants. Under the premise of participant trustworthiness, a secure multi-party dynamic threshold signature scheme is constructed by secret sharing technology. The security analysis shows that the scheme can effectively suppress the vandalism of malicious participants. it is forward security and can resist mobile attacks. Performance analysis shows that the scheme has lower computational complexity and higher execution efficiency.

Based on the intractable problem of discrete logarithm in ECC, this paper presents a new signcryption scheme without using Hash or redundant functions. This scheme has the public verifiability and forward security. Moreover, we analysis its correctness and security. Compared with Zhou scheme, the number of model index is reached the minimum zero time. This makes the scheme have higher security and wider applications.

The basic idea of quantum secret sharing is to share classical information through quantum schemes. In reality, the number of secret bits shared will vary according to the actual situation. For this reason, a secret sharing scheme of double qubits is constructed based on single particle. At the same time, combined with the needs of real life in e-commerce, this paper proposes a quantum blind signature protocol suitable for electronic cash payment scenarios. In this protocol, the blinding of the message is an XOR operation, which makes the solution simpler and easier to implement, and the owner of the message cannot be tracked. Moreover, we use quantum key distribution protocol and quantum one-time pad to guarantee its unconditional security. The quantum blind signature applied to the electronic payment system proposed in this paper could protect user’s anonymity as the traditional E-payment systems do, and also have unconditional security which the classical E-payment systems cannot provide. Security analysis shows that our scheme is unforgeability, undeniability, blindness and unconditionally secure.

In recent years, the mobile Internet has been rapidly developed and widely used. Aiming at the problems of the weak computing power of mobile internet mobile terminal equipment, limited energy supply and high security requirements due to the complexity of mobile Internet environment, we proposes a secure and efficient server-assisted verification threshold proxy re-signature scheme, and the correctness of the program is verified. The proposed scheme includes a threshold proxy re-signature algorithm and a server-assisted authentication protocol scheme. Threshold proxy re-signature is a technique of proxy re-signature using threshold, which can decentralize the proxy’s signature rights. In the scheme, the verifier and the server send the complex signature verification operation to a semi-trusted server through the protocol, which effectively reduces the computational load of the verifier. The security analysis results show that the new scheme is safe and it is proved that the scheme is safe under collusion attack and adaptive selection message attack under the standard model. The performance analysis results show that the new scheme proposed in this paper has shorter signature length, less computational cost, higher verification efficiency and better adaptability to the mobile Internet environment.

Based on the intractable problem of discrete logarithm in ECC and the intractability of reversing a one-way hash function, this paper presents a signcryption scheme with public verifiability and forward security. In the process of security proof, the unforgeability ensures that the attacker can’t create a valid ciphertext. We verify the cipher text \( c \) instead of the plain text \( m \) in verification phase. We protect the plain text \( m \), which makes the proposed scheme confidential. Thus, the proposed scheme has the property of public verification. And the scheme ensures that if the sender’s private key is compromised, but the attacker can’t recover original message \( m \) from cipher text \( (c,R,s) \). By the performance analysis, our proposed scheme mainly uses the model multiplication. Compared with Zhou scheme, the number of model multiplication has lost one time in signcryption phase, which leads to the significant increase in calculation rate. Moreover, the signature length has lost \( 2|n| \) compared with Zhou scheme. In other words, the minimum value of complexity is reached in theory. This makes the scheme have higher security and wider applications.

The voting scheme applying on the blockchain can be used to evaluate credit and verify identities. Traditional signature schemes for voting scene exists several drawbacks such as distrust of central nodes and inefficiency for group signature and ring signature respectively. A new signature scheme based on Asmuth-Bloom scheme is proposed which is promising for the Blockchain. The proposed scheme without the participation of the dealer is able to synthesize the signature with the shares, during which the group private key is not exposed and the sensitive data will be validated to ensure the security of data transmitting in the Blockchain unsafe transmission channel. Security analysis shows that the proposed design for solving the discrete logarithm is able to resist malicious attacks. Computational complexity analysis shows that the new one with low computational cost and transmission efficiency can be effectively adapted to the Blockchain.

The management of teaching ability evaluation is the main part of the personnel training target, which is formulated by the school, this article unifies the practice of classroom teaching ability evaluation, research has analyzed the key technologies about the design of the evaluation index system, the theory of support vector machine, incremental learning and so on; it has established the Model of Teaching Ability Evaluation based on the TSVM, and applies it to the School Teaching Ability Evaluation System. The experimental studies have shown that this model can obtain more desirable results.

With the rapid development of Internet and Web technology, Web page has become a main carrier of information publishing. In connection with the problems of current complex implementation, high error rate and low extraction speed of Web information extraction technology, this paper proposes a new method of Web extraction based on the characteristics of structure of Web page. This method is to use tree structure of DOM (Document Object Model) when analyzing web page, parsing the Web page into DOM tree to sort the scattered web pages, by the using of the characteristics of Chinese web pages similar in information structure and aggregated distribution to achieve simply with good versatility. At the same time, this method can reduce the complexity when dealing with the structure of web page and increase the speed of the Web information extraction. At present, the method has been applied to the news page automatic classification system, which is good to meet the system's requirements.