Titlebook: Information Security and Cryptology - ICISC 2001; 4th International Co Kwangjo Kim Conference proceedings 2002 Springer-Verlag Berlin Heide

駁船

賞心悅目

Decentralized Event Correlation for Intrusion Detection,ct such attacks therefore have to collect and correlate information from different sources. We propose a completely decentralized approach to solve the task of event correlation and information fusing of data gathered from multiple points within the network..Our system models an intrusion as a patte

goodwill

Enhancing the Security of Cookies, in a user’s shopping cart to authentication information used for accessing restricted pages. While cookies are clearly very useful, they can also be abused. In this paper, security threats that cookies can pose to a user are identified, as are the security requirements necessary to defeat them. Var

吼叫

A New Stack Buffer Overflow Hacking Defense Technique with Memory Address Confirmation,ack systems and servers by hackers very frequently. Recently, many researches tried to prevent it, and several solutions were developed such as Libsafe and StackGuard; however, these solutions have a few problems. In this paper we present a new stack buffer overflow attack prevention technique that

考得

Arboreal

Binary Codes for Collusion-Secure Fingerprinting,iderations, the pirates’ probablity of success (which must be non-zero, as was shown by Boneh and Shaw) on one hand, and decoding complexity on the other. We show how to minimize the pirates’ probability of success: but the associated decoding complexity is .(. .), where . is the number of users. Ne

cogitate

Copyright Protection of Object-Oriented Software,rmarks on three “orthogonal” levels. For the first level, watermarks are injected into objects. The second level watermarking is used to select proper variants of the source code. The third level uses transition function that can be used to generate copies with different functionalities. Generic wat

MEN

使害羞

Slide Attacks with a Known-Plaintext Cryptanalysis,yzing on the other part, the key scheduling part, are known. A slide attack is an instance of attacks exploiting the key schedule weakness. In this paper, currently proposed slide attacks can be still enhanced so that all currently published known-plaintext analytic technique can be applied to small

faultfinder

Constructions of Cheating Immune Secret Sharing,submit invalid shares to the combiner. In the second one, the cheaters collectively decide which shares are to be modified so the combiner gets a mixture of valid and invalid shares from the cheaters. The secret scheme is said to be .-cheating immune if any group of . cheaters has no advantage over