Cramer–Damgård signatures revisited: Efficient flat-tree signatures based on factoring

At Crypto 96 Cramer and Damgård proposed an efficient, tree-based, signature scheme that is provably secure against adaptive chosen message attacks under the assumption that inverting RSA is computationally infeasible.

In this paper we show how to modify their basic construction in order to achieve a scheme that is provably secure under the assumption that factoring large composites of a certain form is hard. Our scheme is as efficient as the original Cramer Damgård solution while relying on a seemingly weaker intractability assumption.     

On the transferability of private signatures

In some situations, a user wants to sign a message in such a way that only a designated verifier is convinced of the validity of the signature, whereas other users cannot distinguish whether the signer has signed this message at all. In some cases, the signer may want to preserve this level of privacy forever, which means that the initial verifier should not be able to convince anyone else of the fact that the signer signed the message. In some other cases, the signer may want to give the initial verifier the possibility to transfer his conviction to someone else (maybe to everybody), when/if desired.In this paper we review this notion of private signatures, focusing on the level of transferability desired by the signer. We first consider the two extreme cases (non-transferability and complete transferability) which can be generically and efficiently solved by using very basic cryptographic primitives, as we show in this paper. Then we consider a case with partial transferability, for which we propose a generic solution based on the primitive of distributed ring signatures.     

A representation theorem for (q-)holonomic sequences

Chomsky and Schützenberger showed in 1963 that the sequence _dL(n)$d_L(n)$, which counts the number of words of a given length n in a regular language L, satisfies a linear recurrence relation with constant coefficients for n  , i.e., it is C-finite. It follows that every sequence s(n)$s(n)$ which satisfies a linear recurrence relation with constant coefficients can be represented as _dL1(n)−_dL2(n)$d_{L_1}(n)-d_{L_2}(n)$ for two regular languages. We view this as a representation theorem for C-finite sequences. Holonomic or P-recursive sequences are sequences which satisfy a linear recurrence relation with polynomial coefficients. q-Holonomic sequences are the q-analog of holonomic sequences. In this paper we prove representation theorems of holonomic and q-holonomic sequences based on position specific weights on words, and for holonomic sequences, without using weights, based on sparse regular languages.     

图书馆数字资源和网络安全问题及对策

对于图书馆来说,数字资源和网络安全是非常重要的一个问题,所以一定要采取正确对策和有效措施来对其进行安全管理.本文分析了图书馆资源网络安全的现状,并对如何加强图书馆资源网络安全提出自己的一些建议.     

Parameter estimation of q-Gaussian Radial Basis Functions Neural Networks with a Hybrid Algorithm for binary classification

A classification problem is a decision-making task that many researchers have studied. A number of techniques have been proposed to perform binary classification. Neural networks are one of the artificial intelligence techniques that has had the most successful results when applied to this problem. Our proposal is the use of q-Gaussian Radial Basis Function Neural Networks (q-Gaussian RBFNNs). This basis function includes a supplementary degree of freedom in order to adapt the model to the distribution of data. A Hybrid Algorithm (HA) is used to search for a suitable architecture for the q-Gaussian RBFNN. The use of this type of more flexible kernel could greatly improve the discriminative power of RBFNNs. In order to test performance, the RBFNN with the q-Gaussian basis functions is compared to RBFNNs with Gaussian, Cauchy and Inverse Multiquadratic RBFs, and to other recent neural networks approaches. An experimental study is presented on 11 binary-classification datasets taken from the UCI repository. Moreover, aerial imagery taken in mid-May, mid-June and mid-July was used to evaluate the potential of the methodology proposed for discriminating Ridolfia segetum patches (one of the most dominant and harmful weeds in sunflower crops) in two naturally infested fields in southern Spain.     

Connected sum of digital closed surfaces

During the past 20 years the research of digital surfaces has proceeded to find their properties in the digital space Zⁿ, such as a topological number, a simple k-point, the 3D-Jordan theorem, a k-separating set, a boundary detecting algorithm and so on. Actually, unlike surfaces in a continuous space, the features of digital surfaces have different characteristics. The aim of this paper is to introduce the notion of a digital closed k-surface in Zⁿ, n ? 3, with the general k-adjacency relations as a generalization of Malgouyres’ and Morgenthaler’s k-surfaces in Z³, to establish some minimal simple closed k-surfaces in Z³ and to find their digital topological properties in relation with the k-fundamental group and k-contractibility. Moreover, a connected sum of two digital closed surfaces is introduced and its digital topological properties are investigated.     

