(Identity-based)dual receiver encryption from lattice-based programmable hash functions with high min-entropy

Dual receiver encryption(DRE)is an important cryptographic primitive introduced by Diament et al.at CCS’04,which allows two independent receivers to decrypt a same ciphertext to obtain the same plaintext.This primitive is quite useful in designing combined public key cryptosystems and denial of service attack-resilient protocols.In this paper,we obtain some results as follows.·Using weak lattice-based programmable hash functions(wLPHF)with high min-entropy(Crypto’16),we give a generic IND-CCA secure DRE construction in the standard model.Furthermore,we get a concrete DRE scheme by instantiating a concrete wLPHF with high min-entropy.·For DRE notion in the identity-based setting,identity-based DRE(IB-DRE),basing on lattice-based programmable hash functions(LPHF)with high min-entropy,we give a framework of IND-ID-CPA secure IB-DRE construction in the standard model.When instantiating with concrete LPHFs with high min-entropy,we obtain five concrete IB-DRE schemes.

(Identity-based)dual receiver encryption from lattice-based programmable hash functions with high min-entropy

Dual receiver encryption(DRE)is an important cryptographic primitive introduced by Diament et al.at CCS’04,which allows two independent receivers to decrypt a same ciphertext to obtain the same plaintext.This primitive is quite useful in designing combined public key cryptosystems and denial of service attack-resilient protocols.In this paper,we obtain some results as follows.·Using weak lattice-based programmable hash functions(wLPHF)with high min-entropy(Crypto’16),we give a generic IND-CCA secure DRE construction in the standard model.Furthermore,we get a concrete DRE scheme by instantiating a concrete wLPHF with high min-entropy.·For DRE notion in the identity-based setting,identity-based DRE(IB-DRE),basing on lattice-based programmable hash functions(LPHF)with high min-entropy,we give a framework of IND-ID-CPA secure IB-DRE construction in the standard model.When instantiating with concrete LPHFs with high min-entropy,we obtain five concrete IB-DRE schemes.

Numeric Identifier Transmission Algorithm Using Hash Function

When developing programs or websites, it is very convenient to use relational databases, which contain powerful and convenient tools that allow to work with data very flexibly and get the necessary information in a matter of milliseconds. A relational database consists of tables and records in these tables, each table must have a primary key, in particular, it can be a number of BIGINT type, which is a unique index of a record in the table, which allows to fetch operation with maximum speed and O (1) complexity. After the operation of writing a row to the table of database, the program receives the row identifier ID in the form of a number, and in the future this ID can be used to obtain this record. In the case of a website, this could be the GET method of the http protocol with the entry ID in the request. But very often it happens that the transmission of an identifier in the clear form is not safe, both for business reasons and for security reasons of access to information. And in this case, it is necessary to create additional functionality for checking access rights and come up with a way to encode data in such a way that it would be impossible to determine the record identifier, and this, in turn, leads to the fact that the program code becomes much more complicated and also increases the amount of data, necessary to ensure the operation of the program. This article presents an algorithm that solves these problems “on the fly” without complicating the application logic and does not require resources to store additional information. Also, this algorithm is very reliable since it is based on the use of hash functions and synthesized as a result of many years of work related to writing complex systems that require an increased level of data security and program performance.

Security analysis of a one-way hash function based on spatiotemporal chaos

The collision and statistical properties of a one-way hash function based on spatiotemporal chaos are investigated. Analysis and simulation results indicate that collisions exist in the original algorithm and, therefore, the original algorithm is insecure and vulnerable. An improved algorithm is proposed to avoid the collisions.

An efficient hash-based authenticated key agreement scheme for multi-server architecture resilient to key compromise impersonation

