An Identity-Based Scheme of Fair Exchange of Digital Signatures

Fair exchange of digital signatures is an important tool for signing digital contracts, e-payment and other electronic commerce actions. An ID-based scheme of fair exchange of digital signature is proposed in this paper. The protocol relies on a trusted third party, but is ＂optimistic＂, in that the third party is only needed in cases where one player attempts to cheat or simply crashes. The proposed scheme has properties of short signature, low computation and verification cost. It can realize exchange of digital signatures fairly and effic, iently. A key feature of our scheme is that it is identity-based, which needs no certificates and has a simple key management. To our best knowledge, this is the first identity based scheme of fair exchange of digital signatures.

A Secure Hardware Implementation for Elliptic Curve Digital Signature Algorithm

Since the end of the 1990s,cryptosystems implemented on smart cards have had to deal with two main categories of attacks:side-channel attacks and fault injection attacks.Countermeasures have been developed and validated against these two types of attacks,taking into account a well-defined attacker model.This work focuses on small vulnerabilities and countermeasures related to the Elliptic Curve Digital Signature Algorithm(ECDSA)algorithm.The work done in this paper focuses on protecting the ECDSA algorithm against fault-injection attacks.More precisely,we are interested in the countermeasures of scalar multiplication in the body of the elliptic curves to protect against attacks concerning only a few bits of secret may be sufficient to recover the private key.ECDSA can be implemented in different ways,in software or via dedicated hardware or a mix of both.Many different architectures are therefore possible to implement an ECDSA-based system.For this reason,this work focuses mainly on the hardware implementation of the digital signature ECDSA.In addition,the proposed ECDSA architecture with and without fault detection for the scalar multiplication have been implemented on Xilinxfield programmable gate arrays(FPGA)platform(Virtex-5).Our implementation results have been compared and discussed.Our area,frequency,area overhead and frequency degradation have been compared and it is shown that the proposed architecture of ECDSA with fault detection for the scalar multiplication allows a trade-off between the hardware overhead and the security of the ECDSA.

An Efficient and Provably Secure SM2 Key-Insulated Signature Scheme for Industrial Internet of Things

With the continuous expansion of the Industrial Internet of Things(IIoT),more andmore organisations are placing large amounts of data in the cloud to reduce overheads.However,the channel between cloud servers and smart equipment is not trustworthy,so the issue of data authenticity needs to be addressed.The SM2 digital signature algorithm can provide an authentication mechanism for data to solve such problems.Unfortunately,it still suffers from the problem of key exposure.In order to address this concern,this study first introduces a key-insulated scheme,SM2-KI-SIGN,based on the SM2 algorithm.This scheme boasts strong key insulation and secure keyupdates.Our scheme uses the elliptic curve algorithm,which is not only more efficient but also more suitable for IIoT-cloud environments.Finally,the security proof of SM2-KI-SIGN is given under the Elliptic Curve Discrete Logarithm(ECDL)assumption in the random oracle.

Digital Signature Based on ISRSAC

Digital signature has recently played an increasingly important role in cyberspace security.Most of them are based on the public key cryptography.Public key cryptography is a mainstream cryptographic algorithm system that has been widely used in cyberspace security in recent years.The most classic public key cryptography algorithm is RSA and its difficulty is based on the large integer decomposition problem.In 2017,ISRSAC was proposed by M.Thangaval.ISRSAC has made security improvements to the RSA algorithm by increasing the complexity in factoring the value of modulus‘n’.A digital signature algorithm based on ISRSAC algorithm was completed in this paper,and furthermore,a proxy signature algorithm based on ISRSAC and two kinds of multi-signature algorithms were presented,which include sequential multi-signature and broadcasting multi-signature.

Digital Multi-Signature Based on the Controlled Quantum Teleportation

In this paper, a scheme which can be used in multi-user quantum digital signature is proposed. The scheme of signature and verification is based on the characters of GHZ （Greenberger-Horne-Zeilinger） states and controlled quantum teleportation. Different from the digital signatures based on computational complexity, this scheme is unconditional secure, and compared to the former presented quantum signature scheme, it does not rely on an arbitrator to verify the signature and realize a message can be signed by multi-user together.

Digital signature systems based on smart card and fingerprint feature