一种基于离散对数的数字签名方案

本文分析了RSA签名方案和ELGAMAL签名方案的局限性,提出了一种基于离散对数的高效的数字签名方案。克服了RSA方案效率低下和ELGAMAL方案不能用一个K值对不同文件签名的局限。     

Simulatability and security of certificateless threshold signatures

We analyze the relationship between the notion of certificateless public key cryptography (CL-PKC) and identity-based schemes without a trusted private key generator (PKG), formally define the security of certificateless threshold signatures, and propose a concrete implementation based on bilinear pairings. To exhibit the security of our proposal, we develop the theory of simulatability and relationship between the certificateless threshold signatures and the underlying (non-threshold) ID-based signatures. We show that the proposed scheme is robust and existentially unforgeable against adaptively chosen message attacks under CDH assumption in the random oracle model.     

浅析电子档案的信息安全管理

随着网络的普及和信息技术的发展,人们对电子档案使用需求更加广泛,也对电子档案信息管理要求越来越高。因此,电子档案管理尤其是信息安全管理越来越重要。本文讨论如何确保电子档案信息的质量,并提出几点措施。     

面向结构化数据的数字信息的应用研究

随着信息技术和网络技术的迅猛发展,数字信息尤其是视频数据日益丰富,成为人们获取信息和相互交流的重要方式.但是由于视频数据的数据量非常大、数据的结构复杂以及视频内容非常丰富等特点,使得对视频进行有效的分析和处理变得非常困难.怎样高效的组织、管理和使用这些多媒体数据,逐渐引起了人们的关注.视频检索就是从海量的视频数据中搜索出所需要的视频.对视频监控场景的实时监控预警的需求和对监控视频流基于内容的结构化处理的需求,促使我们开展了基于内容的自动视频监控研究.     

Improvement of a proxy multi-signature scheme without random oracles

A proxy multi-signature scheme permits two or more original singers to delegate their signing powers to the same proxy signer. Recently, Liu et al. proposed the first proxy multi-signature that be proven secure in the standard model [Liu et al. (2008) [20]], which can be viewed as a two-level hierarchical signature due to Waters. However, because of the direct employment of Waters’ signature, their scheme needs a relatively large number of public parameters and is not tightly reduced to the security assumption. In this paper, inspired by Boneh, Boyen’s technique and Waters’ technique, we propose a new proxy multi-signature scheme without random oracles, whose unforgeability can be tightly reduced to the CDH assumption in bilinear groups. The new scheme can be regarded as an improvement to overcome the weaknesses of Liu et al.’s scheme. Compared with Liu et al.’s scheme, the improvement has three merits, tighter security reduction, shorter system parameters and higher efficiency.     

Fuzzy hyperrings (Hv-rings) based on fuzzy universal sets

The aim of this paper is to define and study the concept of a fuzzy hyperring, which depends on the concept of a fuzzy universal set. A correspondence relation between a fuzzy hyperring based on a fuzzy universal set and both ordinary and fuzzy hyperideal in the sense of Davvaz is obtained.     

Improving the performance of k-means for color quantization

Color quantization is an important operation with many applications in graphics and image processing. Most quantization methods are essentially based on data clustering algorithms. However, despite its popularity as a general purpose clustering algorithm, k-means has not received much respect in the color quantization literature because of its high computational requirements and sensitivity to initialization. In this paper, we investigate the performance of k-means as a color quantizer. We implement fast and exact variants of k-means with several initialization schemes and then compare the resulting quantizers to some of the most popular quantizers in the literature. Experiments on a diverse set of images demonstrate that an efficient implementation of k-means with an appropriate initialization strategy can in fact serve as a very effective color quantizer.     

Improving the security level of the FUSION@ multi-agent architecture

The use of architectures based on services and multi-agent systems has become an increasingly important part of the solution set used for the development of distributed systems. Nevertheless, these models pose a variety of problems with regards to security. This article presents the Adaptive Intrusion Detection Multi-agent System (AIDeMaS), a mechanism that has been designed to detect and block malicious SOAP messages within distributed systems built by service based architectures. AIDeMaS has been implemented as part of FUSION@, a multi-agent architecture that facilitates the integration of distributed services and applications to optimize the construction of highly-dynamic multi-agent systems. One of the main features of AIDeMaS is that is employs case-based reasoning mechanisms, which provide it with great learning and adaptation capabilities that can be used for classifying SOAP messages. This research presents a case study that uses the ALZ-MAS system, a multi-agent system built around FUSION@, in order to confirm the effectiveness of AIDeMaS. The preliminary results are presented in this paper.     

