A Secure Three-Factor Authenticated Key Agreement Scheme for Multi-Server Environment

Multi-server authenticated key agreement schemes have attracted great attention to both academia and industry in recent years.However,traditional authenticated key agreement schemes in the single-server environment are not suitable for the multi-server environment because the user has to register on each server when he/she wishes to log in various servers for different service.Moreover,it is unreasonable to consider all servers are trusted since the server in a multi-server environment may be a semi-trusted party.In order to overcome these difficulties,we designed a secure three-factor multi-server authenticated key agreement protocol based on elliptic curve cryptography,which needs the user to register only once at the registration center in order to access all semi-trusted servers.The proposed scheme can not only against various known attacks but also provides high computational efficiency.Besides,we have proved our scheme fulfills mutual authentication by using the authentication test method.

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.

Cryptanalysis of Two Dynamic Identity Based Authentication Schemes for Multi-Server Architecture

Since network services are provided cooperatively by multiple servers in the lnternet, the authentication protocols for multiserver architecture are required by Internetbased services, such as online game, online trade and so on. Recently, Li et al. analyzed Lee et al.＇s protocol and proposed an improved dynamic identity based authentication protocol for multi-server architecture. They claimed that their protocol provides user＇s anonymity, mutual authentication and the session key agreement against several kinds of attacks. In this paper, a cryptanalysis on Lee et al.＇s scheme shows that Lee et al＇s protocol is also vulnerable to malicious server attack, stolen smart card attack and leak-of-verifier attack. Moreover, Li e/ al.＇s improved protocol is also vulnerable to all these attacks. Further cryptanalysis reveals that Li et al.＇s improved protocol is susceptible to collusion attack.

Internet环境下“分布式智能决策支持系统生成器”Browser/Multi-Server结构的研究

针对当前的Internet环境，文章提出了一种新的分布式智能决策支持系统生成器的结构，并着重阐述了IDSSG的这种结构如何在Internet环境下实现。

Efficient Hierarchical Multi-Server Authentication Protocol for Mobile Cloud Computing

With the development of communication technologies,various mobile devices and different types of mobile services became available.The emergence of these services has brought great convenience to our lives.The multi-server architecture authentication protocols for mobile cloud computing were proposed to ensure the security and availability between mobile devices and mobile services.However,most of the protocols did not consider the case of hierarchical authentication.In the existing protocol,when a mobile user once registered at the registration center,he/she can successfully authenticate with all mobile service providers that are registered at the registration center,but real application scenarios are not like this.For some specific scenarios,some mobile service providers want to provide service only for particular users.For this reason,we propose a new hierarchical multi-server authentication protocol for mobile cloud computing.The proposed protocol ensures only particular types of users can successfully authenticate with certain types of mobile service providers.The proposed protocol reduces computing and communication costs by up to 42.6%and 54.2%compared to two superior protocols.The proposed protocol can also resist the attacks known so far.

Weaknesses of a Dynamic ID Based Remote User Authentication Protocol for Multi-Server Environment

Currently, smart card based remote user authentication schemes have been widely adopted due to their low cost and convenient portability. With the purpose of using various different internet services with single registration and to protect the users from being tracked, various dynamic ID based multi-server authentication protocols have been proposed. Recently, Li et al. proposed an efficient and secure dynamic ID based authentication protocol using smart cards. They claimed that their protocol provides strong security. In this paper, we have demonstrated that Li et al.’s protocol is vulnerable to replay attack, denial of service attack, smart card lost attack, eavesdropping attack and server spoofing attacks.

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.

Analysis and Comparison of Slope-cutting Widening Schemes in Highway Reconstruction and Expansion Project Based on MIDAS Software

In this paper,the geological condition of the right-side slope of the K114+694–K115+162 section of Yong-tai-wen Expressway is investigated and analyzed with the results showing that the strength of rock mass is the main contributor to the stability of the slope.Then,two widening schemes are proposed,which are the steep slope with strong support and the gentle slope with general support schemes.The static/slope module of MIDAS GTS finite element analysis software and the strength reduction method were used to compare the two schemes.The results show that the steep slope with a strong support scheme has obvious advantages in land requisition,environmental protection,and safety and is more suitable for reconstructing and expanding the highway slope.

Deployment Dynamic Modeling and Driving Schemes for a Ring-Truss Deployable Antenna

