A hierarchical attribute-based encryption scheme

According to the relation of an attribute set and its subset,the author presents a hierarchical attribute-based encryption scheme in which a secret key is associated with an attribute set.A user can delegate the private key corresponding to any subset of an attribute set while he has the private key corresponding to the attribute set.Moreover,the size of the ciphertext is constant,but the size of private key is linear with the order of the attribute set in the hierarchical attribute-based encryption scheme.Lastly,we can also prove that this encryption scheme meets the security of IND-sSETCPA in the standard model.     

A Threshold Scheme under Peer-to-Peer Network

Resource sharing among peers is one of important application in Peer-to-Peer（P2P） network. Inexistenee of server makes P2P network to be a less trustable tool for property owners to distribute their resource. In order to protect intelligent property, reputation management strategy is adopted in many P2P network. As long as a P2P network reputation strategy is confirmed, application designer can employ a special detailed distribution scheme to fulfill content distribution within the net. Shmir （k, n） threshold scheme, for example, is an encryption scheme to enhance the distribution se curity of this kind of design. （k＊, n） threshold scheme is a new tool similar to Shmir scheme is proposed in this paper. The new scheme based on polynomial expansion and its security is decided by the one way function used in the secret distribution procedure. The scheme efficiency and its features as well as comparison between new and Shmir scheme are also discussed in this paper.     

Threshold signature scheme based on discrete logarithm and quadratic residue

Digital signature scheme is a very important research field in computer security and modern cryptography. A(k,n) threshold digital signature scheme is proposed by integrating digital signature scheme with Shamir secret sharing scheme. It can realize group-oriented digital signature, and its security is based on the difficulty in computing discrete logarithm and quadratic residue on some special conditions. In this scheme, effective digital signature can not he generatedby any h 1 or fewer legal users, or only by signature executive. In addition, this scheme can identify any legal user who presents incorrect partial digital signature to disrupt correct signature, or any illegal user who forges digital signature. A method of extending this scheme to an Abelian group such as elliptical curve group is also discussed. The extended scheme can provide rapider computing speed and stronger security in the case of using shorter key.     

Lüroth Expansion Digits and Maclaurin's Inequality

It is well known that for almost all real number x, the geometric mean of the first n digits d_i(x) in the Lüroth expansion of x converges to a number K_0 as n→∞. On the other hand, for almost all x, the arithmetric mean of the first n Lüroth expansion digits d_i(x) approaches infinity as n→∞. There is a sequence of refinements of the AM-GM inequality, Maclaurin's inequalities, relating the 1/k-th powers of the k-th elementary symmetric means of n numbers for 1≤k≤n. In this paper, we investigate what happens to the means of Lüroth expansion digits in the limit as one moves f(n) steps away from either extreme. We prove sufficient conditions on f(n) to ensure divergence when one moves away from the arithmetic mean and convergence when one moves f(n) steps away from geometric mean.     

Information-Theoretic Secure Verifiable Secret Sharing over RSA Modulus

The well-known non-interactive and information-theoretic secure verifiable secret sharing scheme presented by Pedersen is over a large prime. In this paper, we construct a novel non-interactive and information-theoretic verifiable secret sharing over RSA （Rivest, Shamir, Adleman） modulus and give the rigorous security proof. It is shown how to distribute a secret among a group such that any set of k parties get no information about the secret. The presented scheme is generally applied to constructions of secure distributed multiplication and threshold or forward-secure signature protocols.     

Sufficiency and Duality for Nondif ferentiable Multiobjective Fractional Programming Problems with (Φ,ρ,α)-V-Invexity

A new concept of(Φ,ρ,α)-V-invexity for differentiable vector-valued functions is introduced,which is a generalization of differentiable scalar-valued(Φ,ρ)-invexity.Based upon the(Φ,ρ,α)-V-invex functions,sufficient optimality conditions and MondWeir type dual theorems are derived for a class of nondifferentiable multiobjective fractional programming problems in which every component of the objective function and each constraint function contain a term involving the support function of a compact convex set.     

Task Decomposition Technique′s Deduction and Application of Product Developing Process in Concurrent Engineering

Task decomposition is a kind of powerful technique increasingly being used within industry as a pathway for achieving products′s developint success.In this paper,topology′s concept in modern mathematics is used for task decomposition technique′s deduction in product developing process.It puts forward the views of resolvability,measurability and connectivity of tasks and their practical principles.Combined with an example of developing the typical mechanical product,it explains the implementing method of task decomposition in Concurrent Engineering(CE).     

Efficient batch verification of online/offline short signature for a multi-signer setting

In this paper,we propose a method to construct an online/offline batch verification signature scheme in a multi-signer setting.The length of the scheme is approximately 480 bits.Based on the Lysyanskaya,Rivest,Sahai and Wolf(LRSW) assumption,this scheme is proved secure in a random oracle model,and it requires only three pairing operations for verifying n signatures from a multi-signer setting.     

Reality over Web： Pervasive Computing Meets the Web

Reality over Web （ROW） is a novel concept, where a window on the web corresponds to a window onto a real space. Once the correspondence is established, users should be able to interact or manipulate the objects or people in the real space through the web window. In this paper, we introduce the RoW concept and highlight the principles that govern its design and implementation. A system architecture for realizing the RoW concept is described along with a proof-of-concept prototype that implements portions of the RoW concept. One essential part of an RoW implementation is accurate Iocationing of objects and people in a video frame. The Iocationing problem becomes particularly challenging because we want to reuse existing infrastructure as much as possible. We developed a high-frequency sound-based Iocationing scheme and implemented it on the prototype. The results from initial experiments performed on the Iocationing scheme are reported here.     

