29726361
Key Substitution Attacks on Some Provably Secure Signature Schemes
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.
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.
34324862
Signature Schemes Based on 3rd Order Shift Registers
In this paper, we propose two digital signature schemes based on a third order linear feedback shift register. One of them is a normal signature scheme for signing document and the other is with encryption for intended reciever. These two signature schemes are different from most of the signature schemes which are based on discrete logarithm problem, elliptic curves discrete logarithm problem, RSA or quadratic residues. The efficient computational algorithm for computing kth term of a sequence is also presented. The advantage of these two schemes is that the computation is carried out in the ground field and not in an extension field. We also show that the security of these two signature schemes is equivalent to that of Schnorr signature scheme and Signed-ElGamal encryption scheme respectively.
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.
16435152
Comparison-Shopping Websites: An Empirical Investigation on the Influence of Decision Aids and Information Load on Consumer Decision-Making Behavior
Rapid advances in Internet commerce technology have brought about the emergence of comparison-shopping Websites, which act as agents to consolidate vast amounts of product information. Researchers have traditionally focused on incorporating the latest database interrogation technology and investigating the economic implications of the existence of comparison-shopping Websites. Little attention has been paid to understanding whether the decision aids provided are capable of assisting a consumer in managing a large quantity of information or, more importantly, are compatible with the decision-making behavior of the consumer. This study surveys several successful comparison-shopping Websites, enumerates two comercially successful forms of decision aids (i.e., screening and sorting), and examines their effects on decision effectiveness under different information loads. Based on a 3×2×2 factorial controlled experiment, we had three major findings. First, more sophisticated screening aids that assist a consumer in filtering a large quantity of information do not necessarily improve decision effectiveness. Surprisingly, our results even suggest that in some circumstances the opposite could be true. Second, the results indicate that the effectiveness of decision aids, to a large extent, depends on the information load. Third, decision makers are adaptive. One may supplement the absence of more sophisticated screening aids with the sorting aid.
976740
Adaptive Region Growing Color Segmentation for Text Using Irregular Pyramid
This paper presents the result of an adaptive region growing segmentation technique for color document images using an irregular pyramid structure. The emphasis is in the segmentation of textual components for subsequence extraction in document analysis. The segmentation is done in the RGB color space. A simple color distance measurement and a category of color thresholds are derived. The proposed method utilizes a hybrid approach where color feature based clustering followed by detailed region based segmentation is performed. Clustering is done by merging image color points surrounding a color seed selected dynamically. The clustered regions are then put through a detailed segmentation process where an irregular pyramid structure is utilized. Dynamic and repeating selection of the most suitable seed region, fitting changing local condition during the segmentation, is implemented. The growing of regions is done through the use of multiple seeds growing concurrently. The algorithm is evaluated according to 2 factors and compared with an existing method. The result is encouraging and demonstrates the ability and efficiency of our algorithm in achieving the segmentation task.
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.
37083232
A connectionist shell for developing expert decision support systems
Presents the architecture of a hybrid neural network expert system shell. The system, structured around the concept of network elements, is aimed at preserving the semantic structure of the expert system rules while incorporating the learning capability of neural networks into the inferencing mechanism. Using this architecture, every rule of the knowledge base is represented by a one or two-layer neural network element. These network elements are dynamically linked up to form the rule-tree during the inferencing process. The system is also able to adjust its inference strategy according to different users and situations. An editor is also provided to enable easy maintenance of the neural network rule elements. The shell is housed in a user-friendly rule-based interface. Two applications that are built upon the abovementioned shell are discussed, they demonstrate the strengths of the network element architecture over conventional rule-based systems.
16019676
A Distributed Throttling Approach for Handling High Bandwidth Aggregates
Public-access networks need to handle persistent congestion and overload caused by high bandwidth aggregates that may occur during times of flooding-based DDoS attacks or flash crowds. The often unpredictable nature of these two activities can severely degrade server performance. Legitimate user requests also suffer considerably when traffic from many different sources aggregates inside the network and causes congestion. This paper studies a family of algorithms that "proactively" protect a server from overload by installing rate throttles in a set of upstream routers. Based on an optimal control setting, we propose algorithms that achieve throttling in a distributed and fair manner by taking important performance metrics into consideration, such as minimizing overall load variations. Using ns-2 simulations, we show that our proposed algorithms 1) are highly adaptive by avoiding unnecessary parameter configuration, 2) provide max-min fairness for any number of throttling routers, 3) respond very quickly to network changes, 4) are extremely robust against extrinsic factors beyond the system control, and 5) are stable under given delay bounds.