Mesh reflector antennas are widely used in space tasks owing to their light weight,high surface accuracy,and large folding ratio.They are stowed during launch and then fully deployed in orbit to form a mesh reflector that transmits signals.Smooth deployment is essential for duty services;therefore,accurate and efficient dynamic modeling and analysis of the deployment process are essential.One major challenge is depicting time-varying resistance of the cable network and capturing the cable-truss coupling behavior during the deployment process.This paper proposes a general dynamic analysis methodology for cable-truss coupling.Considering the topological diversity and geometric nonlinearity,the cable network's equilibrium equation is derived,and an explicit expression of the time-varying tension of the boundary cables,which provides the main resistance in truss deployment,is obtained.The deployment dynamic model is established,which considers the coupling effect between the soft cables and deployable truss.The effects of the antenna's driving modes and parameters on the dynamic deployment performance were investigated.A scaled prototype was manufactured,and the deployment experiment was conducted to verify the accuracy of the proposed modeling method.The proposed methodology is suitable for general cable antennas with arbitrary topologies and parameters,providing theoretical guidance for the dynamic performance evaluation of antenna driving schemes.

Improvement and security analysis of multi-ring discrete modulation continuous variable quantum secret sharing scheme

In order to avoid the complexity of Gaussian modulation and the problem that the traditional point-to-point communication DM-CVQKD protocol cannot meet the demand for multi-user key sharing at the same time, we propose a multi-ring discrete modulation continuous variable quantum key sharing scheme(MR-DM-CVQSS). In this paper, we primarily compare single-ring and multi-ring M-symbol amplitude and phase-shift keying modulations. We analyze their asymptotic key rates against collective attacks and consider the security key rates under finite-size effects. Leveraging the characteristics of discrete modulation, we improve the quantum secret sharing scheme. Non-dealer participants only require simple phase shifters to complete quantum secret sharing. We also provide the general design of the MR-DM-CVQSS protocol.We conduct a comprehensive analysis of the improved protocol's performance, confirming that the enhancement through multi-ring M-PSK allows for longer-distance quantum key distribution. Additionally, it reduces the deployment complexity of the system, thereby increasing the practical value.

A Non-Parametric Scheme for Identifying Data Characteristic Based on Curve Similarity Matching

For accurately identifying the distribution charac-teristic of Gaussian-like noises in unmanned aerial vehicle(UAV)state estimation,this paper proposes a non-parametric scheme based on curve similarity matching.In the framework of the pro-posed scheme,a Parzen window(kernel density estimation,KDE)method on sliding window technology is applied for roughly esti-mating the sample probability density,a precise data probability density function(PDF)model is constructed with the least square method on K-fold cross validation,and the testing result based on evaluation method is obtained based on some data characteristic analyses of curve shape,abruptness and symmetry.Some com-parison simulations with classical methods and UAV flight exper-iment shows that the proposed scheme has higher recognition accuracy than classical methods for some kinds of Gaussian-like data,which provides better reference for the design of Kalman filter(KF)in complex water environment.

A Neural-network-based Alternative Scheme to Include Nonhydrostatic Processes in an Atmospheric Dynamical Core

Here,a nonhydrostatic alternative scheme(NAS)is proposed for the grey zone where the nonhydrostatic impact on the atmosphere is evident but not large enough to justify the necessity to include an implicit nonhydrostatic solver in an atmospheric dynamical core.The NAS is designed to replace this solver,which can be incorporated into any hydrostatic models so that existing well-developed hydrostatic models can effectively serve for a longer time.Recent advances in machine learning(ML)provide a potential tool for capturing the main complicated nonlinear-nonhydrostatic relationship.In this study,an ML approach called a neural network(NN)was adopted to select leading input features and develop the NAS.The NNs were trained and evaluated with 12-day simulation results of dry baroclinic-wave tests by the Weather Research and Forecasting(WRF)model.The forward time difference of the nonhydrostatic tendency was used as the target variable,and the five selected features were the nonhydrostatic tendency at the last time step,and four hydrostatic variables at the current step including geopotential height,pressure in two different forms,and potential temperature,respectively.Finally,a practical NAS was developed with these features and trained layer by layer at a 20-km horizontal resolution,which can accurately reproduce the temporal variation and vertical distribution of the nonhydrostatic tendency.Corrected by the NN-based NAS,the improved hydrostatic solver at different horizontal resolutions can run stably for at least one month and effectively reduce most of the nonhydrostatic errors in terms of system bias,anomaly root-mean-square error,and the error of the wave spatial pattern,which proves the feasibility and superiority of this scheme.

