基于环Zn上圆锥曲线的前向安全环签名方案

基于环Zn上的圆锥曲线,提出一种高效的前向安全环签名方案。该方案考虑了密钥泄漏问题,并利用大数分解和圆锥曲线离散对数问题的困难性,增强了安全性。由于整个签名运算在环Zn的圆锥曲线上,使得明文嵌入方便,求逆元速度快,元素阶的计算及曲线上点的运算都比较容易,因此更便于实现。     

一个新的环Zn上圆锥曲线的ElGamal数字签名

对已有的基于环Zn上圆锥曲线的ElGamal的数字签名方案给出了分析,说明其算法将会暴露签名私钥,因而存在安全隐惠.提出一个没有此种安全隐惠的环Zn上圆锥曲线的E1Gamal的数字签名方案,并给出数值示例.环Zn上的圆锥曲线上的密码体制有更好的安全性,同时在圆锥曲线上具有明文嵌入方便,求逆元速度快,元素阶的计算及曲线上点的运算都比较容易等优点,因此更易于实现.在引进标准二进制计算群元素的情况下,还能节约1/4计算量.     

基于环Zn上圆锥曲线的ElGamal数字签名方案

首先介绍了剩余类环Zn上圆锥曲线Cn(a,b)的基本性质,给出了基于环Zn上圆锥曲线的ElGamal数字签名方案及其数值模拟.该方案综合利用了大数分解的困难性和有限群上计算离散对数问题的困难性,从而增强了该数字签名方案的安全性.由于在Cn(a,b)上明文的嵌入,阶的运算以及点的运算都比较容易,且通过引进标准二进制计算群元素的整数倍的算法,使该方案具有运算速度快,更易于实现等优点.     

环Zn上圆锥曲线的盲签名在电子现金中的应用

首先介绍环Zn上的圆锥曲线，给出基于RSA的盲签名方案在圆锥曲线上的模拟，并将其应用到电子支付系统中以实现可分电子现金。该方案的安全性基于大数分解和有限Abel群Cn(a,b)上计算离散对数的困难性。在数值模拟过程中，引进标准二进制快速计算群元素的整数倍，以便于在电子支付系统中能方便实现。与有限域上RSA盲签名方案相比较，明显缩短密钥长度，同时能够抵抗小指数攻击；与环Zn上椭圆曲线的RSA盲签名方案相比较，除了保留原有的优点外，还具有明文嵌入方便、运算速度快、更易于实现等优点。     

一种可证安全的两方口令认证密钥交换协议

口令认证的两方密钥交换协议无法抵御口令字典攻击和服务器泄漏伪装攻击。为此,提出一种改进的PAKA-X协议,用户保存自己的口令明文,服务器存储用户口令明文的验证值,由此弥补原协议的安全漏洞。理论分析结果表明,改进协议具有完美前向安全性,能抵抗Denning-Sacco攻击、服务器泄漏攻击、在线和离线字典攻击以及中间人攻击,并且仅需9次指数运算、6次哈希运算和6次异或运算,运行效率较高。     

一个新的环Zn上圆锥曲线的E1Gamal数字签名

对已有的基于环Zn上圆锥曲线的E1Gamal的数字签名方案给出了分析,说明其算法将会暴露签名私钥,因而存在安全隐患。提出一个没有此种安全隐患的环Zn上圆锥曲线的E1Gamal的数字签名方案,并给出数值示例。环Zn上的圆锥曲线上的密码体制有更好的安全性,同时在圆锥曲线上具有明文嵌入方便,求逆元速度快,元素阶的计算及曲线上点的运算都比较容易等优点,因此更易于实现．在引进标准二进制计算群元素的情况下,还能节约1／4计算量。     

基于Eisenstein环上圆锥曲线的数字签名

为了使曲线上的密码体制更加安全有效,引进Eisenstein环 ,介绍剩余类环 上的圆锥曲线 ,其中, 为 上满足 的2个不同的不可分数 的乘积。给出基于 的盲签名方案在圆锥曲线 上的模拟,并以电子支付系统中的可分电子现金为例讨论 上数字签名的应用,其安全性是基于大数分解和有限 群 上计算离散对数的困难性。圆锥曲线 上的数字签名方案体现了圆锥曲线所具有的明文嵌入方便、运算速度快、更易于实现等优点。     

环Zn上圆锥曲线上的群签名方案及其应用

