论高校人事档案秘密安全管理存在的问题及其解决路径

高校人事档案记载着高校教职工学习、工作、工资福利等个人历史信息,涉及工作秘密和个人隐私,具有高度保密性.高校教职工人事档案的秘密范围包括国家秘密、工作秘密和其他不宜公开的事项.当前,高校人事档案在秘密安全管理中存在寄递接收不规范、查阅和借阅程序不到位、整理不严谨、精细化保管程度低、管理人员存在失职行为等现象.影响人事档案秘密安全管理的因素有管理者的意识、方法和技能,有管理设施,也有秘密安全意识与理念等.完善人事档案秘密安全管理,需要从人防、物防、心防和技防等环节着手,处理好公开和保密的关系,做到人事档案秘密安全保护“四位一体”,强化管理.

可保证临时秘密泄漏安全的无证书签密方案

为了确保无证书签密方案能实现临时秘密泄漏安全性,提出了一种新的无需对运算的无证书签密方案。新签密方案将用户部分私钥、用户私有秘密和签密临时秘密分别对应到求解3个不同的CDH(computational Diffie-Hellman)问题,并采用散列函数将用户密钥、临时秘密和密文与用户身份绑定。表明了新方案不仅能实现数据的认证性、机密性,还能确保临时秘密泄漏安全性。对比分析结果表明,新方案的安全性更高,计算性能更优。此外,文中还指出文献[3]中签密方案不能抵抗临时秘密泄露攻击。

基于平滑熵的无条件安全秘密钥协商时的密钥速率

本文研究了基于平滑熵进行无条件安全秘密钥协商时的密钥速率,得出了通信双方可以以强密钥速率协商无条件安全的共享密钥的条件。

金融消费者信息秘密与安全权保护研究

金融产品凭借互联网的助力迅速推广,但是金融消费者信息泄露的问题也更加严峻。通过对国内现状的分析不难发现,我国金融消费者信息秘密与安全权存在立法不完善、自我约束不彻底、监管不到位、司法救济不全面等缺陷。文章旨在对国内外保护现状进行分析和比较的基础上,进而初步提出对我国金融消费者信息秘密与安全权的保护体系。首先,我国应该对个人金融信息的采集和利用制定专项的法律;其次,金融机构应当对保密措施进度公开,以便社会的监督;再者,成立统一的金融消费者保护局以及行业协会对金融机构信息安保工作进行监督;最后,在诉讼中通过举证责任倒置制度缩小争议双方的实力差距,以及建立公益诉讼制度对大范围的信息泄露案件进行统一保护。

浅析国外涉密人员安全审查动态

国家秘密安全治理是支撑国家安全治理的基础性、保障性工作,对涉密人员开展安全审查是筑牢保密防线的重要手段。本文归纳了当前国外在涉密人员安全审查领域的制度规范、运行体系、行为标准等方面的动态,以期为创新发展我国涉密人员安全审查提供实践参考.

无可信中心的门限可变秘密共享方案研究综述

简述在秘密共享方案中,需要动态调整门限值来确保秘密的安全级别相关研究。给出秘密共享方案、门限可变秘密共享方案及相关概念的定义;聚焦于门限值改变过程中无可信中心且参与者之间无交互的应用场景,综述了两类特殊门限变化子区域上的门限可变秘密共享方案(高效通信秘密共享方案和可安全重构的秘密共享方案)的最新研究成果;归纳了最优门限可变秘密共享方案的相关研究进展;最后对该类问题的研究做了展望。

身份基认证密钥协商协议的分析与改进

对三个标准模型下可证明安全的身份基认证密钥协商协议进行了安全属性缺陷分析,在原方案基础上提出了一个安全增强的新方案。新方案满足目前已知的绝大多数安全属性要求,包括已知会话密钥安全性、抗密钥泄露伪装、抗未知密钥共享、无密钥控制以及消息独立性,特别是满足完美前向安全性、PKG前向安全性、已知会话相关临时秘密信息安全性,同时保持了良好的计算效率。

试论新闻出版审读环节中的保密自审

文章探讨新闻出版审读环节的保密自审。对保密审查的法律依据,保密自审的定义、对象和重点、主体、原则、操作流程等进行了论述。认为新闻出版行业应高度重视保密工作,新闻出版单位应建立健全保密审查制度,新闻出版从业人员应提升保密素养,切实加强审读环节的保密把关,确保国家秘密安全。

Quantum Dialogue Protocol Using a Class of Three-Photon W States

A theoretical protocol of quantum dialogue is proposed,which uses a class of three-photon W states asquantum channel.After two-step security check,four-bit secret message can be transmitted to each other by transmittingof single photon with the aid of two-bit classical information.

MAVP-FE:Multi-Authority Vector Policy Functional Encryption with Efficient Encryption and Decryption

In cloud,data access control is a crucial way to ensure data security.Functional encryption(FE) is a novel cryptographic primitive supporting fine-grained access control of encrypted data in cloud.In FE,every ciphertext is specified with an access policy,a decryptor can access the data if and only if his secret key matches with the access policy.However,the FE cannot be directly applied to construct access control scheme due to the exposure of the access policy which may contain sensitive information.In this paper,we deal with the policy privacy issue and present a mechanism named multi-authority vector policy(MAVP) which provides hidden and expressive access policy for FE.Firstly,each access policy is encoded as a matrix and decryptors can only obtain the matched result from the matrix in MAVP.Then,we design a novel function encryption scheme based on the multi-authority spatial policy(MAVPFE),which can support privacy-preserving yet non-monotone access policy.Moreover,we greatly improve the efficiency of encryption and decryption in MAVP-FE by shifting the major computation of clients to the outsourced server.Finally,the security and performance analysis show that our MAVP-FE is secure and efficient in practice.