Two signature systems based on smart cards and fingerprint features are proposed. In one signature system, the cryptographic key is stored in the smart card and is only accessible when the signer＇s extracted fingerprint features match his stored template. To resist being tampered on public channel, the user＇s message and the signed message are encrypted by the signer＇s public key and the user＇s public key, respectively. In the other signature system, the keys are generated by combining the signer＇s fingerprint features, check bits, and a rememberable key, and there are no matching process and keys stored on the smart card. Additionally, there is generally more than one public key in this system, that is, there exist some pseudo public keys except a real one.

Merkle Tree Digital Signature and Trusted Computing Platform

Lack of efficiency in the initial key generation process is a serious shortcoming of Merkle tree signature scheme with a large number of possible signatures. Based on two kinds of Merkle trees, a new tree type signature scheme is constructed, and it is provably existentially unforgeable under adaptive chosen message attack. By decentralizing the initial key generation process of the original scheme within the signature process, a large Merkle tree with 6.87×10^10 possible signatures can be initialized in 590 milliseconds. Storing some small Merkle trees in hard disk and memory can speed up Merkle tree signature scheme. Mekle tree signature schemes are fit for trusted computing platform in most scenarios.

Provably Secure Convertible Directed Partially Blind Signatures

Combining the concept of partially blind signature with the concept of directed signature, we introduce a new concept of convertible directed partially blind signature （CDPBS）, in which only the signer and the user can verify, confirm and disavow the validity of given signatures and convert given signatures into universally verifiable ones, to meet the need of signing personally or commercially sensitive messages. We give a formal definition of CDPBS and propose a concrete provably secure CDPBS scheme. The proposed scheme is efficient and secure, in which its unforgeability is the same as that of the Schnorr＇s signature scheme and its untransferability relies on the hardness of the decisional Diffie-Hellman problem. Furthermore, by letting the user＇s private key be a common constant, the proposed scheme can be used as a normal partially blind signature scheme.

DESIGN OF A DIGITAL SIGNATURE SCHEME BASED ON FACTORING AND DISCRETE LOGARITHMS

Objective Focusing on the s ecurity problem of authentication and confidentiality in the context of computer networks, a digital signature scheme was proposed based on the public key crypt osystem. Methods Firstly, the course of digital signature based on the public key cryptosystem was given. Then, RSA and ELGamal schemes were de scribed respectively. They were the basis of the proposed scheme. Generalized EL Gamal type signature schemes were listed. After comparing with each other, one s cheme, whose Signature equation was (m+r)x=j+s modΦ(p) , was adopted in the des igning. Results Based on two well-known cryptographic assumpti ons, the factorization and the discrete logarithms, a digital signature scheme w as presented. It must be required that s' was not equal to p'q' in the signing p rocedure, because attackers could forge the signatures with high probabilities i f the discrete logarithms modulo a large prime were solvable. The variable publi c key “e” is used instead of the invariable parameter “3” in Harn's signatu re scheme to enhance the security. One generalized ELGamal type scheme made the proposed scheme escape one multiplicative inverse operation in the signing proce dure and one modular exponentiation in the verification procedure. Concl usion The presented scheme obtains the security that Harn's scheme was originally claimed. It is secure if the factorization and the discrete logarithm s are simultaneously unsolvable.

A New Digital Multilevel Proxy Signature Scheme Based on Elliptic Curve Cryptography

Based on the analysis of elliptic curve digital signature algorithm（ECDSA）,aiming at multilevel proxy signature in which the original signer delegates the digital signature authority to several proxies and its security demands, a new multilevel proxy signature scheme based on elliptic curve discrete logarithm problem （ECDLP） is presented and its security are proved.

Two Improved Digital Signature Schemes

In this paper, two improved digital signature schemes are presented based on the design of directed signature scheme. The peculiarity of the system is that only if the scheme is specific recipient, the signature is authenticated. Since the scheme adds the screen of some information parameters, the difficulty of deciphered keys and the security of digital signature system are increased.

Near-infrared leaf reflectance modeling of Annona emarginata seedlings for early detection of variations in nitrogen concentration

