Search

Although many intelligent optimization algorithms have been applied to the multimodal multi-objective optimization problems (MMOPs) which are complex and difficult, challenges of MMOP such as loss of PS in decision space and low efficiency have not been well solved. To better solve these problems, an altruistic population algorithm (APA) which is based on the altruism behavior in some animal populations, is proposed in this paper. The proposed APA has five major operations: parent selection, procreation variation, altruistic nurturing, crowd competition and archive updating. A few important features of the proposed APA are: (1) The nurturing cost according to a pair of parents' condition is introduced. It can accelerate the convergence speed while maintaining the diversity of the Pareto optimal solutions (PS). (2) The application of altruism allows the transfer of nurturing cost between descendant siblings to improve the efficiency and decrease the unnecessary variations. (3) A selection strategy called neighboring selection based on the distance in the objective space is proposed. It is an effective way to delete the redundant individuals in the objective space. The experimental results reveal that APA preforms better than other existing algorithms for solving various MMOPs. • Based on the altruism, a novel meta-heuristic algorithm is proposed. • The nurturing process can balance the convergence speed and diversity of PS. • The application of altruism can improve the efficiency of evolutionary cost. • The proposed selection strategy is an effective way to delete the redundant. [ABSTRACT FROM AUTHOR]

Abstract: In an attribute-based signature (ABS) system, a signature does not give proof of the identity of the individual who signed a message; it instead gives proof to a claim regarding the attributes that the underlying signer owns. For ABS, investigators have found many practical applications that require signer-attribute privacy. However, this approach is inadequate for handling scenarios in which the signing key is exposed due to viruses, worms or other break-ins that are allowed by operating-system holes. To overcome the limitation of existing ABS systems, we introduce the notion of an attribute-based key-insulated signature (ABKIS), in which signing keys are refreshed at discrete time periods via an interaction between the user and the helper (a physically-secure but computationally-limited device). We formalize this security model and propose a concrete ABKIS scheme, which is proven to be secure under the standard computational Diffie–Hellman assumption. Furthermore, as an application, a time-conditioned attribute-based proxy signature (TC-ABPS) is derived from our proposed ABKIS scheme. Another typical application of our scheme is for anonymous provider authentication in a bidirectional broadcasting service. [Copyright &y& Elsevier]