Results 1 - 10 of 4,374

Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems

by Paul C. Kocher , 1996
"... By carefully measuring the amount of time required to perform private key operations, attackers may be able to find fixed Diffie-Hellman exponents, factor RSA keys, and break other cryptosystems. Against a vulnerable system, the attack is computationally inexpensive and often requires only known cip ..."
Abstract - Cited by 651 (3 self) - Add to MetaCart
By carefully measuring the amount of time required to perform private key operations, attackers may be able to find fixed Diffie-Hellman exponents, factor RSA keys, and break other cryptosystems. Against a vulnerable system, the attack is computationally inexpensive and often requires only known

Frequent Subgraph Discovery

by Michihiro Kuramochi, George Karypis , 2001
"... Over the years, frequent itemset discovery algorithms have been used to solve various interesting problems. As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the requirement of th ..."
Abstract - Cited by 406 (10 self) - Add to MetaCart
transactions and it is able to discover frequent subgraphs from a set of graph transactions reasonably fast, even though we have to deal with computationally hard problems such as canonical labeling of graphs and subgraph isomorphism which are not necessary for traditional frequent itemset discovery.

Skyscraper broadcasting: A new broadcasting scheme for metropolitan video-on-demand systems

by Kien A. Hua, Simon Sheu , 1997
"... We investigate a novel multicast technique, called Skyscraper Broadcasting (SB), for video-on-demand applications. We discuss the data fragmentation technique, the broadcasting strategy, and the client design. We also show the correctness of our technique, and derive mathematical equations to analyz ..."
Abstract - Cited by 307 (20 self) - Add to MetaCart
to analyze its storage requirement. To assess its performance, we compare it to the latest designs known as Pyramid Broadcasting (PB) and Permutation-Based Pyramid Broadcasting (PPB). Our study indicates that PB offers excellent access latency. However, it requires very large storage space and disk bandwidth

Limiting Privacy Breaches in Privacy Preserving Data Mining

by Alexandre Evfimievski, Johannes Gehrke, Ramakrishnan Srikant - In PODS , 2003
"... There has been increasing interest in the problem of building accurate data mining models over aggregate data, while protecting privacy at the level of individual records. One approach for this problem is to randomize the values in individual records, and only disclose the randomized values. The mod ..."
Abstract - Cited by 301 (11 self) - Add to MetaCart
. The model is then built over the randomized data, after first compensating for the randomization (at the aggregate level). This approach is potentially vulnerable to privacy breaches: based on the distribution of the data, one may be able to learn with high confidence that some of the randomized records

Revocation and Tracing Schemes for Stateless Receivers

by Dalit Naor, Moni Naor, Jeff Lotspiech , 2001
"... Abstract. We deal with the problem of a center sending a message to a group of users such that some subset of the users is considered revoked and should not be able to obtain the content of the message. We concentrate on the stateless receiver case, where the users do not (necessarily) update their ..."
Abstract - Cited by 250 (5 self) - Add to MetaCart
Subset-Cover revocation algorithms; these algorithms are very flexible and work for any number of revoked users. The schemes require storage at the receiver of log N and 1 2 log2 N keys respectively (N is the total number of users), and in order to revoke r users the required message lengths are of r log

A Language Independent Approach for Detecting Duplicated Code

by Stéphane Ducasse, Matthias Rieger, Serge Demeyer , 1999
"... Code duplication is one of the factors that severely complicates the maintenance and evolution of large software systems. Techniques for detecting duplicated code exist but rely mostly on parsers, technology that has proven to be brittle in the face of different languages and dialects. In this paper ..."
Abstract - Cited by 241 (19 self) - Add to MetaCart
. In this paper we show that is possible to circumvent this hindrance by applying a language independent and visual approach, i.e. a tool that requires no parsing, yet is able to detect a significant amount of code duplication. We validate our approach on a number of case studies, involving four different

DL-Lite: Tractable description logics for ontologies

by Diego Calvanese, Domenico Lembo, Maurizio Lenzerini, Riccardo Rosati - In Proc. of AAAI 2005 , 2005
"... We propose a new Description Logic, called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base, but also answering ..."
Abstract - Cited by 211 (49 self) - Add to MetaCart
complex queries (in particular, conjunctive queries) over the set of instances maintained in secondary storage. We show that in DL-Lite the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is polynomial in the size of the ABox (i.e., in data complexity). To the best

Reason!able Across the Curriculum

by Tim Van Gelder, A. Rizzo , 2001
"... The Reason!Able software helps students acquire general skills of reasoning and argument. Developed over a number of years at the University of Melbourne, the software is now widely used in schools and universities. This paper illustrates Reason!Able in use, then describes some of the underlying edu ..."
Abstract - Cited by 11 (0 self) - Add to MetaCart
educational principles, results from a recent study evaluating learning in students using Reason!Able, and ways Reason!Able is being used at Melbourne Grammar School. Background How can we help students reason better? This is an important question. Strong thinking skills are increasingly required

Behavior Protocols for Software Components

by Frantisek Plasil, Stanislav Visnovsky - IEEE Transactions on Software Engineering , 2002
"... In this paper, we propose a means to enhance an architecture description language with a description of component behavior. A notation used for this purpose should be able to express the "interplay" on the component's interfaces and reflect step-by-step refinement of the component& ..."
Abstract - Cited by 212 (32 self) - Add to MetaCart
In this paper, we propose a means to enhance an architecture description language with a description of component behavior. A notation used for this purpose should be able to express the "interplay" on the component's interfaces and reflect step-by-step refinement of the component

A SCATTER STORAGE SCHEME FOR DICTIONARY LOOKUPS

by unknown authors
"... Scatter storage schemes are examined with respect to their applicability to dictionary lookup procedures. Of particular interest are virtual scatter methods which combine the advantages of rapid search speed and reason- • able storage requirements. The theoretical aspects of computing hash addresses ..."
Abstract - Add to MetaCart
Scatter storage schemes are examined with respect to their applicability to dictionary lookup procedures. Of particular interest are virtual scatter methods which combine the advantages of rapid search speed and reason- • able storage requirements. The theoretical aspects of computing hash
Results 1 - 10 of 4,374