During the past decade,rapid advances in wireless communication technologies have made it possible for users to access desired services using hand-held devices.Service providers have hosted multiple servers to ensure seamless online services to end-users.To ensure the security of this online communication,researchers have proposed several multi-server authentication schemes incorporating various cryptographic primitives.Due to the low power and computational capacities of mobile devices,the hash-based multi-server authenticated key agreement schemes with offline Registration Server(RS)are the most efficient choice.Recently,Kumar-Om presented such a scheme and proved its security against all renowned attacks.However,we find that their scheme bears an incorrect login phase,and is unsafe to the trace attack,the Session-Specific Temporary Information Attack(SSTIA),and the Key Compromise Impersonation Attack(KCIA).In fact,all of the existing multi-server authentication schemes(hash-based with offline RS)do not withstand KCLA.To deal with this situation,we propose an improved hash-based multi-server authentication scheme(with offline RS).We analyze the security of the proposed scheme under the random oracle model and use the t4Automated Validation of Internet Security Protocols and Applications''(AVISPA)tool.The comparative analysis of communication overhead and computational complexity metrics shows the efficiency of the proposed scheme.

One-way hash function construction based on the spatiotemporal chaotic system

Based on the spatiotemporal chaotic system, a novel algorithm for constructing a one-way hash function is proposed and analysed. The message is divided into fixed length blocks. Each message block is processed by the hash compression function in parallel. The hash compression is constructed based on the spatiotemporal chaos. In each message block, the ASCII code and its position in the whole message block chain constitute the initial conditions and the key of the hash compression function. The final hash value is generated by further compressing the mixed result of all the hash compression vulues. Theoretic analyses and numerical simulations show that the proposed algorithm presents high sensitivity to the message and key, good statistical properties, and strong collision resistance.

One-way hash function based on hyper-chaotic cellular neural network

The design of an efficient one-way hash function with good performance is a hot spot in modern cryptography researches. In this paper, a hash function construction method based on cell neural network with hyper-chaos characteristics is proposed. First, the chaos sequence is gotten by iterating cellular neural network with Runge Kutta algorithm, and then the chaos sequence is iterated with the message. The hash code is obtained through the corre- sponding transform of the latter chaos sequence. Simulation and analysis demonstrate that the new method has the merit of convenience, high sensitivity to initial values, good hash performance, especially the strong stability.

Hash function construction using weighted complex dynamical networks

A novel scheme to construct a hash function based on a weighted complex dynamical network （WCDN） generated from an original message is proposed in this paper. First, the original message is divided into blocks. Then, each block is divided into components, and the nodes and weighted edges are well defined from these components and their relations. Namely, the WCDN closely related to the original message is established. Furthermore, the node dynamics of the WCDN are chosen as a chaotic map. After chaotic iterations, quantization and exclusive-or operations, the fixed-length hash value is obtained. This scheme has the property that any tiny change in message can be diffused rapidly through the WCDN, leading to very different hash values. Analysis and simulation show that the scheme possesses good statistical properties, excellent confusion and diffusion, strong collision resistance and high efficiency.

Constructing a one-way hash function based on the unified chaotic system

A new one-way hash function based on the unified chaotic system is constructed. With different values of a key parameter, the unified chaotic system represents different chaotic systems, based on which the one-way hash function algorithm is constructed with three round operations and an initial vector on an input message. In each round operation, the parameters are processed by three different chaotic systems generated from the unified chaotic system. Feed-forwards are used at the end of each round operation and at the end of each element of the message processing. Meanwhile, in each round operation, parameter-exchanging operations are implemented. Then, the hash value of length 160 bits is obtained from the last six parameters. Simulation and analysis both demonstrate that the algorithm has great flexibility, satisfactory hash performance, weak collision property, and high security.

Message Authentication with a New Quantum Hash Function

To ensure the security during the communication,we often adopt different ways to encrypt the messages to resist various attacks.However,with the computing power improving,the existing encryption and authentication schemes are being faced with big challenges.We take the message authentication as an example into a careful consideration.Then,we proposed a new message authentication scheme with the Advanced Encryption Standard as the encryption function and the new quantum Hash function as the authentication function.Firstly,the Advanced Encryption Standard algorithm is used to encrypt the result of the initial message cascading the corresponding Hash values,which ensures that the initial message can resist eavesdropping attack.Secondly,utilizing the new quantum Hash function with quantum walks can be much more secure than traditional classical Hash functions with keeping the common properties,such as one-wayness,resisting different collisions and easy implementation.Based on these two points,the message authentication scheme can be much more secure than previous ones.Finally,it is a new way to design the message authentication scheme,which provides a new thought for other researchers in the future.Our works will contribute to the study on the new encryption and authentication functions and the combination of quantum computing with traditional cryptology in the future.