Privacy-preserving Distributed Location Proof Generating System

The rapid development of location-based service(LBS) drives one special kind of LBS, in which the service provider verifies user location before providing services. In distributed location proof generating schemes, preventing users from colluding with each other to create fake location proofs and protecting user's location privacy at the same time, are the main technical challenges to bring this kind of LBS into practical. Existing solutions tackle these challenges with low collusion-detecting efficiency and defected collusion-detecting method. We proposed two novel location proof generating schemes, which inversely utilized a secure secret-sharing scheme and a pseudonym scheme to settle these shortcomings. Our proposed solution resists and detects user collusion attacks in a more efficient and correct way. Meanwhile, we achieve a higher level of location privacy than that of previous work. The correctness and efficiency of our proposed solution is testified by intensive security analysis, performance analysis, as well as experiments and simulation results.

Reexamining Security of Improved Multiparty Quantum Secret Splitting and Quantum State Sharing

In a recent letter [H.F. Wang, X. Ji, and S. Zhang, Phys. Lett. A 358 （2006） 11], an improvement of the multiparty quantum secret splitting and quantum state sharing protocol [F.G. Deng, et al., Phys. Lett. A 354 （2006） 190.] was presented. We study the security of the improved protocol and find that two or more dishonest participants may recover the secret from the dealer. Hence we further modify the improved protocol, which make it stand against this kind of attack.

Multiparty Quantum Secret Sharing Using Quantum Fourier Transform

A （n, n）-threshold scheme of multiparty quantum secret sharing of classical or quantum message is proposed based on the discrete quantum Fourier transform. In our proposed scheme, the secret message, which is encoded by using the forward quantum Fourier transform and decoded by using the reverse, is split and shared in such a way that it can be reconstructed among them only if all the participants work in concert. Fhrthermore, we also discuss how this protocol must be carefully designed for correcting errors and checking eavesdropping or a dishonest participant. Security analysis shows that our scheme is secure. Also, this scheme has an advantage that it is completely compatible with quantum computation and easier to realize in the distributed quantum secure computation.

A New Method to Construct Secret Sharing Schemes Based on Linear Codes

Secret sharing is an important topic in cryptography and has applications in information security. The coding theory has been an important role in the constructing of secret sharing schemes. It is known that every linear code can be used to construct secret sharing schemes. So, we use the parity-check matrix of a linear code to construct secret sharing schemes based on linear codes. We also describe some techniques to recover the secret and determine the access structure of the new scheme. In this paper, we use the Massey＇s secret sharing scheme.

关于加强企业保密工作的几点思考

本文阐述了保密工作面临的形势,加强企业技术和商业秘密、涉密公文、计算机网络及通信安全、对外交往的保密管理工作。

他们在读什么？畅销美国的10本电脑书

作为电脑技术的Fans，你难道不想了解——在IT业最发达的美国，人们读的都是些什么书?你难道不想知道——在电脑技术的浪尖潮尖，又有哪些IT技术正处于热门之中?

美国防范内部威胁机制探析

本文在概述美国防范内部威胁的基本框架、内部威胁预警指标及报告制度的基础上,以美国国防部为例,探析了美国政府部门实施内部威胁防范计划的具体运行机制,以期为我国保密工作领域完善内部威胁防范体系提供参考。

一种带欺骗检测的秘密共享方案

本文提出一种基于单向函数的秘密分享方案 ,它不需每次生成分享值 ,可以无限次重构秘密信息 ,不诚实的成员在秘密重构时可以被检查出来 ,重构秘密信息时 。

Dynamic(2, 3) Threshold Quantum Secret Sharing of Secure Direct Communication

In this paper, we show that a(2, 3) discrete variable threshold quantum secret sharing scheme of secure direct communication can be achieved based on recurrence using the same devices as in BB84. The scheme is devised by first placing the shares of smaller secret pieces into the shares of the largest secret piece, converting the shares of the largest secret piece into corresponding quantum state sequences, inserting nonorthogonal state particles into the quantum state sequences with the purpose of detecting eavesdropping, and finally sending the new quantum state sequences to the three participants respectively. Consequently, every particle can on average carry up to 1.5-bit messages due to the use of recurrence. The control codes are randomly prepared using the way to generate fountain codes with pre-shared source codes between Alice and Bob, making three participants can detect eavesdropping by themselves without sending classical messages to Alice. Due to the flexible encoding, our scheme is also dynamic, which means that it allows the participants to join and leave freely.

Three-step semiquantum secure direct communication protocol

Quantum secure direct communication is the direct communication of secret messages without need for establishing a shared secret key first.In the existing schemes,quantum secure direct communication is possible only when both parties are quantum.In this paper,we construct a three-step semiquantum secure direct communication(SQSDC)protocol based on single photon sources in which the sender Alice is classical.In a semiquantum protocol,a person is termed classical if he(she)can measure,prepare and send quantum states only with the fixed orthogonal quantum basis{|0,|1}.The security of the proposed SQSDC protocol is guaranteed by the complete robustness of semiquantum key distribution protocols and the unconditional security of classical one-time pad encryption.Therefore,the proposed SQSDC protocol is also completely robust.Complete robustness indicates that nonzero information acquired by an eavesdropper Eve on the secret message implies the nonzero probability that the legitimate participants can find errors on the bits tested by this protocol.In the proposed protocol,we suggest a method to check Eves disturbing in the doves returning phase such that Alice does not need to announce publicly any position or their coded bits value after the photons transmission is completed.Moreover,the proposed SQSDC protocol can be implemented with the existing techniques.Compared with many quantum secure direct communication protocols,the proposed SQSDC protocol has two merits:firstly the sender only needs classical capabilities;secondly to check Eves disturbing after the transmission of quantum states,no additional classical information is needed.