A NEW THRESHOLD MULTI-PROXY MULTI-SIGNATURE SCHEME

This paper proposes a threshold mult-proxy multi-signature scheme with share verification. In the scheme, a subset of original signers allows a designated group of proxy signers to sign on behalf of the original group. A message m has to be signed by a subset of proxy signers who can represent the proxy group. Then, the proxy signature is sent to the verifier group. A subset of verifiers in the verifier group can also represent the group to authenticate the proxy signature. In other words, some threshold values will be given to indicate the number of persons to represent a group to authorize the signing capability or to sign a message or to verify the proxy signature.

SECURITY ANALYSIS AND IMPROVEMENT OF A NEW THRESHOLD MULTI-PROXY MULTI-SIGNATURE SCHEME

Kang, et al. [Journal of Electronics(China), 23(2006)4] proposed a threshold multi-proxy multi-signature scheme, and claimed the scheme satisfies the security requirements of threshold multi-proxy multi-signature. However, in this paper, two forgery attacks are proposed to show that their schemes have serious security flaws. To overcome theses flaws, an improvement on Kang, et al.’s scheme is proposed.

IMPROVEMENT OF NONREPUDIABLE THRESHOLD MULTI-PROXY THRESHOLD MULTI-SIGNATURE SCHEME WITH SHARED VERIFICATION

In 2005, Bao, et al. [Appl. Math. and Comput., vol.169, No.2, 2005] showed that Tzeng, et al.’s nonrepudiable threshold multi-proxy multi-signature scheme with shared verification was insecure, and proposed an improved scheme with no Share Distribution Center (SDC). This paper shows that Bao, et al.’s scheme suffers from the proxy relationship inversion attack and forgery attack, and pro- poses an improvement of Bao, et al.’s scheme.

Applying two channels to vector space secret sharing based multi-signature scheme

Secret sharing and digital signature is an important research area in information security and has wide applications in such fields as safeguarding and legal use of confidential information, secure multiparty computation and electronic commerce. But up to now, study of signature based on general vector space secret sharing is very weak. Aiming at this drawback, the authors did some research on vector space secret sharing against cheaters, and proposed an efficient but secure vector space secret sharing based multi-signature scheme, which is implemented in two channels. In this scheme, the group signature can be easily produced if an authorized subset of participants pool their secret shadows and it is impossible for them to generate a group signature if an unauthorized subset of participants pool their secret shadows. The validity of the group signature can be verified by means of verification equations. A group signature of authorized subset of participants cannot be impersonated by any other set of partici- pants. Moreover, the suspected forgery can be traced, and the malicious participants can be detected in the scheme. None of several possible attacks can successfully break this scheme.

Efficient and Secure Multi-Signature Scheme Based on Trusted Computing

A new multi-signature scheme was proposed with the extension of the direct anonymous attestation （DAA） protocol supported by trusted computing （TC） technology. Analysis and simulation results show that the signer＇s privacy is well protected with dynamic anonymity, the public key and signatures have length independent of the number of signature members, new signers are allowed to join the signature without modifying the public key, and attacks caused by secret key dumping or leaking can be avoided.

A New ID-Based Proxy Multi-Signature Scheme from Bilinear Pairings

ID-based public key cryptosystem can be a good alternative for certifieate-based public key setting. This paper provides an efficient ID-based proxy multi signature scheme from pairings. In the random oracle model, we prove that our new scheme is secure against existential delegation forgery with the assumption that Hess＇s scheme-1 is existential unforgeable, and that our new scheme is secure against existential proxy multi-signature forgery under the hardness assumption of the computational Diffie-Hellman problem.

A New Sequential Digital Multi-Signature Scheme

The paper proposes a new sequential digital multi-signature scheme based on Knapsack public-key cryptosystem,which is different from the existing scheme.The advantages of this scheme over the existing schemes are that it simplifies the signature generation process and speeds up the signature verification process.What’s more,the scheme reduces the cost of communication and redundancy operation, and improves efficiency,and can avoid cheating by signer efficiently,so the scheme has very broad application prospects.

Provable Security of ID-Based Proxy Multi-Signature Schemes

In the last couple of years, D-based cryptography has got fruitful achievements. Proxy multi-signature allows a designated person, called a proxy signer, to sign on behalf of two or more original signers. In this paper, we present a general security model for ID-based proxy multi-signature （ID-PMS） schemes. Then, we show how to construct a secure ID-PMS scheme from a secure ID-based signature scheme, and prove that the security of the construction can be reduced to the security of the original ID-based signature scheme.

Attack on Digital Multi-Signature Scheme Based on Elliptic Curve Cryptosystem

