11495874
A new electronic cash model
Credit card is currently the most popular electronic payment method on the Internet, but it is not an ideal method from the security and privacy point of view. Electronic cash solves many inherent problems of credit card, such as anonymity and off-line payment, and is widely accepted as an ideal electronic payment method. However, there are issues that are yet to be satisfactorily solved, such as fair traceability and double-spending prevention of off-line schemes. In this paper, we present a customer generated electronic cash model that offers unique trade-off between credit card and traditional off-line electronic cash systems. This model provides anonymity for customers and is technically more secure than credit card systems. It eliminates the withdrawal phase of electronic cash systems, thus it is more convenient for customers to use. In addition, fair traceability is provided in case crimes take place.
16363078
Low-power group key agreement for heterogeneous wireless networks
Heterogeneous wireless networks are gaining popularity as users can be connected to these networks without any cables and even when they are mobile. The high power nodes in heterogeneous wireless networks do not have energy constraints but the user nodes, which can be large in numbers, are usually low power energy constrained devices. Therefore, the GKA protocol used to secure group communications in these networks has to take into consideration both the low power nature of the user nodes and the network size. In this paper, we present an energy efficient and scalable GKA protocol, which uses our proposed Contributory Ring-Centralized (ContRi-Central) group model. Besides providing complexity analysis, we also show the computational and communication energy consumption costs analysis of all nodes running our proposed scheme and four other efficient GKA protocols. Both the complexity analysis and energy consumption costs analysis indicate that our proposed scheme is more efficient and suitable for heterogeneous wireless networks.
1033402
Energy-efficient ID-based group key agreement protocols for wireless networks
One useful application of wireless networks is for secure group communication, which can be achieved by running a group key agreement (GKA) protocol. One well-known method of providing authentication in GKA protocols is through the use of digital signatures. Traditional certificate-based signature schemes require users to receive and verify digital certificates before verifying the signatures but this process is not required in ID-based signature schemes. In this paper, we present an energy-efficient ID-based authenticated GKA protocol and four energy-efficient ID-based authenticated dynamic protocols, namely join, leave, merge and partition protocol, to handle dynamic group membership events, which are frequent in wireless networks. We provide complexity and energy cost analysis of our protocols and show that our protocols are more energy-efficient and suitable for wireless networks.
29726361
Key Substitution Attacks on Some Provably Secure Signature Schemes
14690689
Analysis of improved signcryption scheme with key privacy
In this paper, we analyse the Yang-Wong-Deng signcryption scheme [G. Yang, D.S. Wong, X. Deng, Analysis and improvement of a signcryption scheme with key privacy, in: Information Security Conference--ISC'05, in: Lecture Notes in Comput. Sci., vol. 3650, Springer-Verlag, Berlin, 2005, pp. 218-232] proposed in ISC'05, which is the improvement and enhancement of the security of Libert-Quisquater signcryption scheme [B. Libert, J.J. Quisquater, Efficient signcryption with key privacy from gap Diffie-Hellman groups, in: Public Key Cryptography--PKC'04, in: Lecture Notes in Comput. Sci., vol. 2947, Springer-Verlag, Berlin, 2004, pp. 187-200]. Although Yang et al. [G. Yang, D.S. Wong, X. Deng, Analysis and improvement of a signcryption scheme with key privacy, in: Information Security Conference--ISC'05, in: Lecture Notes in Comput. Sci., vol. 3650, Springer-Verlag, Berlin, 2005, pp. 218-232] proved that their scheme is secure against adaptive chosen ciphertext attacks and achieves ciphertext anonymity (which is also called key privacy) in the random oracle model; we disprove all their claims and show that their scheme is not semantically secure and does not achieve ciphertext anonymity.
15032270
Authenticated Broadcast Encryption Scheme
With the advancement of wireless networks and mobile access devices such as cell phones and PDAs, multimedia services could be offered through wireless broadcast networks to these mobile devices. Therefore, there is a need to securely deliver multimedia content/data to many users over an insecure channel. Broadcast encryption scheme could provide this solution. The first formal study of broadcast encryption scheme is by Fiat and Noar in 1993. Since then, many broadcast encryption schemes have been proposed to improve the efficiency which is measured by three parameters, that is, length of transmission messages, users' storage and computational overhead at a user device. Some broadcast encryption schemes require less users storage, but the length of transmission messages or computation overhead depends on the number of users. In this paper, we proposed an authenticated broadcast encryption scheme which has an additional property than current proposed broadcast encryption schemes, that is, all users can verify who the sender is. The proposed scheme is proved to be secure against chosen ciphertext attacks based on the decision l-bilinear Diffie-Hellman exponent assumption. Furthermore, the simulation results, transmission messages nearly independent of the number of users and reasonable user storage show that the proposed authenticated broadcast encryption scheme is efficient and suitable for mobile devices.
8582128
Warped image restoration with applications to digital libraries
Recently, high resolution digital cameras have made the digitization process more flexible and convenient than traditional scanning technology. Therefore, document image analysis techniques need to be extended to handle images captured using ordinary hand-held cameras under an uncontrolled environment. In this paper, we propose an image restoration technique that corrects various warping distortions such as rolling curl, binding curl and fold distortions in camera images of geometrically distorted documents. Our goal is to restore these arbitrarily warped document images to a planar shape so as to facilitate OCR. Our method uses spline interpolation technique based on a ruled surface model constructed from text lines in the 2D document image. Comparisons on OCR performance using Microsoft imaging software with two existing methods show an encouraging improvement in terms of recall and precision. The OCR precision on the corrected images using our method is improved up to 21.8% comparing to original images with a resolution of 3 mega pixels.
37532392
GA-based supervised learning of Neocognitron
Supervised learning of Neocognitron is fulfilled by presenting training patterns, which map to specified features. However, the training patterns and many parameters are designed empirically and set manually in Fukushima's Neocognitron. In this paper, we use genetic algorithms (GAs) to tune the parameters of Neocognitron and search its reasonable training pattern sets. First of all, the correlation amongst the training patterns is considered as a critical factor affecting Neocognitron's performance, but it is ignored in the design of the original Neocognitron. Then, a GA-based supervised learning of the Neocognitron is proposed to tune the parameters and search training patterns. The results prove that the performance of a Neocognitron is sensitive to its training patterns, selectivity and receptive fields, and can be improved by this supervised learning on the basis of GAs and correlation analysis.
526503
Multi-Criteria-based Active Learning for Named Entity Recognition
In this paper, we propose a multi-criteria-based active learning approach and effectively apply it to named entity recognition. Active learning targets to minimize the human annotation efforts by selecting examples for labeling. To maximize the contribution of the selected examples, we consider the multiple criteria: informativeness, representativeness and diversity and propose measures to quantify them. More comprehensively, we incorporate all the criteria using two selection strategies, both of which result in less labeling cost than single-criterion-based method. The results of the named entity recognition in both MUC-6 and GENIA show that the labeling cost can be reduced by at least 80% without degrading the performance.
18896239
Improving Pronoun Resolution by Incorporating Coreferential Information of Candidates
Coreferential information of a candidate, such as the properties of its antecedents, is important for pronoun resolution because it reflects the salience of the candidate in the local discourse. Such information, however, is usually ignored in previous learning-based systems. In this paper we present a trainable model which incorporates coreferential information of candidates into pronoun resolution. Preliminary experiments show that our model will boost the resolution performance given the right antecedents of the candidates. We further discuss how to apply our model in real resolution where the antecedents of the candidate are found by a separate noun phrase resolution module. The experimental results show that our model still achieves better performance than the baseline.
17358409
A case study on using neural networks to perform technical forecasting of forex
This paper reports empirical evidence that a neural network model is applicable to the prediction of foreign exchange rates. Time series data and technical indicators, such as moving average, are fed to neural networks to capture the underlying ‘rulesa of the movement in currency exchange rates. The exchange rates between American Dollar and "ve other major currencies, Japanese Yen, Deutsch Mark, British Pound, Swiss Franc and Australian Dollar are forecast by the trained neural networks. The traditional rescaled range analysis is used to test the ‘e$ciencya of each market before using historical data to train the neural networks. The results presented here show that without the use of extensive market data or knowledge, useful prediction can be made and signi"cant paper pro"ts can be achieved for out-of-sample data with simple technical indicators. A further research on exchange rates between Swiss Franc and American Dollar is also conducted. However, the experiments show that with e$cient market it is not easy to make pro"ts using technical indicators or time series input neural networks. This article also discusses several issues on the frequency of sampling, choice of network architecture, forecasting periods, and measures for evaluating the model’s predictive power. After presenting the experimental results, a discussion on future research concludes the paper. ( 2000 Elsevier Science B.V. All rights reserved.