互联网个人敏感信息保护研究

个人敏感信息目前成为很多不法分子的目标,存在不容乐观的安全风险,若缺少信息安全防护策略和技术上的支撑,会造成个人敏感信息泄露。文章根据互联网个人敏感信息保护安全现状,分析了互联网存在的个人敏感信息泄露问题,从互联网内部安全和外部安全方面探讨互联网个人敏感信息防护措施,维护互联网个人敏感信息安全。     

信息栅格网络安全技术综述

详细介绍了信息栅格的基本概念、功能模型和体系结构,以信息栅格网络所要解决的安全问题为切入点,从信息栅格安全需求、安全模型、安全关键技术等方面阐述了信息栅格网络的主要安全技术及其发展情况。最后指出信息栅格网络安全技术面临的一些问题和未来研究方向。     

软件测试中的信息安全问题

软件测试的整个生命周期,存在软件信息和相关文件交互、传输的安全风险,若缺少信息安全防护策略和技术上的支撑,会造成源代码等软件重要信息泄露,对软件安全造成威胁.文章根据软件测试过程的要求,分析了软件测试可能存在的安全威胁,提出了测试过程中的信息安全保护方法,确保软件测试安全.     

探究管控校园网信息安全

保障校园网安全是学校信息工作的重点和关键点,随着日常不断深入的信息安全管理与监控工作推进,可构建出适用于学校信息网络系统的安全策略,并采取有效措施解决其安全问题,提升了网络运行水平,为校园网信息数据保护提供了达到安全要求和建设目标的安全措施。     

基于HIS系统的医院信息网络安全管理

从医院实际出发,结合医院信息系统应用,在物理设备安全、软件系统安全、网络信息安全以及医院信息管理制度等方面,论述了医院信息系统网络信息安全管理思路和方法。     

探讨计算机网络技术的计算机网络信息安全及其防护措施

对于探讨计算机网络技术的计算机网络信息安全及其防护措施,首先分析计算机网络信息安全防护存在的问题,然后分析计算机网络技术的计算机网络信息安全和防护措施,包括:加强计算机网络信息防护意识、重视对计算机网络信息的监管、计算机网络安装安全信息防护软件、计算机网络信息备份和还原,最后通过对计算机网络措施,从而促进计算机网络信息技术能够安全的使用。     

关键信息基础设施安全国家标准进展

<正>2021年9月1日,《关键信息基础设施安全保护条例》（以下简称“《条例》”）正式实施。《条例》明确了关键信息基础设施的范围、职责分工以及保障关键信息基础设施安全的技术和管理要求,推动了我国关键信息基础设施安全保障体系的建设。同时,《条例》也明确要求国家制定和完善关键信息基础设施安全标准,指导、规范关键信息基础设施安全保护工作。     

信息安全保障事关国家安全战略--国务院信息办网络与信息安全组副组长吕诚昭答本刊记者问

现在,网络空间已经成为国家和社会的神经系统与控制系统,保护网络空间安全是捍卫国家安全的重要组成部分。《关于加强信息安全保障工作的意见》明确了国家、企业、个人在加强信息安全保障工作中的责任和义务,为信息安全建设规划、信息安全产业发展和信息安全学术研究指明了前进的方向。《关于加强信息安全保障工作的意见》是号召我国各行业加强信息安全保障工作的动员令,是如何推进信息安全保障工作的指南针。为此,我们将陆续报道安全业界学习贯彻信息安全保障工作会议精神的情况。     

基于信息融合的安全审计系统

网络安全审计是确保网络安全的重要防护方法,而信息融合是一种有效的信息处理和分析技术.文中介绍了信息融合的概念和功能模型,以及安全审计系统的组成和功能.由于网络安全审计系统需要处理大量的日志信息,笔者针对现有审计系统的不足,提出在安全审计系统中采用信息融合技术.采用信息融合技术的安全审计系统能够提高对日志信息的综合处理能力,准确地分析出系统的安全状况和发展趋势.     

电子政务安全保障体系技术框架

一、电子政务信息安全保障体系 1.电子政务信息安全保障休系是国家安全保障体系的基本核心部分。 2.要加快电子政务信息安全立法,这样才能做到有法可依,有法必依; 3.要建立电子政务信息安全组织管理体系,建立高效能的、职责分工明确的行政管理和业务组织体系;     

