首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 78 毫秒
1.
蔡永泉  王亚丽 《计算机工程》2006,32(13):182-184
利用Cha和Cheon提出的基于身份的数字签名方案,提出了一种新的会议密钥协商算法,并分析了该算法的正确性、安全性和执行效率。分析结果表明,在Gap Diffie-Hellman假设下,任何窃听者均无法得到有关会议密钥的任何信息,且无论存在多少恶意参与者,诚实参与者都能够协商出共同的会议密钥。该方案效率较高,有较强的灵活性、适应性和实用性。  相似文献   

2.
目前提出的密钥协商协议大部分都是基于Diffie-Hellman交互,对协商信息进行认证,并在成员之间建立一个会话密钥,实施安全通信。本文找出了文献[1]中的两个安全漏洞,利用双线性映射性质,提出了一种基于用户ID的会议密钥协商方案。此方案能够有效地抵抗重放攻击、合谋攻击、假冒攻击、中间人攻击,与文献[1]的方法相比,具有更高的安全性和效率,在多对多网络通信中有着很强的实用性。  相似文献   

3.
在参加会议的各方共同协商会议密钥时,为了确保用于构造密钥的协商信息的真实性,通常需要对协商信息进行认证。数字签名和共享秘密是两种常用的认证方法。介绍了利用椭圆曲线上Weil配对构造的基于身份的公钥密码体制。分别利用基于身份的数字签名方案和基于身份的长期共享密钥设计了两个可认证会议密钥协商协议。协议具有较强的安全性和较高的效率,可应用于各种需要多方共同协商会话密钥的环境。  相似文献   

4.
电子会议是网络的一种重要应用形式,而在电子会议中,会议密钥的管理与分发是一个极为重要的问题。近年来出现了一些会议密钥交换机制,并且各有利弊。该文分析了现有会议密钥交换机制的弊端,针对计算机技术的发展趋势提出了三种不同的动态会议密钥交换机制,并分析了它们的安全性和其他性能。  相似文献   

5.
密钥协商协议进展   总被引:3,自引:2,他引:1  
密钥协商协议允许两个或多个用户在公开网络中建立一个共享密钥,是最基本的密码原型和公钥密码学的基础.本文综述密钥协商协议的研究进展,包括密钥协商的安全模型、传统离散对数环境下的密钥协商协议、最近发展起来的基于双线性对的密钥协商协议以及基于口令的密钥协商协议,指出了密钥协商协议中的公开问题和未来可能的发展方向.  相似文献   

6.
基于H.323的多媒体会议电视系统的实现   总被引:1,自引:0,他引:1  
以H.323v2(第二版)为例,分别介绍了多媒体会议电视系统的组成、会议方式、通信过程和终端实例。  相似文献   

7.
即时安全通信会议密钥分配方案   总被引:1,自引:0,他引:1  
赵旸 《计算机工程》2004,30(2):64-65,91
提出了一个新的安全有效的会议密钥分配方案,该方案适合多个用户通过临时组建的网络实现即时安全通信。相对于GDH.2而言,该方案对通信参与者的身份以及传输数据的完整性进行了验证,而且对最后产生的会议密钥进行了确认,只以增加很小的计算和通信负倚为代价,安全性能就得到了较大的提高。  相似文献   

8.
一种基于孙子定理的会议密钥的分配机制   总被引:3,自引:0,他引:3  
本文提出了一种基于孙子定理的会议密钥分配机制,兴仅实现了会议密钥的安全分配,而且对密钥发送者能进行鉴别。它可以防止广播信息的重播。〔6〕中的SK攻击也不能成功。本机制适于会议组成员固定的情况。  相似文献   

9.
简述了集中式可视会议系统和组播的安全要求,主要介绍了一种结合组播密钥管理和组播安全策略,应用于集中式可视会议的安全解决方案,从而提高可视会议的整体安全性能.  相似文献   

10.
以H.323v2(第二版)为例,分别介绍了多媒体会议电视系统的组成、会议方式、通信过程和终端实例。  相似文献   

11.
提出一种基于平衡不完全区组设计(BIBD)和循环置换矩阵的准循环低密度校验码(LDPC)构造方法。根据实际需求,利用BIBD构造相应的模板矩阵,用适合的循环置换矩阵进行扩展。采用该方法构造的LDPC码具有良好的结构和灵活性,该方法在一定范围内可快速方便构造出某一特定码长或码率的准循环LDPC码。仿真结果证明,准循环LDPC码在高斯白噪声信道上采用迭代译码时,具有较优的纠错性能及较低的错误平层。  相似文献   

12.
An important challenge in radio frequency identification (RFID) systems is the collision concern. When an interrogator send a request, it has several tags to answer to in its transmission range, and a tag collision has occurred. The interrogator must be able to recognize tags as rapidly as possible. A collision problem is a power‐consuming occurrence that diminishes the operation of RFID structure. This article proposes a tag anti‐collision power‐clustering RFID algorithm for all tag identification. The tags are boundaries into the several power level clusters based on distances of the reader. Specifically, in the proposed algorithm, tags and readers use of balanced incomplete blocks design (BIBD) to reach a fast identification. In a BIBD matrix, any two columns intersect exactly in one component that makes it possible for easy transmission of any two tags via the tag's identification in their read cycles. The aim of this article is to propose a joint organization that while decreases power consumption increases the working lifetime of RFID structure. The reader can get each tag ID by distinguishing each unit of BIBD symbols, one by one. The use of proposed algorithm brings about a great improvement in the power consumption and identification time.  相似文献   