Landsat TM/ETM+ and tree-ring based assessment of spatiotemporal patterns of the autumnal moth (Epirrita autumnata) in northernmost Fennoscandia

We used fine-spatial resolution remotely sensed data combined with tree-ring parameters in order to assess and reconstruct disturbances in mountain birch (Betula pubescens) forests caused by Epirrita autumnata (autumnal moth). Research was conducted in the area of Lake Torneträsk in northern Sweden where we utilized five proxy parameters to detect insect outbreak events over the 19th and 20th centuries. Digital change detection was applied on three pairs of multi-temporal NDVI images from Landsat TM/ETM+ to detect significant reductions in the photosynthetic activity of forested areas during disturbed growing seasons. An image segmentation gap-fill procedure was developed in order to compensate missing scan lines in Landsat ETM+ “SLC-off” images. To account for a potential dependence of local outbreak levels on elevation, a digital elevation model was included in the defoliation recognition process. The resulting damage distribution map allowed for the assessment of outbreak intensity and distribution at the stand level and was combined with tree-ring data and historical documents to produce a multi-evidence outbreak detection. Defoliation events in the tree-ring data were recognized as significant deviations from temperature related growth.Our outbreak detection scheme allowed for the reconstruction of nine major insect outbreaks over the past two centuries. The reconstruction proved reliable but only robust for severe defoliation events. Low-intensity incidents were not captured.     

Fuzzy C-means based clustering for linearly and nonlinearly separable data

In this paper we present a new distance metric that incorporates the distance variation in a cluster to regularize the distance between a data point and the cluster centroid. It is then applied to the conventional fuzzy C-means (FCM) clustering in data space and the kernel fuzzy C-means (KFCM) clustering in a high-dimensional feature space. Experiments on two-dimensional artificial data sets, real data sets from public data libraries and color image segmentation have shown that the proposed FCM and KFCM with the new distance metric generally have better performance on non-spherically distributed data with uneven density for linear and nonlinear separation.     

Ranking L-R fuzzy number based on deviation degree

This paper proposed a novel approach to ranking fuzzy numbers based on the left and right deviation degree (L-R deviation degree). In the approach, the maximal and minimal reference sets are defined to measure L-R deviation degree of fuzzy number, and then the transfer coefficient is defined to measure the relative variation of L-R deviation degree of fuzzy number. Furthermore, the ranking index value is obtained based on the L-R deviation degree and relative variation of fuzzy numbers. Additionally, to compare the proposed approach with the existing approaches, five numerical examples are used. The comparative results illustrate that the approach proposed in this paper is simpler and better.     

Service based communication for MPSoC platform-SegBus

MPSoC platforms offer solutions to deal with communication limitations for multiple cores on single chip, but many new issues arise within the context. The SegBus platform is one of the solutions for application deployment on multi-core applications. There are many applications where identical data is transferred from the same source towards different destinations. Multicast services may come as a performance improving factor for the interconnection platform, together with interrupt service.In this paper, the task is to analyze, how different services can be designed for the SegBus platform and observe the improvement in system performance. The designer can select the services according to the requirements. The running example is represented by the H.264 encoder. The SegBus platform architecture, the communication mechanism, the allocation of processing elements on the platform, the communication services and their implementation are the main topics elaborated here.     

Zonal k-l based large eddy simulations

Zonal k-l based large eddy simulation (LES) approaches are presented. To reduce computational demands, near walls, Reynolds averaged Navier-Stokes (RANS) like modelling is used. The interface location for the differing models is either explicitly specified, or, based on length scale compatibility, allowed to naturally locate. With the latter approach the location is strongly grid controlled. When explicitly specified (based on turbulence physics grounds), to enhance results length scale smoothing is implemented. Using standard established LES and RANS model constants the zonal methods are shown to reproduce a satisfactory law of the wall. The approaches are implemented in both cell-vertex and cell-centred codes with similar results being found. Various other sensitivity studies are performed. These show that, as with standard LES, predictions are most sensitive to filter definition, first off wall grid node normal positions and temporal scheme order. For a non-isothermal periodic ribbed channel, the new zonal LES predictions are found to be significantly more accurate than those for an established RANS model and also LES.