Nitrogen(N)monitoring is essential in nurseries to ensure the production of high-quality seedlings.Nearinfrared spectroscopy(NIRS)is an instantaneous,nondestructive method to monitor N.Spectral data such as NIRS can also provide the basis for developing a new vegetation spectral index(VSI).Here,we evaluated whether NIRS combined with statistical modeling can accurately detect early variations in N concentration in leaves of young plants of Annona emargiaata and developed a new VSI for this task.Plants were grown in a hydroponics system with 0,2.75,5.5or 11 mM N for 45 days.Then we measured gas exchange,chlorophylla fluorescence,and pigments in leaves;analyzed complete leaf nutrients,and recorded spectral data for leaves at 966 to 1685 nm using NIRS.With a statistical learning approach,the dimensionality of the spectral data was reduced,then models were generated using two classes(N deficiency,N)or four classes(0,2.75,5.5,11 mM N).The best combination of techniques for dimensionality reduction and classification,respectively,was stepwise regression(PROC STEPDISC)and linear discriminant function.It was possible to detect N deficiency in seedlings leaves with 100%precision,and the four N concentrations with93.55%accuracy before photosynthetic damage to the plant occurred.Thereby,NIRS combined with statistical modeling of multidimensional data is effective for detecting N variations in seedlings leaves of A.emarginata.

Blockchain Mobile Wallet with Secure Offline Transactions

There has been an increase in the adoption of mobile payment systems worldwide in the past few years.However,poor Internet connection in rural regions continues to be an obstacle to the widespread use of such technologies.On top of that,there are significant problems with the currently available offline wallets;for instance,the payee cannot verify the number of coins received without access to the Internet.Additionally,it has been demonstrated that some existing systems are susceptible to false token generation,and some do not even permit the user to divide the offline token into smaller portions to be used as change.This paper proposes a blockchainbased wallet system that provides a secure mobile payment service even if a user cannot access a reliable Internet connection.Our approach relies on Bluetooth and digital signatures to establish and build a trust connection between the parties.The proposed solution overcomes the main limitations of existing systems that use offline transactions,such as the generation of fake offline tokens and the indivisibility of offline tokens.The user buys Offline Tokens(OTs)from a server called an Offline Token Manager(OTM)to use them later to perform offline transactions.Each mobile device must store a single,signed offline token transaction to prevent fake tokens.On the other hand,all offline transactions will be kept as a history in a particular local database.Finally,when the receiver becomes online,it will send a convert request to the OTMto change the value of the OTs to the appropriate amount in real coins.This step requires a connection to the Internet.To evaluate the effectiveness of the system,the Solidity programming language was used to develop a smart contract on the Ethereum blockchain with a backend application programming interface(API)and an android mobile application.The proposed method has an advantage over other prominent wallets.

Hybrid Dynamic Optimization for Multilevel Security System in Disseminating Confidential Information

Security systems are the need of the hour to protect data from unauthorized access.The dissemination of confidential information over the public network requires a high level of security.The security approach such as steganography ensures confidentiality,authentication,integrity,and non-repudiation.Steganography helps in hiding the secret data inside the cover media so that the attacker can be confused during the transmission process of secret data between sender and receiver.Therefore,we present an efficient hybrid security model that provides multifold security assurance.To this end,a rectified Advanced Encryption Standard(AES)algorithm is proposed to overcome the problems existing in AES such as pattern appearance and high computations.The modified AES is used for the encryption of the stego image that contains the digitally signed encrypted secret data.The enciphering and deciphering of the secret data are done using the Rivest–Shamir–Adleman(RSA)algorithm.The experiments are conducted on the images of the USC-SIPI standard image database.The experimental results prove that the proposed hybrid system outperforms other SOTA(state-of-the-art)approaches.

Quantum-Enhanced Blockchain: A Secure and Practical Blockchain Scheme

The rapid advancement of quantum technology poses significant security risks to blockchain systems.However,quantum technology can also provide solutions for enhancing blockchain security.In this paper,we propose a quantum-enhanced blockchain scheme to achieve a high level of security against quantum computing attacks.We first discuss quantum computing attacks on classic blockchains,including attacks on hash functions,digital signatures,and consensus mechanisms.We then introduce quantum technologies,such as a quantum hash function(QHF),a quantum digital signature(QDS),and proof of authority(PoA)consensus mechanism,into our scheme to improve the security of the blockchain system.Our security analysis demonstrates that our scheme offers superior security against quantum and classic attacks.Finally,we compare our scheme with previous works,showing that our scheme has achieved a perfect balance in terms of practicality,reliability,scalability,and efficiency.Overall,this work contributes to the ongoing research on quantum blockchain in the quantum era.

A Secured Message Transmission Protocol for Vehicular Ad Hoc Networks