The concept of multisignature, in which multiple signers can cooperate to sign the same message and any verifier can verify the validity of the multi-signature, was first introduced by Itakura and Nakamura. Several multisignature schemes have been proposed since. Chen et al. proposed a new digital multi-signature scheme based on the elliptic curve cryptosystem recently. In this paper, we show that their scheme is insecure, for it is vulnerable to the so-called active attacks, such as the substitution of a ＂false＂ public key to a ＂true＂ one in a key directory or during transmission. And then the attacker can sign a legal signature which other users have signed and forge a signature himself which can be accepted by the verifier.

Efficient ID-based proxy multi-signature scheme secure in random oracle

Proxy signature schemes enable an entity to del- egate its signing rights to any other party, called proxy signer. As a variant of proxy signature primitive, proxy multi- signature allows a group of original signers to delegate their signing capabilities to a single proxy signer in such a way that the proxy signer can sign a message on behalf of the group of original signers. We propose a concrete ID-based proxy multi-signature scheme from bilinear pairings. The proposed scheme is existential unforgeable against adaptively chosen message and given ID-attack in random oracle model under the computational Diltie-Hellman （CDH） assumption. The fascinating property of new scheme is that the size of a proxy multi-signature is independent of the number of original sign- ers. Furthermore the proposed scheme is simple and com- putationally more efficient than other ID-based proxy multi- signature schemes.

An Energy Trading Method Based on Alliance Blockchain and Multi-Signature

Blockchain,known for its secure encrypted ledger,has garnered attention in financial and data transfer realms,including the field of energy trading.However,the decentralized nature and identity anonymity of user nodes raise uncertainties in energy transactions.The broadcast consensus authentication slows transaction speeds,and frequent single-point transactions in multi-node settings pose key exposure risks without protective measures during user signing.To address these,an alliance blockchain scheme is proposed,reducing the resource-intensive identity verification among nodes.It integrates multi-signature functionality to fortify user resources and transac-tion security.A novel multi-signature process within this framework involves neutral nodes established through central nodes.These neutral nodes participate in multi-signature’s signing and verification,ensuring user identity and transaction content privacy.Reducing interactions among user nodes enhances transaction efficiency by minimizing communication overhead during verification and consensus stages.Rigorous assessments on reliability and operational speed highlight superior security performance,resilient against conventional attack vectors.Simulation shows that compared to traditional solutions,this scheme has advantages in terms of running speed.In conclusion,the alliance blockchain framework introduces a novel approach to tackle blockchain’s limitations in energy transactions.The integrated multi-signature process,involving neutral nodes,significantly enhances security and privacy.The scheme’s efficiency,validated through analytical assessments and simulations,indicates robustness against security threats and improved transactional speeds.This research underscores the potential for improved security and efficiency in blockchain-enabled energy trading systems.

An Improved Proxy Multi-Signature Scheme

Based on the Kim-like's proxy multi-signature scheme, an improved proxymulti-signature scheme is proposed. The new scheme overcomes the two problems in the Kim-like'sproxy multi-signature scheme: (1) Security issue ( every original signer can forge a valid proxymulti-signature for any message); (2) Efficiency issue ( both the size of the proxy multi-signatureand the efficiency of signature checking are dependent on the number of the original signers).

New Lattice-Based Digital Multi-signature Scheme

The traditional digital multi-signature schemes are mostly based on large integer factorization and the discrete logarithm,which cannot be secured in quantum environment.The paper presents a lattice-based multi-signature scheme that can resist the quantum attack using the hardness of average-case short integer solution problem(SIS).Multi-signature includes the simultaneous signature and sequential signature.The paper describes respectively the key generation,multi-signature generation and multi-signature verification of the two types of schemes.Moreover,experimental results prove that the digital multi-signature scheme based on lattice is especially efficient and secure to multi-signature generation.

Quantum homomorphic broadcast multi-signature based on homomorphic aggregation

Quantum multi-signature has attracted extensive attention since it was put forward.Beside its own improvement,related research is often combined with other quantum signature.However,this type of quantum signature has one thing in common,that is,the generation and verification of signature depend heavily on the shared classical secret key.In order to increase the reliability of signature,the homomorphic aggregation technique is applied to quantum multi-signature,and then we propose a quantum homomorphic multi-signature protocol.Unlike previous quantum multi-signature protocols,this protocol utilizes homomorphic properties to complete signature generation and verification.In the signature generation phase,entanglement swapping is introduced,so that the individual signatures of multiple users are aggregated into a new multi-signature.The original quantum state is signed by the shared secret key to realize the verification of the signature in the verification phase.The signature process satisfies the homomorphic property,which can improve the reliability of the signature.

Identity-based proxy multi-signature applicable to secure E-transaction delegations