首先引入环Zn上的圆锥曲线Cn（a,b）,给出Cn（a,b）上的一个群签名方案,并将其应用到电子现金发行系统中。该方案的安全性基于大数分解和有限Abel群（Cn（a,b）,）上计算离散对数的困难性。在计算过程中,引进标准二进制快速计算群元素的整数倍,节约1/4计算量。与经典群签名方案相比较,离散对数问题更加困难,有效提高了方案的安全性;与环Zn上椭圆曲线上的群签名方案相比较,除了保留安全性提高的优点外,还具有明文嵌入更加方便,阶的计算、基点的选取、群元整数倍等的运算速度更快,更易于实现等优点。     

一种高效安全的动态口令认证方案

动态口令身份认证技术相对于传统的静态口令身份认证技术有更高的安全性.基于ElGamal公钥密码体制和挑战-应答机制,提出了一种新型的结合智能卡和指纹特征的动态口令身份认证方案,实现了服务器和用户之间的双向认证,该方案能够有效地防止重放攻击,并且可以抵御假冒服务器攻击.     

二次整数环上的ElGamal密码体制和签名方案

提出了二次数域的代数整数环上的ElGamal公钥密码体制和ElGamal签名方案,其安全性基于离散对数问题的困难性。     

基于错误传播模型的非均等视频流丢失保护

提出一种适用于丢包网络、面向图像组（GOP）层的非均等视频流丢失保护方案。利用GOP中不同帧之间的非均等显著性,将不同数量前向错误校正包分配到GOP层的不同帧中。采用帧间包交错机制将突发包丢失分散到不同帧上,提高处理突发包丢失时的鲁棒性。仿真结果表明,在不同信道丢失模式下,该方案能提高视频接收质量。     

基于高斯抽样算法的NTRU类数字签名方案

针对NTRU类数字签名方案的签名值会泄露私钥的部分信息等问题,提出一种NTRU类数字签名方案。该方案通过私钥生成循环格,采用格上高斯抽样算法在此循环格上找出与杂凑后消息最近的向量作为消息的签名值。与现有的方案相比,该方案在保持签名和验证过程效率的同时,安全性方面具有2个新的性质：(1)由公钥伪造签名的困难性是基于循环格上的最近向量问题;(2)由新方案生成的大量签名值在空间分布呈球形,不泄露私钥的任何信息。     

Novel image fusion scheme based on dependency measure for robust multispectral palmprint recognition

Multispectral palmprint is considered as an effective biometric modality to accurately recognize a subject with high confidence. This paper presents a novel multispectral palmprint recognition system consisting of three functional blocks namely: (1) novel technique to extract Region of Interest (ROI) from the hand images acquired using a contact less sensor (2) novel image fusion scheme based on dependency measure (3) new scheme for feature extraction and classification. The proposed ROI extraction scheme is based on locating the valley regions between fingers irrespective of the hand pose. We then propose a novel image fusion scheme that combines information from different spectral bands using a Wavelet transform from various sub-bands. We then perform the statistical dependency analysis between these sub-bands to perform fusion either by selection or by weighted fusion. To effectively process the information from the fused image, we perform feature extraction using Log-Gabor transform whose feature dimension is reduced using Kernel Discriminant Analysis (KDA) before performing the classification by employing a Sparse Representation Classifier (SRC). Extensive experiments are carried out on a CASIA multispectral palmprint database that shows the strong superiority of our proposed fusion scheme when benchmarked with contemporary state-of-the-art image fusion schemes.     

A spam rejection scheme during SMTP sessions based on layer-3 e-mail classification

This paper proposes a scheme that rejects spam e-mails during their simple mail transfer protocol (SMTP) sessions. This scheme utilizes a layer-3 e-mail classification technique, which allows e-mail classes to be estimated before the end of SMTP sessions at receiving e-mail servers. We analyze the proposed scheme using discrete-time Markov chain analysis under varying e-mail traffic loads and service capacities. This paper also considers the effects of e-mail retransmission and illegal spam relaying by zombie systems on the performance of the proposed scheme. Results from our analysis show that e-mail server loading decreases by using the proposed technique. This allows the reduction in non-spam e-mail queuing delays and loss probability. Our scheme also protects e-mail servers from being overloaded by spam traffic and, if performed collectively over the Internet, it is capable of performing outbound spam control.     

Parallel implementation of back-propagation algorithm in networks of workstations