Hash function based on the generalized Henon map

A new Hash function based on the generalized Henon map is proposed. We have obtained a binary sequence with excellent pseudo-random characteristics through improving the sequence generated by the generalized Henon map, and use it to construct Hash function. First we divide the message into groups, and then carry out the Xor operation between the ASCII value of each group and the binary sequence, the result can be used as the initial values of the next loop. Repeat the procedure until all the groups have been processed, and the final binary sequence is the Hash value. In the scheme, the initial values of the generalized Henon map are used as the secret key and the messages are mapped to Hash values with a designated length. Simulation results show that the proposed scheme has strong diffusion and confusion capability, good collision resistance, large key space, extreme sensitivity to message and secret key, and it is easy to be realized and extended.

The Vulnerability Analysis of Some Typical Hash-Based RFID Authentication Protocols

The low-cost RFID tags have very limited computing and storage resources and this makes it difficult to completely solve their security and privacy problems. Lightweight authentication is considered as one of the most effective methods to ensure the security in the RFID system. Many light-weight authentication protocols use Hash function and pseudorandom generator to ensure the anonymity and confidential communication of the RFID system. But these protocols do not provide such security as they claimed. By analyzing some typical Hash-based RFID authentication protocols, it is found that they are vulnerable to some common attacks. Many protocols cannot resist tracing attack and de-synchronization attack. Some protocols cannot provide forward security. Gy?z? Gódor and Sándor Imre proposed a Hash-based authentication protocol and they claimed their protocol could resist the well-known attacks. But by constructing some different attack scenarios, their protocol is shown to be vulnerable to tracing attack and de-synchronization attack. Based on the analysis for the Hash-based authentication protocols, some feasible suggestions are proposed to improve the security of the RFID authentication protocols.

Deployment of Hash Function to Enhance Message Integrity in Wireless Body Area Network (WBAN)

Message integrity is found to prove the transfer information of patient in health care monitoring system on the human body in order to collect and communicate the human personal data. Wireless body area network (WBAN) applications are the fast growing technology trend but security and privacy are still largely ignored, since they are hard to achieve given the limited computation and energy resources available at sensor node level. In this paper, we propose simple hash based message authentication and integrity code algorithm for wireless sensor networks. We test the proposed algorithm in MATLAB on path loss model around the human body in two scenarios and compare the result before and after enhancement and show how sensors are connected with each other to prove the message integrity in monitoring health environment.

Tibetan Sorting Method Based on Hash Function

Sorting the Tibetan language quickly and accurately requires first identifying the component elements that make up Tibetan syllables and then sorting by the priority of the component.Based on the study of Tibetan text structure,grammatical rules and syllable structure,we present a structurebased Tibetan syllable recognition method that uses syllable structure instead of grammar.This method avoids complicated Tibetan grammar and recognizes the components of Tibetan syllables simply and quickly.On the basis of identifying the components of Tibetan syllables,a Tibetan syllable sorting algorithm that conforms to the language sorting rules is proposed.The core of the Tibetan syllable sorting algorithm is a hash function.Research has found that the sorting of all legal Tibetan syllables requires eight components of information.The hash function is based on this discovery and can be assigned corresponding weights according to different sorting verify the effectiveness of the Tibetan sorting algorithm,we established an experimental corpus using the Tibetan sorting standard document recognized by the majority of Tibetan users,namely the New Tibetan Orthographic Dictionary.Experiments show that this method produces results completely consistent with standard reference works,with an accuracy of 100%,and with minimal computational time.

