Font Size: a A A

Research On Digital Signature Schemes With Special Properties

Posted on:2021-01-12Degree:MasterType:Thesis
Country:ChinaCandidate:J L WangFull Text:PDF
Abstract/Summary:PDF Full Text Request
The Internet is booming at an unprecedented speed,and it has penetrated widely into all areas of people's work and life.However,while the Internet brings convenience to people,it also has many security risks,such as information may be illegally intercepted or tampered by attackers when it is transmitted in public channels.Digital signature scheme provides security services include data integrity verification,identity recognition,and prevent repudiation,which is an important means to ensure network information security.However,with the continuous emergence of new technologies,such as big data,cloud computing,the Internet of Things,artificial intelligence and blockchain,traditional digital signature schemes can not meet the security requirements of new network environments.Aiming at the problems of key management and calculation cost in traditional digital signature schemes,certificateless aggregate signature schemes and revocable identitybased signature schemes are proposed.The specific work is as follows:(1)To solves the key escrow problem in identity-based cryptosystem,a short certificateless aggregate signature scheme against coalition attacks is proposed.It adopts batch processing and compression technologies,and it can compress n individual signatures of n different messages into a short signature.It greatly reduces the computation cost and communication bandwidth of signature verification.The analysis results show that the against coalition attacks of this scheme depends on the collision resistance of hash function,and the validity of the corresponding aggregate signature guarantees the legitimacy of every individual signature involved in the aggregation.(2)For the certificateless signature scheme proposed by Yuan et al.,we present two types of attack algorithms.The first polynomial time differentiation algorithm can distinguish the probability distribution of simulated signatures and real signatures with a nonnegligible probability,which shows that in the security proof of this scheme,the simulated games and the real games are distinguishable.The second polynomial time algorithm can output a forged signature of the scheme,but the challenger cannot use the forged signature output by the algorithm to solve the associated mathematical problems.Therefore,the security proof of the scheme is seriously flawed.(3)An identity-based signature scheme with revocation for the Internet of things is proposed.In this scheme,the user's signing key in the Internet of Things consists of two parts: the long-term initial private key and the short-term update key.The trusted private key generator is only responsible for generating the user's initial private key,while a semi-trusted cloud revocation server periodically produces the user's updated key.The analysis results show that the scheme not only has an efficient revocation mechanism of users' identity,but also ensure the authenticity of the data verification.In addition,this scheme is superior to the existing similar schemes in computational overhead and communication overhead.
Keywords/Search Tags:Certificateless Signature, Aggregate Signature, Revocable Identity-Based Signature, Coalition Attacks, Cryptanalysis
PDF Full Text Request
Related items