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
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.
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.
46716117
Public-Key Encryption from ID-Based Encryption Without One-Time Signature
Design a secure public key encryption scheme and its security proof are one of the main interests in cryptography In 2004, Canetti, Halevi and Katz [8] constructed a public key encryption (PKE) from a selective identity-based encryption scheme with a strong one-time signature scheme In 2005, Boneh and Katz [6] improved Canetti-Halevi-Katz construction by replacing a strong one-time signature with a message authentication code, but it is not publicly verifiable Later, Boyen, Mei and Waters [7] constructed PKE scheme directly from Waters' IBE scheme [17] , which is only secure against direct chosen-ciphertext attack and is not secure against adaptive chosen-ciphertext attack In 2006, Tan [16] further improved the efficiency of Canetti-Halevi-Katz (CHK) construction by directly from Boneh-Boyen identity based encryption (IBE) scheme [4] with a weak one-time signature In this paper, we construct an efficient public key encryption scheme without one-time signature, which preserves a publicly verifiable property and secure against adaptive chosen-ciphertext attack The construction of the proposed scheme is based on Boneh-Boyen identity-based encryption (IBE) scheme [2] and a trapdoor function We also show that the proposed scheme is more efficient than CHK construction.
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.
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.
5888234
Text extraction from name cards with complex design
This paper addresses the problem of text extraction from name card images with fanciful design containing complicated color background and reverse contrast regions. The proposed method is based on special edge detection followed by grouping of edges based on size, orientation and color attributes. The difficulties from color complexity caused by background color variation or reverse contrast are overcome by edge detection and color histogram. The grouping of edges filters out the background textures or graphical objects. The final detected text grouping is then binarized for OCR. Experimental results show improved text extraction in comparison with a conventional method.
1384774
Elliptic arc vectorization for 3D pie chart recognition
In this paper, we present a novel approach to vectorize elliptic arcs for 3D pie chart recognition and data extraction. As a preprocessing step, a set of straight line segments are obtained first. By estimating the parameters based on the line segments, we are able to generate elliptic arc candidates. Curve fitting is then performed to reject false positives and further refine the parameters of each elliptic arc. The vectorized elliptic arcs are the key components in the 3D pie charts that allow us to determine the chart type and to extract data values embedded. Experiments using a group of testing images show that the proposed method works well and is computationally efficient.
15296395
Knowledge Representation Issues in Information Extraction
The advent of computing has exacerbated the problem of overwhelming information. Advanced information management strategies such as Information Extraction, Information Filtering, Information Retrieval, and Text Categorization are becoming important to manage the deluge of information. Information Extraction (IE) systems can be used to automatically extract relevant information from free-form text for update to databases or for report generation. This paper describes the major challenge of knowledge representation issues in an information extraction task-representing the meaning of the input text, the knowledge of the field of application (or domain application) and the knowledge about the target information to be extracted. In this research, we have chosen a directed graph structure to represent the input text meaning, a domain ontology to represent the domain application and a frame representation to capture the target information to be extracted. We discuss in this paper how these knowledge structures interplay to perform the task of information extraction.
15370586
Exploiting Hidden Convexity For Flexible And Robust Resource Allocation In Cellular Networks
A systematic approach to solve seemingly nonconvex resource allocation problems in wireless cellular networks is studied in this paper. By revealing and exploiting the hidden convexity in the problem formulations, we obtain solutions that can tackle a variety of objective functions, provide robustness to resource allocations such as power, and be obtained often through distributed algorithms. The advantages of such flexibility and robustness are demonstrated through comparisons with the state-of-the-art in recent research literature. First we show how to distributively solve a variety of resource allocation problems in CDMA and interference limited CDMA channels with quality of service constraints, such as meeting minimum queueing delay or energy per bit requirement. Then, for uplink transmission in a CDMA cellular network, we propose an optimal power control scheme with congestion-aware active link protection. In particular, the tradeoff between power expenditure and the protection margin of the SIR-balancing power algorithm is optimized.