(Full) Leakage resilience of Fiat-Shamir signatures over lattices

Fiat-Shamir is a mainstream construction paradigm of lattice-based signature schemes. While its theoretical security is well-studied, its implementation security in the presence of leakage is a relatively under-explored topic. Specifically, even some side-channel attacks on lattice-based Fiat-Shamir signature (FS-Sig) schemes have been proposed since 2016, little work on the leakage resilience of these schemes appears. Worse still, the proof idea of the leakage resilience of FS-Sig schemes based on traditional number-theoretic assumptions does not apply to most lattice-based FS-Sig schemes. For this, we propose a framework to construct fully leakage resilient lattice-based FS-Sig schemes in the bounded memory leakage (BML) model. The framework consists of two parts. The first part shows how to construct leakage resilient FS-Sig schemes in BML model from leakage resilient versions of non-lossy or lossy identification schemes, which can be instantiated based on lattice assumptions. The second part shows how to construct fully leakage resilient FS-Sig schemes based on leakage resilient ones together with a new property called state reconstruction. We show almost all lattice-based FS-Sig schemes have this property. As a concrete application of our fundamental framework, we apply it to existing lattice-based FS-Sig schemes and provide analysis results of their security in the leakage setting.     

代理多重签名

在代理签名方案中,代理签名人可以代表原始签名人生成签名,然而,在已知的各种代理签名方案中,代理签名人生成的每个代理签名都只代表一个原始签名人。有些情形需要一个代理签名能够同时代表多个原始签名人,而已知的代理签名都不能满足这个需要,给出了一类称为代理多重签名的新代理签名方案。在这种新方案中,一个代理签名人可以同时代表多个原始签名人在文件上签名。     

One- and Two-dimensional bicompact schemes in layered media

A new type of difference schemes, i.e., the so-called bicompact schemes, is addressed. Writing such schemes in partial differential equations is reduced to equivalent systems of ordinary differential equations. Spatial derivatives are approximated on a two-point stencil, i.e., within a single grid step. In layered media, in introducing special grids, on which all break points of coefficients are grid nodes, bicompact schemes keep their approximation. Two schemes of the Kochi problem solution for the one-dimensional heat conductivity equation are examined in detail and schemes for two-dimensional problems on arbitrary grids are given.     

Numerical Anisotropy Study of a Class of Compact Schemes

We study the numerical anisotropy existent in compact difference schemes as applied to hyperbolic partial differential equations, and propose an approach to reduce this error and to improve the stability restrictions based on a previous analysis applied to explicit schemes. A prefactorization of compact schemes is applied to avoid the inversion of a large matrix when calculating the derivatives at the next time level, and a predictor–corrector time marching scheme is used to update the solution in time. A reduction of the isotropy error is attained for large wave numbers and, most notably, the stability restrictions associated with MacCormack time marching schemes are considerably improved. Compared to conventional compact schemes of similar order of accuracy, the multidimensional schemes employ larger stencils which would presumably demand more processing time, but we show that the new stability restrictions render the multidimensional schemes to be in fact more efficient, while maintaining the same dispersion and dissipation characteristics of the one dimensional schemes     

A Stability Criterion for Semi-Discrete Difference Schemes of Hyperbolic Conservation Laws on Uniform Grids

In the present study, the stability condition for semi-discrete difference schemes of hyperbolic conservation laws obtained from Fourier analysis is simplified. This stability condition can be applied only to linear difference schemes with constant coefficients implemented with periodic boundary treatment. It could often give useful results for other cases, such as schemes with variable coefficients, schemes for nonperiodic problem and nonlinear problem. However, this condition usually leads to a trigonometric inequality, which makes it not convenient to use. For explicit difference schemes on uniform grids, this trigonometric inequality can be converted to polynomial form. Furthermore, if the scheme is a high-order one, the polynomial can be factorized into a simple form. Thus, it is much easier to solve than the inequality obtained directly from Fourier analysis. For compact difference schemes and conservative schemes, similar results are obtained. Some applications of this new stability criterion are shown, including judging the stability of two schemes, proving the upstream central schemes to be stable, constructing a stable upwind dissipation relation preserving (DRP) scheme and constructing an optimized weighted essentially non-oscillatory (WENO) scheme. Since WENO schemes are nonlinear schemes, the stability analysis in the present study is performed on their underlying linear schemes. According to the numerical tests, the underlying linear scheme should be stable, otherwise the corresponding WENO scheme may display instability. These applications demonstrate that this criterion is convenient and efficient for judging the linear stability of semi-discrete difference schemes and constructing stable upwind difference schemes.     

