Secure three-party computational protocols for triangle area

In this work, we have put forth two different protocols to address a concrete secure multi-party computational (MPC) problem related to a triangle, of which the coordinates of the three vertices are confidentially kept by the three participants, respectively. The three parties wish to collaboratively compute the area of this triangle while preserving their own coordinate privacy. As one of the merits, our protocols employ weaker assumptions of the existence of pseudorandom generators. In particular, unlike massive secure MPC protocols that rely a lot on oblivious transfer, ours utilize a new computing idea called “pseudorandom-then-rounding” method to avoid this burdensome obstacle. The two protocols are based on different theorems, while they both make use of the same underlying idea. At last, we provide a detailed proof for the first protocol by a series of security reductions of our newly defined games, which seems somewhat stronger than the previous simulation-based proofs and a proof sketch for the second one. Analysis and discussion about the reasons are provided as well to round off our work.     

Practical chosen-ciphertext secure Hierarchical Identity-Based Broadcast Encryption

We focus on practical Hierarchical Identity-Based Broadcast Encryption (HIBBE) with semantic security against adaptively chosen-ciphertext attacks (CCA2) in the standard model. We achieve this goal in two steps. First, we propose a new HIBBE scheme that is secure against chosen-plaintext attacks (CPA). Compared with the existing HIBBE scheme that is built from composite-order bilinear groups, our construction is based on prime-order bilinear groups. The much better efficiency of group operations in prime-order bilinear groups makes our proposed HIBBE scheme more practical. Then, we convert it into a CCA2-secure scheme at the cost of a one-time signature. Instead of extending one user hierarchy in the Canetti–Halevi–Katz approach from CPA-secure (\(l+1\))-Hierarchical Identity-Based Encryption [(\(l+1\))-HIBE] to CCA2-secure \(l\)-HIBE, our construction merely adds one on-the-fly dummy user in the basic scheme. We formally prove the security of these two schemes in the standard model. Comprehensive theoretical analyses and experimental results demonstrate that the proposed HIBBE schemes achieve desirable performance.     

现代商业区建筑供配电设计要点及对策初论

在经济的推动下,商业区数量日益增多,空间布局更加紧凑,用电量也随之大幅增加,管理更为困难。因此,要重视商业区建筑的供电配电。介绍了商业区建筑的特点,然后结合实际案例对其供配电进行了设计。     

Robust image hashing using non-uniform sampling in discrete Fourier domain

This paper proposes a robust image hashing method in discrete Fourier domain that can be applied in such fields as image authentication and retrieval. In the pre-processing stage, image resizing and total variation based filtering are first used to regularize the input image. Then the secondary image is obtained by the rotation projection, and the robust frequency feature is extracted from the secondary image after discrete Fourier transform. More sampling points are chosen from the low- and middle-frequency component to represent the salient content of the image effectively, which is achieved by the non-uniform sampling. Finally, the intermediate sampling feature vectors are scrambled and quantized to produce the resulting binary hash securely. The security of the method depends entirely on the secret key. Experiments are conducted to show that the present method has satisfactory robustness against perceptual content-preserving manipulations and has also very low probability for collision of the hashes of distinct images.     

Perceptual image preview

Image preview is a convenient way to browse large or multiple images on small displays. However, current signal-level image resampling algorithms may remove many features of interest in the preview image. In this paper, we propose perceptual image preview which retains more perceptual features such that users can inspect features of interest by viewing the preview image only and without zooming in. This technology has two components, structure enhancement and perceptual feature visualization. Structure enhancement enhances the image structure while suppressing subtle details using a gradient modulation method, thus making the succedent perceptual features more apparent. For perceptual feature visualization, features of interest detected in the picture is visualized on the structure enhanced preview image. We demonstrate with two examples of most commonly used image quality features, image blur and noise. The effectiveness of the proposed method is validated by experimental results.     

高职院校计算机专业现状分析及对策——以黄冈职业技术学院计算机专业为例

该文也就高职院校计算机专业改革进行若干的设想,从课程体系、学生结构、教师知识结构等方面的改革进行分析总结。     

安徽省地震会商系统软件界面设计研究

基于ARCGis9.2的安徽省地震会商系统不仅需要强大的技术功能,还需要友好和一目了然的界面,这样不仅让会商报告者思路清晰,也能使会商观众更加清晰了解地震预报会商内容,从而为决策者更好应对不同地点和不同大小的地震发生可能性做出科学的决策;引入flash8作为软件系统的界面,用flash调用各个模块,无论从界面和功能上都较好的解决了这一问题。