Multi-pattern matching algorithm with wildcards based on bit-parallelism

Multi-pattern matching with wildcards is a problem of finding the occurrence of all patterns in a pattern set{p~1,---,p~k}in a given text t. If the percentage of wildcards in pattern set is not high,this problem can be solved using finite automata. We introduce a multi-pattern matching algorithm with a fixed number of wildcards to overcome the high percentage of the occurrence of wildcards in patterns. In our proposed method,patterns are matched as bit patterns using a sliding window approach. The window is a bit window that slides along the given text,matching against stored bit patterns. Matching process is executed using bit wise operations. The experimental results demonstrate that the percentage of wildcard occurrence does not affect the proposed algorithm's performance and the proposed algorithm is more efficient than the algorithms based on the fast Fourier transform. The proposed algorithm is simple to implement and runs efficiently in O(n+d(n/σ)(m/w))time,where n is text length,d is symbol distribution over k patterns,m is pattern length,and σ is alphabet size.     

关于3阶Carmichel数的注记

如果合数n对于所有f(x)∈Zn[x]都有f(x)n≡f(x)mod(n,r(x))成立,就称n是模r(x)的k阶Carmichael数,这里r(x)∈Zn[x]是k次首一不可约多项式,用Ck,r(x)表示所有的这种数的集合.定义Ck=∪r(x)Ck,r(x),这里r(x)跑遍Zn[x]中所有k次首一不可约多项式.Ck里面的元素就称为k阶Carmichael数.2005年,朱文余和孙琦首先给出了3阶Carmichael数的一个必要条件(1),然后又给出了这种数的一个充分条件(2),并发现108内没有满足条件(2)的这种数.最后他们问必要条件(1)是否也是充分的,还问108以外是否有满足充分条件(2)的这种数?本文作者首先证明了朱和孙给出的必要条件(1)也是充分的,然后利用这个等价条件搜索到所有小于3037000499的3阶Carmichael数,共713个,其中149个小于108(包括朱和孙找到的43个).这713个数均不满足朱和孙给出的充分条件(2).     

单对合矩阵之积

本文解决的问题是,1°.找出了一个条件(*),它是将一个具行列式±1的n(>1)阶矩阵A表为k(1≤k≤n)个单对合矩阵之积的必要条件;2°。证明了对于特征为2的域F,条件(*)为具行列式为1的矩阵A表为不多于两个单对合矩阵之积的充要条件;3°。证明了当域F的阶为2时,条件(*)为A可表为个数不超过k的单对合矩阵之积的充要条件。     

n元集合双覆盖计数公式的推广

给出ｎ元集合的５组２覆盖个数、４组、３覆盖个数与５组３覆盖个数的计数公式。     

孤立韧度与分数(k,n′)-临界消去图

将分数临界图和分数消去图的概念进行组合,提出分数临界消去图的概念.给出图G是分数(g,f,n′,m)-临界消去图的充要条件,并得到若干推论.同时证明了当I(G)>k(n′+1),且δ(G)≥k(n′+1)+1时,G是分数(k,n′)-临界消去图.     

GD-约束集最小覆盖求解的研究

首先对GD－约束集中冗余的GD－约束进行了分类，然后给出了一个判断GD－约束是否冗余的充要条件。在此基础上，经出了一个CD－约束集成为最小覆盖的充要条件。最后，提出了一种求解GD－约束集最小覆盖的算法并对该算法进行了时间复杂性分析和算法正确性证明。     

完全二部有向图的(C_(2k),α)-因子分解

K*m,n表示对称的完全二部有向图,C2k表示2k长有向圈。如果K*m,n的子有向图F满足(1)F的有向弧集可分解为若干个有向圈C2k,(2)K*m,n的每一个点都恰好出现在F的"个C2k中,则称F为K*m,n的(C2k,")-因子。如果K*m,n的有向弧集可以划分为K*m,n的(C2k,")-因子的和,则称K*m,n存在(C2k,")-因子分解。文章利用直接构造法,得到对称的完全二部有向图K*m,n存在(C2k,")-因子分解的充分必要条件:m=n#0(mod"k/d),其中d是"和k的最大公约数。     

n元集合的k＋1组k覆盖的计数公式

给出ｎ元集合的ｋ＋１组ｋ覆盖Ｓ（ｎ，Ｋ＋１，ｋ）的递推公式以及计数公式的结构。     

限制性的带核元划分问题

考虑了限制性的带核元划分问题,即将一个整数集合划分为2个子集,使得2个核元分别在不同的子集里且每个子集至多包含k个元素,这里n/2+1≤k≤n+1,目标使2个子集中元素之和的最小者达尽可能大.对一般的k,给出了全多项式时间近似方案(FPTAS).当k=n+1时,给出了线性时间内的多项式时间近似方案(PTAS)和全多项式时间近似方案(FPTAS).     

关于团和独立集的一类极值问题

图G称为一个(m, k, l; n)图,如果图中的每个顶点既被包含在一个(m+1)个点的团中,又被包含在(n+1)个点的独立集中,并且图中含有至少l个不同的(m+k+1)团。文中讨论了(m, k , l; n)图,通过其阶数p,给出了(m, k, l; n)图存在的充要条件,从而得到所能取得的最小阶数。     

具有时变离散周期耗散大系统的平稳振荡

<正> §1 文[1]对具有缓变系数的线性周期耗散大系统 (dx)/(dt)=A(t)X+f(t) (1.1) 利用标量∧函数给出了存在唯一周期解即平稳振荡的充分条件。本文仍采用标量∧函数,研究了时变离散周期耗散大系统