签密方案在分布式协议中的应用

该文基于可验证秘密共享思想和对Zheng的签密方案的必要修改，首次构造了一种不需要可信中心的门限签密方案．它能同时达到门限签名和加密的双重目的，实现代价仅和门限签名相当，并具有非否认性质．该文对当前一些分布式密钥分配协议做了分析，并基于Naor的基本思想，重点利用签密方案设计了协议SC—DKDS．与其它协议相比，该协议在减低实现成本等方面更为有效，因为它不需要认证信道、秘密信道及复杂的零知识证明等．该文还在RO（Random Oracle，随机预言）模型中给出了以上协议的安全性证明．

指定验证方的门限验证签名方案及安全性证明

Laih提出了指定验证方的签名方案设计问题，并给出一种解决方案．首先分析指出该方案存在严重安全缺陷，然后提出了签名方案SV-EDL，解决了如上密码学问题.同时，把可证明安全理论引入这类方案的分析设计，并在RO（random oracle）模型中证明：SV-EDL的抗伪造安全性和计算Diffie-Hellman（computational Diffie-HeUman,简称CDH）问题紧密关联，亦即伪造SV-EDL签名几乎和解决CDH问题一样困难；除指定方以外，任何人验证签名的能力都与决策Difile-Hellman（decisional Diffie-Hellman,简称DDH）问题密切相关。由于CDH问题和DDH问题的困难性与离散对数（discrete logarithm，简称DL）问题紧密相关已成为广泛共识，因此与当前同类方案比较，该签名方案提供了更好的安全性保证．此外，上述签名方案还以非常简明、直接的方式满足不可否认要求最后提出并构造了验证服务器系统的门限验证协议，并在标准模型中给出了安全性证明．该方案不要求可信中心的存在．

实例依赖的可验证随机函数的高效构造

实例依赖的可验证随机函数是由文献[1]提出的一个新的密码学概念,它也是构造高安全性的零知识协议(如可重置零知识论证系统)的一个强有力的工具,而这些高安全性的零知识协议在智能卡和电子商务中有着重要的潜在价值。基于非交互ZAP证明系统和random oracle模型中∑OR-协议,给出了实例依赖的可验证伪随机函数的两个高效的实现和相应的安全性证明,提升了这一工具的应用价值。

Variations in MIMO-OFDM channel capacity due to random human movement in an indoor environment

Channel measurements and simulations have been carried out to observe the effects of pedestrian movement on multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) channel capacity. An in-house built MIMO-OFDM packet transmission demonstrator equipped with four transmitters and four receivers has been utilized to perform channel measurements at 5.2 GHz. Variations in the channel capacity dynamic range have been analysed for 1 to 10 pedestrians and different antenna arrays (2 × 2, 3 × 3 and 4 × 4). Results show a predicted 5.5 bits/s/Hz and a measured 1.5 bits/s/Hz increment in the capacity dynamic range with the number of pedestrian and the number of antennas in the transmitter and receiver array.

Random Indexing K-tree

Random Indexing K-tree is the combination of two algorithms suited for large scale document clustering.

Fundamental solution and discrete random walk model for time-space fractional diffusion equation

In this paper, we consider a time-space fractional diffusion equation of distributed order (TSFDEDO). The TSFDEDO is obtained from the standard advection-dispersion equation by replacing the first-order time derivative by the Caputo fractional derivative of order α∈(0,1], the first-order and second-order space derivatives by the Riesz fractional derivatives of orders β 1∈(0,1) and β 2∈(1,2], respectively. We derive the fundamental solution for the TSFDEDO with an initial condition (TSFDEDO-IC). The fundamental solution can be interpreted as a spatial probability density function evolving in time. We also investigate a discrete random walk model based on an explicit finite difference approximation for the TSFDEDO-IC.

Clustering with random indexing K-tree and XML structure

This paper describes the approach taken to the clustering task at INEX 2009 by a group at the Queensland University of Technology. The Random Indexing (RI) K-tree has been used with a representation that is based on the semantic markup available in the INEX 2009 Wikipedia collection. The RI K-tree is a scalable approach to clustering large document collections. This approach has produced quality clustering when evaluated using two different methodologies.