Verifiable quantum secret sharing scheme based on orthogonal product states

In the domain of quantum cryptography,the implementation of quantum secret sharing stands as a pivotal element.In this paper,we propose a novel verifiable quantum secret sharing protocol using the d-dimensional product state and Lagrange interpolation techniques.This protocol is initiated by the dealer Alice,who initially prepares a quantum product state,selected from a predefined set of orthogonal product states within the C~d■C~d framework.Subsequently,the participants execute unitary operations on this product state to recover the underlying secret.Furthermore,we subject the protocol to a rigorous security analysis,considering both eavesdropping attacks and potential dishonesty from the participants.Finally,we conduct a comparative analysis of our protocol against existing schemes.Our scheme exhibits economies of scale by exclusively employing quantum product states,thereby realizing significant cost-efficiency advantages.In terms of access structure,we adopt a(t, n)-threshold architecture,a strategic choice that augments the protocol's practicality and suitability for diverse applications.Furthermore,our protocol includes a rigorous integrity verification mechanism to ensure the honesty and reliability of the participants throughout the execution of the protocol.

Quantum-Resistant Multi-Feature Attribute-Based Proxy Re-Encryption Scheme for Cloud Services

Cloud-based services have powerful storage functions and can provide accurate computation.However,the question of how to guarantee cloud-based services access control and achieve data sharing security has always been a research highlight.Although the attribute-based proxy re-encryption(ABPRE)schemes based on number theory can solve this problem,it is still difficult to resist quantum attacks and have limited expression capabilities.To address these issues,we present a novel linear secret sharing schemes(LSSS)matrix-based ABPRE scheme with the fine-grained policy on the lattice in the research.Additionally,to detect the activities of illegal proxies,homomorphic signature(HS)technology is introduced to realize the verifiability of re-encryption.Moreover,the non-interactivity,unidirectionality,proxy transparency,multi-use,and anti-quantum attack characteristics of our system are all advantageous.Besides,it can efficiently prevent the loss of processing power brought on by repetitive authorisation and can enable precise and safe data sharing in the cloud.Furthermore,under the standard model,the proposed learning with errors(LWE)-based scheme was proven to be IND-sCPA secure.

A MOVING WATER EQUILIBRIA PRESERVING NONSTAGGERED CENTRAL SCHEME ACHIEVED VIA FLUX GLOBALIZATION FOR THE RIPA MODEL

In this paper,we propose a second-order moving-water equilibria preserving nonstaggered central scheme to solve the Ripa model via flux globalization.To maintain the moving-water steady states,we use the discrete source terms proposed by Britton et al.(J Sci Comput,2020,82(2):Art 30)by incorporating the expression of the source terms as a whole into the flux gradient,which directly avoids the discrete complexity of the source terms in order to maintain the well-balanced properties of the scheme.In addition,since the nonstaggered central scheme requires re-projecting the updated values of the nonstaggered cells onto the staggered cells,we modify the calculation of the global variables by constructing ghost cells and alternating the values of the global variables with the water depths obtained from the solution through the nonlinear relationship between the global flux and the water depth.In order to maintain the second-order accuracy of the scheme on the time scale,we incorporate a new Runge-Kutta type time discretization in the evolution of the numerical solution for the nonstaggered cells.Meanwhile,we introduce the"draining"time step technique to ensure that the water depth is positive and that it satisfies mass conservation.Numerical experiments verify that the scheme is well-balanced,positivity-preserving and robust.

A Practical Regular LDPC Coded Scheme for Physical-Layer Information Security

In this paper,we aim to design a practical low complexity low-density parity-check(LDPC)coded scheme to build a secure open channel and protect information from eavesdropping.To this end,we first propose a punctured LDPC coded scheme,where the information bits in a codeword are punctured and only the parity check bits are transmitted to the receiver.We further propose a notion of check node type distribution and derive multi-edge type extrinsic information transfer functions to estimate the security performance,instead of the well-known weak metric bit error rate.We optimize the check node type distribution in terms of the signal-to-noise ratio(SNR)gap and modify the progressive edge growth algorithm to design finite-length codes.Numerical results show that our proposed scheme can achieve a lower computational complexity and a smaller security gap,compared to the existing scrambling and puncturing schemes.