On the convergence of compact difference schemes

Difference schemes that are compact in space, i.e., schemes constructed on a two- or three-point stencil in each spatial direction, are more efficient and convenient for boundary condition formulation than other high-order accurate schemes. Originally, these schemes were developed primarily to obtain smooth solutions. In the last two decades, compact schemes have been actively used to compute gas dynamic flows with shock waves. However, when a numerical solution with guaranteed accuracy is desired, the actual properties of difference schemes have to be known in the calculation of solutions with discontinuities. For some widely used compact schemes, this issue has not yet been well studied. The properties of compact schemes constructed by the method of lines are examined in this paper. An initial-boundary value problem for the linear heat equation with discontinuous initial data is used as a test problem. In the method of lines, the spatial derivative in the heat equation is approximated on a two-point stencil according to a fourth-order accurate compact differentiation formula. The resulting evolution system of ordinary differential equations is solved using various implicit one-step two- and three-stage schemes of the second and third order of accuracy. The relation between the properties of the stability function of a scheme and the spatial monotonicity of the numerical solution is analyzed. In computations over long time intervals, the compact schemes are shown to be superior to traditional schemes based on the second-order accurate three-point approximation of the spatial derivative.     

On Symplectic and Multisymplectic Schemes for the KdV Equation

We examine some symplectic and multisymplectic methods for the notorious Korteweg–de Vries equation, with the question whether the added structure preservation that these methods offer is key in providing high quality schemes for the long time integration of nonlinear, conservative partial differential equations. Concentrating on second order discretizations, several interesting schemes are constructed and studied. Our essential conclusions are that it is possible to design very stable, conservative difference schemes for the nonlinear, conservative KdV equation. Among the best of such schemes are methods which are symplectic or multisymplectic. Semi-explicit, symplectic schemes can be very effective in many situations. Compact box schemes are effective in ensuring that no artificial wiggles appear in the approximate solution. A family of box schemes is constructed, of which the multisymplectic box scheme is a prominent member, which are particularly stable on coarse space–time grids     

On symplectic and multisymplectic schemes for the KdV equation

We examine some symplectic and multisymplectic methods for the notorious Korteweg-de Vries equation, with the question whether the added structure preservation that these methods offer is key in providing high quality schemes for the long time integration of nonlinear, conservative partial differential equations. Concentrating on second order discretizations, several interesting schemes are constructed and studied. Our essential conclusions are that it is possible to design very stable, conservative difference schemes for the nonlinear, conservative KdV equation. Among the best of such schemes are methods which are symplectic or multisymplectic. Semi-explicit, symplectic schemes can be very effective in many situations. Compact box schemes are effective in ensuring that no artificial wiggles appear in the approximate solution. A family of box schemes is constructed, of which the multisymplectic box scheme is a prominent member, which are particularly stable on coarse space-time grids.     

Secret image sharing with smaller shadow sizes for general access structures

In the area of secret image sharing (SIS), most papers focused on the schemes for threshold or some special access structures. Regarding general access structures (GAS), few results have been found in the literature. Two SIS schemes for GAS were proposed in 2001 and 2010, both are based on qualified sets. However, one distorts the reconstructed secret image, and some extra information is needed in both schemes. Here, we propose three polynomial based SIS schemes for GAS. Considering either qualified or forbidden sets, these schemes can reconstruct the secret image perfectly without any extra information needed. Some proof and analysis on the shadow sizes of the three schemes are given to lead us to choose the one with the smallest size. In addition, we also give some comparisons with two existing schemes, and security issue is also addressed in conclusion.     

Diffusion Schemes for Load Balancing on Heterogeneous Networks

Several different diffusion schemes have previously been developed for load balancing on homogeneous processor networks. We generalize existing schemes, in order to deal with heterogeneous networks. Generalized schemes may operate efficiently on networks where each processor can have arbitrary computing power, i.e., the load will be balanced proportionally to these powers. The balancing flow that is calculated by schemes for homogeneous networks is minimal with regard to the l ₂ -norm and we prove this to hold true for generalized schemes, too. We demonstrate the usability of generalized schemes by a number of experiments on several heterogeneous networks.