Vehicular Ad hoc Networks(VANETs)become a very crucial addition in the Intelligent Transportation System(ITS).It is challenging for a VANET system to provide security services and parallelly maintain high throughput by utilizing limited resources.To overcome these challenges,we propose a blockchain-based Secured Cluster-based MAC(SCB-MAC)protocol.The nearby vehicles heading towards the same direction will form a cluster and each of the clusters has its blockchain to store and distribute the safety messages.The message which contains emergency information and requires Strict Delay Requirement(SDR)for transmission are called safety messages(SM).Cluster Members(CMs)sign SMs with their private keys while sending them to the blockchain to confirm authentication,integrity,and confidentiality of the message.A Certificate Authority(CA)is responsible for physical verification,key generation,and privacy preservation of the vehicles.We implemented a test scenario as proof of concept and tested the safety message transmission(SMT)protocol in a real-world platform.Computational and storage overhead analysis shows that the proposed protocol for SMT implements security,authentication,integrity,robustness,non-repudiation,etc.while maintaining the SDR.Messages that are less important compared to the SMs are called non-safety messages(NSM)and vehicles use RTS/CTS mechanism for NSM transmission.Numerical studies show that the proposed NSM transmission method maintains 6 times more throughput,2 times less delay and 125%less Packet Dropping Rate(PDR)than traditional MAC protocols.These results prove that the proposed protocol outperforms the traditional MAC protocols.

Data Security Storage Model of the Internet of Things Based on Blockchain

With the development of information technology,the Internet of Things(IoT)has gradually become the third wave of the worldwide information industry revolution after the computer and the Internet.The application of the IoT has brought great convenience to people’s production and life.However,the potential information security problems in various IoT applications are gradually exposed and people pay more attention to them.The traditional centralized data storage and management model of the IoT is easy to cause transmission delay,single point of failure,privacy disclosure and other problems,and eventually leads to unpredictable behavior of the system.Blockchain technology can effectively improve the operation and data security status of the IoT.Referring to the storage model of the Fabric blockchain project,this paper designs a data security storage model suitable for the IoT system.The simulation results show that the model is not only effective and extensible,but also can better protect the data security of the Internet of Things.

Human-Centered A.I. and Security Primitives

The paper reviews how human-centered artificial intelligence and securityprimitive have influenced life in the modern world and how it’s useful inthe future. Human-centered A.I. has enhanced our capabilities by the wayof intelligence, human informed technology. It has created a technologythat has made machines and computer intelligently carry their function.The security primitive has enhanced the safety of the data and increasedaccessibility of data from anywhere regardless of the password is known.This has improved personalized customer activities and filled the gapbetween the human-machine. This has been successful due to the usageof heuristics which solve belowems by experimental, support vector machinewhich evaluates and group the data, natural language processingsystems which change speech to language. The results of this will lead toimage recognition, games, speech recognition, translation, and answeringquestions. In conclusion, human-centered A.I. and security primitivesis an advanced mode of technology that uses statistical mathematicalmodels that provides tools to perform certain work. The results keep onadvancing and spreading with years and it will be common in our lives.

Robust Threshold Guillou-Quisquater Signature Scheme

The deficiencies of the first threshold Guilbu-Quisquater signature schemepresented by Li-San Liu, Cheng-Kang Chu and Wen-Guey Tzeng arc analysiscd at first, and then a newthreshold Guillou-Quisquater signature scheme is presented. The new scheme isunforgeable and robustagainst any adaptive adversary if the base Guillou-Quisquater signature scheme is unforgeable underthe chosen message attack and computing the discrete logarithm modulo a prime is hard This schemecan also achieve optimal resilience. However, the new scheme does not need the assumption that N isthe product of two safe primes. The basie signature scheme underlying the new scheme is exactlyGuillou-Quisqualtr signature scheme, and the additional strong computation assumption introduced bythe first threshold Guillou-Quisquater scheme is weaken.

A New ID-Based Proxy Blind Signature Scheme

An identity-based proxy blind signature scheme from bilinear pairings isintroduced, which combines the advantages of proxy signature and blind signature. Furthermore, ourscheme can prevent the original signer from generating the proxy blind signature, thus the profitsof the proxy signer are guaranteed. We introduce bilinear pairings to minimize computationaloverhead and to improve the related performance of our scheme. In addition, the proxy blindsignature presented is non-repudiable and it fulfills perfectly the security requirements of a proxyblind signature.