To enhance the robustness of a proxy multi-signature scheme and improve its efficiency, a novel proxy signature paradigm is proposed referred to as In this paradigm, multiple proxy signer candidates identity-based proxy multi-signature （IBPMS）. are employed to play a role of the single proxy signer in the existing model. A provably secure IBPMS scheme is presented which requires only one round broadcast operation. Performance analysis demonstrates that the new scheme outperforms the existing multi-signature schemes in robustness and communication. These properties are rendered to our IBPMS scheme as a more practical solution to secure e-transaction delegation applications of proxy signatures.

Construction of a Computational Scheme for the Fuzzy HIV/AIDS Epidemic Model with a Nonlinear Saturated Incidence Rate

This work aimed to construct an epidemic model with fuzzy parameters.Since the classical epidemic model doesnot elaborate on the successful interaction of susceptible and infective people,the constructed fuzzy epidemicmodel discusses the more detailed versions of the interactions between infective and susceptible people.Thenext-generation matrix approach is employed to find the reproduction number of a deterministic model.Thesensitivity analysis and local stability analysis of the systemare also provided.For solving the fuzzy epidemic model,a numerical scheme is constructed which consists of three time levels.The numerical scheme has an advantage overthe existing forward Euler scheme for determining the conditions of getting the positive solution.The establishedscheme also has an advantage over existing non-standard finite difference methods in terms of order of accuracy.The stability of the scheme for the considered fuzzy model is also provided.From the plotted results,it can beobserved that susceptible people decay by rising interaction parameters.

On the Use of Monotonicity-Preserving Interpolatory Techniques in Multilevel Schemes for Balance Laws

Cost-effective multilevel techniques for homogeneous hyperbolic conservation laws are very successful in reducing the computational cost associated to high resolution shock capturing numerical schemes.Because they do not involve any special data structure,and do not induce savings in memory requirements,they are easily implemented on existing codes and are recommended for 1D and 2D simulations when intensive testing is required.The multilevel technique can also be applied to balance laws,but in this case,numerical errors may be induced by the technique.We present a series of numerical tests that point out that the use of monotonicity-preserving interpolatory techniques eliminates the numerical errors observed when using the usual 4-point centered Lagrange interpolation,and leads to a more robust multilevel code for balance laws,while maintaining the efficiency rates observed forhyperbolic conservation laws.

An Arbitrarily High Order and Asymptotic Preserving Kinetic Scheme in Compressible Fluid Dynamic

We present a class of arbitrarily high order fully explicit kinetic numerical methods in compressible fluid dynamics,both in time and space,which include the relaxation schemes by Jin and Xin.These methods can use the CFL number larger or equal to unity on regular Cartesian meshes for the multi-dimensional case.These kinetic models depend on a small parameter that can be seen as a"Knudsen"number.The method is asymptotic preserving in this Knudsen number.Also,the computational costs of the method are of the same order of a fully explicit scheme.This work is the extension of Abgrall et al.(2022)[3]to multidimensional systems.We have assessed our method on several problems for two-dimensional scalar problems and Euler equations and the scheme has proven to be robust and to achieve the theoretically predicted high order of accuracy on smooth solutions.

S-scheme heterojunction with ultrafast interfacial electron transfer for artificial photosynthesis

The rapid development of the global economy has led to the over-exploitation and burning of fossil fuels,causing a severe energy crisis and continuous CO_(2) emissions.Although solar energy is a clean and renewable resource,it faces significant diurnal and seasonal variations and is difficult to store[1-4].Converting solar energy into storable chemical energy through photocatalysis is an effective way to address both energy scarcity and environmental issues.Photocatalytic CO_(2) reduction,with the development of high-efficiency photocatalysts as the key,offers a clean and environmentally friendly method to convert CO_(2) into valuable hydrocarbon fuels,providing a viable solution to the global energy crisis and climate change[5,6].

Orbit Weighting Scheme in the Context of Vector Space Information Retrieval

This study introduces the Orbit Weighting Scheme(OWS),a novel approach aimed at enhancing the precision and efficiency of Vector Space information retrieval(IR)models,which have traditionally relied on weighting schemes like tf-idf and BM25.These conventional methods often struggle with accurately capturing document relevance,leading to inefficiencies in both retrieval performance and index size management.OWS proposes a dynamic weighting mechanism that evaluates the significance of terms based on their orbital position within the vector space,emphasizing term relationships and distribution patterns overlooked by existing models.Our research focuses on evaluating OWS’s impact on model accuracy using Information Retrieval metrics like Recall,Precision,InterpolatedAverage Precision(IAP),andMeanAverage Precision(MAP).Additionally,we assessOWS’s effectiveness in reducing the inverted index size,crucial for model efficiency.We compare OWS-based retrieval models against others using different schemes,including tf-idf variations and BM25Delta.Results reveal OWS’s superiority,achieving a 54%Recall and 81%MAP,and a notable 38%reduction in the inverted index size.This highlights OWS’s potential in optimizing retrieval processes and underscores the need for further research in this underrepresented area to fully leverage OWS’s capabilities in information retrieval methodologies.