39519625
A CCA2 Secure Key Encapsulation Scheme Based on 3rd Order Shift Registers
In 1998, Cramer and Shoup proposed the first practical and provable cryptosystem against adaptive chosen ciphertext attack under the standard assumption in the standard model, that is, decisional Diffie-Hellman assumption. Recently, Lucks extended the Cramer-Shoup cryptosystem to a group of quadratic residues modulo a composite number and showed that the scheme is provably secure in the standard model. In this paper, we extend Lucks' key encapsulation scheme to a third order linear feedback shift register and is based on a new assunmption which is called shift register based decisional Diffie-Hellman assumptions (SR-DDH). The proposed scheme is provably secure against adaptive chosen ciphertext attack based on the hardness of shift register based decisional Diffie-Hellman assumption in the standard model and not in random oracle model. Furthermore, the size of public key and ciphertext are shorter than Cramer-Shoup cryptosystem and the computational complexity is also more efficient than Cramer-Shoup cryptosystem and Lucks scheme.
42190700
Key Substitution Attacks on Provably Secure Short Signature Schemes
Recently, Boneh et al. proposed provably secure short signature schemes in the standard model and in the random oracle model respectively. In this letter, we propose strong-key substitution attacks on these signature schemes. In one of the attacks, we show that an adversary can generate a new public key satisfying all legitimate signatures created by the legitimate signer.
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.
17840852
A secure signature scheme
Digital signature is commonly used for authentication. So, it is important to design a signature with a security proof. In 1999, Gennaro et al. and Cramer et al. respectively proposed practical and provably secure signature schemes under the standard assumption without the random oracle model. Since then, some provably secure signature schemes in the standard model were constructed, for example, Camenisch-Lysyanskaya scheme in 2002; Fischlin scheme and Tan-Yi-Siew scheme in 2003. In this paper, we construct a new provably secure signature scheme based on the strong RSA assumption against existential forgery under adaptive chosen message attack in the standard model. The proposed scheme is also more efficient than other provable secure schemes in the standard model.
29726361
Key Substitution Attacks on Some Provably Secure Signature Schemes
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.
8892217
Improving Noun Phrase Coreference Resolution by Matching Strings
In this paper we present a noun phrase coreference resolution system which aims to enhance the identification of the coreference realized by string matching. For this purpose, we make two extensions to the standard learn-ing-based resolution framework. First, to improve the recall rate, we introduce an additional set of features to capture the different matching patterns between noun phrases. Second, to improve the precision, we modify the instance selection strategy to allow non-anaphors to be included during training instance generation. The evaluation done on MEDLINE data set shows that the combination of the two extensions provides significant gains in the F-measure.
755180
Document clustering based on cluster validation
This paper presents a cluster validation based document clustering algorithm, which is capable of identifying both important feature words and true model order (cluster number). Important feature subset is selected by optimizing a cluster validity criterion subject to some constraint. For achieving model order identification capability, this feature selection procedure is conducted for each possible value of cluster number. The feature subset and cluster number which maximize the cluster validity criterion are chosen as our answer. We have applied our algorithm to several datasets from 20Newsgroup corpus. Experimental results show that our algorithm can find important feature subset, estimate the model order and yield higher micro-averaged precision than other four document clustering algorithms which require cluster number to be provided.
15710341
Motion deblurring for optical character recognition
This paper investigates the problem of blurring caused by motion during image capture of text documents. Motion blurring prevents proper optical character recognition of the document text contents. One area of such applications is to deblur name card images obtained from handheld cameras. In this paper, a complete motion deblurring procedure for document images has been proposed. The method handles both uniform linear motion blur and uniform acceleration motion blur. Experiments on synthetic and real-life blurred images prove the feasibility and reliability of this algorithm provided that the motion is not too irregular. The restoration procedure consumes only small amount of computation time.
9012238
Improved nearest neighbor based approach to accurate document skew estimation
The nearest-neighbor based document skew detection methods do not require the presence of a predominant text area, and are not subject to skew angle limitation. However, the accuracy of these methods is not perfect in general. In this paper, we present an improved nearest-neighbor based approach to perform accurate document skew estimation. Size restriction is introduced to the detection of nearest-neighbor pairs. Then the chains with a largest possible number of nearest-neighbor pairs are selected, and their slopes are computed to give the skew angle of document image. Experimental results on various types of documents containing different linguistic scripts and diverse layouts show that the proposed approach has achieved an improved accuracy for estimating document image skew angle and has an advantage of being language independent.
5370765
Skew estimation for scanned documents from "noises"
The vast majority of the published skew estimation methods for scanned document images are for textual documents. These methods are based on the principle that the skew angles can be derived from the presence of the obvious text lines. The non-textual objects, such as line drawings, photographic inserts, scan artifacts including the dark bars around the borders and the center spine of bounded materials, and media contaminations are considered as "noises", thus are subject to elimination. Skew estimators that work in the presence of excessive noises are considered robust. This paper presents a skew estimation method that is based on the straight lines or edges. It uses the Muff Transform with a probe-line mapping scheme for feature identification. Various strategies for optimized line probing are devised. This method is applicable to both textual and graphical documents scanned with ordinary scanners or copiers under normal conditions. Selected images from the University of Washington English document image database I (UWDB-I) are used for its usability evaluation.