13.
New splitting iterative methods for Toeplitz systems are proposed by means of recently developed matrix splittings based on discrete sine and cosine transforms due to Kailath and Olshevsky [Displacement structure approach to discrete-trigonometric transform-based preconditioners of G. Strang type and of T. Chan type, SIAM J. Matrix Anal. Appl. 26 (2005), pp. 706–734]. Theoretical analysis shows that new splitting iterative methods converge to the unique solution of a symmetric Toeplitz linear system. Moreover, an upper bound of the contraction factor of our new splitting iterations is derived. Numerical examples are reported to illustrate the effectiveness of new splitting iterative methods.  相似文献   

14.
本文讨论了处理具优势对称部分的非对称非线性问题的不精确Newton方法.利用矩阵分裂技术,建立了求解此类问题的一类不精确Newton分裂极小参量法、不精确Newton分裂对称LQ法(简记:Newton-SMINRES,Newton-SSYMMLQ),并在合理的假设下,证明了算法的收敛性.数值计算表明:Newton-SMINRES,Newton-SSYMMLQ算法的收敛行为要好于一般求解非线性方程组的Newton-Krylov子空间方法:Newton-BiCGSTAB,Newton-GMRES和Newton-MINRES等算法.  相似文献   

15.
We consider the problem of splitting a symmetric positive definite (SPD) stiffness matrix A arising from finite element discretization into a sum of edge matrices thereby assuming that A is given as the sum of symmetric positive semidefinite (SPSD) element matrices. We give necessary and sufficient conditions for the existence of an exact splitting into SPSD edge matrices and address the problem of best positive (nonnegative) approximation. Based on this disassembling process we present a new concept of ``strong' and ``weak' connections (edges), which provides a basis for selecting the coarse-grid nodes in algebraic multigrid methods. Furthermore, we examine the utilization of computational molecules (small collections of edge matrices) for deriving interpolation rules. The reproduction of edge matrices on coarse levels offers the opportunity to combine classical coarsening algorithms with effective (energy minimizing) interpolation principles yielding a flexible and robust new variant of AMG.  相似文献   

16.
We present a novel data organization for disk arrays-segmented information dispersal(SID). SID provides protection against disk failures while ensuring that the reconstruction of the missing data requires only relatively small contiguous accesses to the available disks. SID has a number of properties that make it an attractive solution for fault-tolerant video servers. Under fault-free conditions, SID performs as well as RAID 5 and organizations based on balanced incomplete block designs (BIBD). Under failure, SID performs much better than RAID 5 since it significantly reduces the size of the disk accesses performed by the reconstruction process. SID also performs much better than BIBD by ensuring the contiguity of the reconstruction accesses. Contiguity is a very significant factor for video retrieval workloads, as we demonstrate. We present SID data organizations with a concise representation which enables the reconstruction process to efficiently locate the needed video and check data  相似文献   

17.
《国际计算机数学杂志》2012,89(5):1067-1082
A balanced incomplete block design (BIBD) is instrumental in design of experiments. This is usually constructed by algebraic methods such as finite algebra or difference sets. However, in algebraic approaches, no unified method exists, and each BIBD has been constructed in some ad hoc ways. On the other hand, computer-based methods apply the same algorithm to all BIBDs; hence, these are unified approaches. Although various meta-heuristic algorithms have been tried, the success of these methods has been rather limited. This article presents an alternative approach to this problem that formulates the problem as a nonlinear mixed integer programming problem. We develop a branch-and-bound algorithm to solve this, and a tabu search algorithm to overcome some weakness in the former algorithm. We compare the performance of these algorithms against some previously developed algorithms, and demonstrate that our algorithms are competitive to these methods.  相似文献   

18.
《国际计算机数学杂志》2012,89(11):1201-1209

In [5] a new iterative method is given for the linear system of equations Au=b , where A is large, sparse and nonsymmetrical and A^{\rm T}+A is symmetric and positive definite (SPD) or equivalently A is positive real. The new iterative method is based on a mixed-type splitting of the matrix A and is called the mixed-type splitting iterative method. The iterative method contains an auxiliary matrix D_1 that is restricted to be symmetric. In this note, the auxiliary matrix is allowed to be more general and it is shown that by proper choice of D 1 , the new iterative method is still convergent. It is also shown that by special choice of D_{1} , the new iterative method becomes the well-known (point) accelerated overrelaxation (AOR) [1] method. Hence, it is shown that the (point) AOR method applied to the positive real system is convergent under the proper choice of the overrelaxation parameters y and .  相似文献   

19.
We propose a method for accelerating iterative algorithms for solving symmetric linear complementarity problems. The method consists in performing a one-dimensional optimization in the direction generated by a splitting method even for non-descent directions. We give strong convergence proofs and present numerical experiments that justify using this acceleration.  相似文献   

20.
基于Schur分解的Contourlet域水印方案   总被引:1,自引:0,他引:1       下载免费PDF全文
刘鹏  魏娟  杨峻 《计算机工程》2011,37(16):147-148
基于奇异值分解的数字水印方案计算量大、算法实现困难,为此,提出一种基于Schur分解的Contourlet域数字水印方案。将载体图像进行Contourlet变换,利用矩阵分裂理论得到分块对称矩阵,对每个对称矩阵进行Schur分解得到对角矩阵,通过量化对角元素的方法实现水印嵌入。水印提取是嵌入的逆过程。实验结果表明,该水印方案嵌入和提取的速度快,具有较好的不可见性和鲁棒性。  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号