A recent set of overused population-based methods have been published in recent years. Despite their popularity, most of them have uncertain, immature performance, partially done verifications, similar overused metaphors, similar immature exploration and exploitation components and operations, and an insecure tradeoff between exploration and exploitation trends in most of the new real-world cases. Therefore, all users need to extensively modify and adjust their operations based on main evolutionary methods to reach faster convergence, more stable balance, and high-quality results. To move the optimization community one step ahead toward more focus on performance rather than change of metaphor, a general-purpose population-based optimization technique called Hunger Games Search (HGS) is proposed in this research with a simple structure, special stability features and very competitive performance to realize the solutions of both constrained and unconstrained problems more effectively. The proposed HGS is designed according to the hunger-driven activities and behavioural choice of animals. This dynamic, fitness-wise search method follows a simple concept of “Hunger” as the most crucial homeostatic motivation and reason for behaviours, decisions, and actions in the life of all animals to make the process of optimization more understandable and consistent for new users and decision-makers. The Hunger Games Search incorporates the concept of hunger into the feature process; in other words, an adaptive weight based on the concept of hunger is designed and employed to simulate the effect of hunger on each search step. It follows the computationally logical rules (games) utilized by almost all animals and these rival activities and games are often adaptive evolutionary by securing higher chances of survival and food acquisition. This method's main feature is its dynamic nature, simple structure, and high performance in terms of convergence and acceptable quality of solutions, proving to be more efficient than the current optimization methods. The effectiveness of HGS was verified by comparing HGS with a comprehensive set of popular and advanced algorithms on 23 well-known optimization functions and the IEEE CEC 2014 benchmark test suite. Also, the HGS was applied to several engineering problems to demonstrate its applicability. The results validate the effectiveness of the proposed optimizer compared to popular essential optimizers, several advanced variants of the existing methods, and several CEC winners and powerful differential evolution (DE)-based methods abbreviated as LSHADE, SPS_L_SHADE_EIG, LSHADE_cnEpSi, SHADE, SADE, MPEDE, and JDE methods in handling many single-objective problems. We designed this open-source population-based method to be a standard tool for optimization in different areas of artificial intelligence and machine learning with several new exploratory and exploitative features, high performance, and high optimization capacity. The method is very flexible and scalable to be extended to fit more form of optimization cases in both structural aspects and application sides. This paper's source codes, supplementary files, Latex and office source files, sources of plots, a brief version and pseudocode, and an open-source software toolkit for solving optimization problems with Hunger Games Search and online web service for any question, feedback, suggestion, and idea on HGS algorithm will be available to the public at https://aliasgharheidari.com/HGS.html .

Hunger games search: Visions, conception, implementation, deep analysis, perspectives, and towards performance shifts

With the rapid advancement of technology, healthcare systems have been quickly transformed into a pervasive environment, where both challenges and opportunities abound. On the one hand, the proliferation of smart phones and advances in medical sensors and devices have driven the emergence of wireless body area networks for remote patient monitoring, also known as mobile-health (M-health), thereby providing a reliable and cost effective way to improving efficiency and quality of health care. On the other hand, the advances of M-health systems also generate extensive medical data, which could crowd today’s cellular networks. Device-to-device (D2D) communications have been proposed to address this challenge, but unfortunately, security threats are also emerging because of the open nature of D2D communications between medical sensors and highly privacy-sensitive nature of medical data. Even, more disconcerting is healthcare systems that have many characteristics that make them more vulnerable to privacy attacks than in other applications. In this paper, we propose a light-weight and robust security-aware D2D-assist data transmission protocol for M-health systems by using a certificateless generalized signcryption (CLGSC) technique. Specifically, we first propose a new efficient CLGSC scheme, which can adaptively work as one of the three cryptographic primitives: signcryption, signature, or encryption, but within one single algorithm. The scheme is proved to be secure, simultaneously achieving confidentiality and unforgeability. Based on the proposed CLGSC algorithm, we further design a D2D-assist data transmission protocol for M-health systems with security properties, including data confidentiality and integrity, mutual authentication, contextual privacy, anonymity, unlinkability, and forward security. Performance analysis demonstrates that the proposed protocol can achieve the design objectives and outperform existing schemes in terms of computational and communication overhead.