This work presents an efficient mapping scheme for the multilayer perceptron (MLP) network trained using back-propagation (BP) algorithm on network of workstations (NOWs). Hybrid partitioning (HP) scheme is used to partition the network and each partition is mapped on to processors in NOWs. We derive the processing time and memory space required to implement the parallel BP algorithm in NOWs. The performance parameters like speed-up and space reduction factor are evaluated for the HP scheme and it is compared with earlier work involving vertical partitioning (VP) scheme for mapping the MLP on NOWs. The performance of the HP scheme is evaluated by solving optical character recognition (OCR) problem in a network of ALPHA machines. The analytical and experimental performance shows that the proposed parallel algorithm has better speed-up, less communication time, and better space reduction factor than the earlier algorithm. This work also presents a simple and efficient static mapping scheme on heterogeneous system. Using divisible load scheduling theory, a closed-form expression for number of neurons assigned to each processor in the NOW is obtained. Analytical and experimental results for static mapping problem on NOWs are also presented.     

Application of intelligence-based predictive scheme to load-frequency control in a two-area interconnected power system

This paper describes an application of intelligence-based predictive scheme to load-frequency control (LFC) in a two-area interconnected power system. In this investigation, at first, a dynamic model of the present system has to be considered and subsequently an efficient control scheme which is organized based on Takagi-Sugeno-Kang (TSK) fuzzy-based scheme and linear generalized predictive control (LGPC) scheme needs to be developed. In the control scheme proposed, frequency deviation versus load electrical power variation could efficiently be dealt with, at each instant of time. In conclusion, in order to validate the effectiveness of the proposed control scheme, the whole of outcomes are simulated and compared with those obtained using a nonlinear GPC (NLGPC), as a benchmark approach, which is implemented based on the Wiener model of this power system. The validity of the proposed control scheme is tangibly verified in comparison with the previous one.     

防欺诈的动态密钥托管方案

采用动态可验证秘密共享方案,设计了一个可防欺诈的动态密钥托管方案,有效地解决了共享秘钥的动态更新、子密钥动态分配问题,且易于实现、效率高,提高了密钥托管的动态性和灵活性.该方案不仅能够有效克服易受阈下信道攻击的缺点,验证用户的托管密钥正确性,检查出失效的托管代理,而且能够解决"一次监听,永久监听"的问题,避免监听机构权力过大的现象,还能够防止密钥管理中心与托管代理的欺诈.     

Colored Petri Net model with automatic parallelization on real-time multicore architectures

This paper proposes a novel Colored Petri Net (CPN) based dynamic scheduling scheme, which aims at scheduling real-time tasks on multiprocessor system-on-chip (MPSoC) platforms. Our CPN based scheme addresses two key issues on task scheduling problems, dependence detecting and task dispatching. We model inter-task dependences using CPN, including true-dependences, output-dependences, anti-dependences and structural dependences. The dependences can be detected automatically during model execution. Additionally, the proposed model takes the checking of real-time constraints into consideration. We evaluated the scheduling scheme on the state-of-art FPGA based multiprocessor hardware system and modeled the system behavior using CPN tools. Simulations and state space analyses are conducted on the model. Experimental results demonstrate that our scheme can achieve 98.9% of the ideal speedup on a real FPGA based hardware prototype.     

A new robust reference watermarking scheme based on DWT-SVD

This paper presents a new semi-blind reference watermarking scheme based on discrete wavelet transform(DWT) and singular value decomposition(SVD) for copyright protection and authenticity. We are using a gray scale logo image as watermark instead of randomly generated Gaussian noise type watermark. For watermark embedding, the original image is transformed into wavelet domain and a reference sub-image is formed using directive contrast and wavelet coefficients. We embed watermark into reference image by modifying the singular values of reference image using the singular values of the watermark. A reliable watermark extraction scheme is developed for the extraction of watermark from distorted image. Experimental evaluation demonstrates that the proposed scheme is able to withstand a variety of attacks. We show that the proposed scheme also stands with the ambiguity attack also.     

DoS攻击下网络控制系统的记忆型事件触发控制

针对一类网络化控制系统，当考虑网络控制系统遭受PWM （Pulsewidth-Modulated）型DoS （Denial-of-Service， DoS）攻击时，提出一种基于缓存机制的记忆型事件触发机制策略.本文考虑的DoS攻击可检测，并且攻击的周期时长以及每周期内的最短休眠时间已知.为了减少网络控制系统中数据包的发送频次，本文设计了基于相对误差的新型事件触发策略，与传统事件触发策略相比，通过增加缓存器来有效利用已经发送的历史采样数据，最终达到改善系统动态过程的目的.接下来，综合考虑网络攻击和事件触发方案，建立了网络化切换系统模型，构造分段李雅普诺夫泛函，推导出系统指数稳定的结论并且对控制器增益及事件触发参数进行协同设计.最后，通过仿真案例，验证了所提出方法的有效性.