A Secure Multi-factor Authentication Protocol for Healthcare Services Using Cloud-based SDN

Cloud-based SDN(Software Defined Network)integration offers new kinds of agility,flexibility,automation,and speed in the network.Enterprises and Cloud providers both leverage the benefits as networks can be configured and optimized based on the application requirement.The integration of cloud and SDN paradigms has played an indispensable role in improving ubiquitous health care services.It has improved the real-time monitoring of patients by medical practitioners.Patients’data get stored at the central server on the cloud from where it is available to medical practitioners in no time.The centralisation of data on the server makes it more vulnerable to malicious attacks and causes a major threat to patients’privacy.In recent days,several schemes have been proposed to ensure the safety of patients’data.But most of the techniques still lack the practical implementation and safety of data.In this paper,a secure multi-factor authentication protocol using a hash function has been proposed.BAN(Body Area Network)logic has been used to formally analyse the proposed scheme and ensure that no unauthenticated user can steal sensitivepatient information.Security Protocol Animator(SPAN)–Automated Validation of Internet Security Protocols and Applications(AVISPA)tool has been used for simulation.The results prove that the proposed scheme ensures secure access to the database in terms of spoofing and identification.Performance comparisons of the proposed scheme with other related historical schemes regarding time complexity,computation cost which accounts to only 423 ms in proposed,and security parameters such as identification and spoofing prove its efficiency.

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.

Cryptographic Based Secure Model on Dataset for Deep Learning Algorithms

Deep learning(DL)algorithms have been widely used in various security applications to enhance the performances of decision-based models.Malicious data added by an attacker can cause several security and privacy problems in the operation of DL models.The two most common active attacks are poisoning and evasion attacks,which can cause various problems,including wrong prediction and misclassification of decision-based models.Therefore,to design an efficient DL model,it is crucial to mitigate these attacks.In this regard,this study proposes a secure neural network(NN)model that provides data security during model training and testing phases.The main idea is to use cryptographic functions,such as hash function(SHA512)and homomorphic encryption(HE)scheme,to provide authenticity,integrity,and confidentiality of data.The performance of the proposed model is evaluated by experiments based on accuracy,precision,attack detection rate(ADR),and computational cost.The results show that the proposed model has achieved an accuracy of 98%,a precision of 0.97,and an ADR of 98%,even for a large number of attacks.Hence,the proposed model can be used to detect attacks and mitigate the attacker motives.The results also show that the computational cost of the proposed model does not increase with model complexity.

Fair quantum blind signatures

We present a new fair blind signature scheme based on the fundamental properties of quantum mechanics. In addition, we analyse the security of this scheme, and show that it is not possible to forge valid blind signatures. Moreover, comparisons between this scheme and public key blind signature schemes are also discussed.

INTEGRAL DISTINGUISHERS OF JH AND GRSTL-512

In December of 2010 NIST selected five SHA-3 finalists-BLAKE,Grstl,JH,Keccak,and Skein to advance to the third (and final) round of the SHA-3 competition.At present most specialists and scholars focus on the design and the attacks on these hash functions.However,it is very significant to study some properties of their primitives and underlying permutations.Because some properties reflect the pseudo-randomness of the structures.Moreover,they help us to find new cryptanalysis for some block cipher structures.In this paper,we analyze the resistance of JH and Grstl-512 against structural properties built on integral distinguishers.And then 31.5 (out of 42) rounds integral distinguishers for JH compression function and 11.5 (out of 14) rounds for Grstl-512 compression function are presented.

Cryptanalysis of fair quantum blind signatures

We investigate the fair quantum blind signature scheme proposed by Wang and Wen [Wang T Y and Wen Q Y 2010 Chin. Phys. B 19 060307], which uses the fundamental properties of quantum mechanics and the availability of a trusted arbitrator. However, in this paper, we find that the protocol cannot satisfy the property of non-forgeability even under the condition that the trusted arbitrator is totally credible. Moreover, a simple feasible suggestion for improving the protocol is proposed.