Light-Weight and Robust Security-Aware D2D-Assist Data Transmission Protocol for Mobile-Health Systems

Progression on spectrum sensing for cognitive radio networks: A survey, classification, challenges and future research issues

Hierarchical attribute based encryption with continuous leakage-resilience

We present the currently simplest, most efficient, optimally resilient, adaptively secure, and proactive threshold RSA scheme. A main technical contribution is a new rewinding strategy for analysing threshold signature schemes. This new rewinding strategy allows to prove adaptive security of a proactive threshold signature scheme which was previously assumed to be only statically secure. As a separate contribution we prove that our protocol is secure in the UC framework.

Simplified threshold RSA with adaptive and proactive security

Provably secure and efficient leakage-resilient certificateless signcryption scheme without bilinear pairing

Continuous Leakage-Resilient Identity-Based Encryption without Random Oracles

To achieve security of mobile payments within insecure public communication networks, in 2018, a secure transaction scheme for mobile payments is constructed by Yeh from a certificateless signature (CLS) scheme without bilinear pairing Yeh, (2008). However, we point out that this CLS scheme is insecure, and a malicious users can create a valid forged signature on any new message by performing public key replacement attacks. The security flaws of the underlying CLS scheme cause that the upper transaction scheme cannot keep its claimed security. In this article, we describe how this forgery attack works against the CLS scheme, which demonstrates that Yeh’s scheme cannot achieve its original security. Furthermore, to further solve the above-mentioned security flaws, a concrete construction of CLS scheme with improved security is presented. Our improved scheme can be rigorously proved using Forking lemma in the random oracle model, assuming that solving the discrete logarithm problem is infeasible. Finally, a secure transaction scheme for android-based mobile payments is proposed from our improved CLS scheme.

Improved Secure Transaction Scheme With Certificateless Cryptographic Primitives for IoT-Based Mobile Payments

Continuous Leakage-Resilient Public-Key Encryption Scheme with CCA Security

For a public-key encryption scheme to be applied in practical applications, it should withstand various leakage attacks eg, side-channel attacks and cold-boot attacks To this end, we present a way of construct the more practical CCA2 secure public-key encryption scheme tolerating leakage attacks, and the scheme's security is based on the hardness of classical decisional Diffie-Hellman assumption and the target collision resistant of one-way hash function Additionally, our proposal enjoys better performance, for example, all of elements of ciphertext will be random from the adversary's view, and any probabilistic polynomial-time adversary cannot obtain leakage on the secret key from the ciphertext, and so on In the bounded-leakage setting, for any leakage parameter λ≤logqi?ź-i?źωlogkq is the prime order of the underlying group, and k denotes the security parameter, our proposal is secure against leakage-resilient chosen-ciphertext attacks, where λ is independent of the plaintext space, and has the constant size However, in the real world, an adversary can continuously learn information on the secret key through a variety of leakage attacks and can trivially break the security of public-key encryption scheme under the continual leakage attacks Thus, we will improve our method to resist the continual leakage attacks Similarly, for any round leakage parameter λC≤logqi?ź-i?źωlogk, we can prove the security of the improvement scheme based on the hardness of decisional Diffie-Hellman assuming and the target collision resistant of one-way hash function With this important performance, our proposal may have some significant value in the practical applications, such as our proposal can provide the leakage-resilient security for outsourcing data in the cloud computing environment Copyright © 2016 John Wiley & Sons, Ltd

Yanwei Zhou

Papers

Provably secure and efficient leakage-resilient certificateless signcryption scheme without bilinear pairing

Continuous Leakage-Resilient Identity-Based Encryption without Random Oracles

Improved Secure Transaction Scheme With Certificateless Cryptographic Primitives for IoT-Based Mobile Payments

Continuous Leakage-Resilient Public-Key Encryption Scheme with CCA Security

CCA2 secure public-key encryption scheme tolerating continual leakage attacks