Results 1 - 10 of 45,539

Keying hash functions for message authentication

by Mihir Bellare, Ran Canetti, Hugo Krawczyk , 1996
"... The use of cryptographic hash functions like MD5 or SHA for message authentication has become a standard approach inmanyInternet applications and protocols. Though very easy to implement, these mechanisms are usually based on ad hoc techniques that lack a sound security analysis. We present new cons ..."
Abstract - Cited by 611 (39 self) - Add to MetaCart
constructions of message authentication schemes based on a cryptographic hash function. Our schemes, NMAC and HMAC, are proven to be secure as long as the underlying hash function has some reasonable cryptographic strengths. Moreover we show, in a quantitativeway, that the schemes retain almost all the security

Tractable reasoning and efficient query answering in description logics: The DL-Lite family

by Diego Calvanese, G. De Giacomo, Domenico Lembo, Maurizio Lenzerini, Riccardo Rosati - J. OF AUTOMATED REASONING , 2007
"... We propose a new family of Description Logics (DLs), 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, b ..."
Abstract - Cited by 497 (123 self) - Add to MetaCart
, but also answering complex queries (in particular, unions of conjunctive queries) over the instance level (ABox) of the DL knowledge base. We show that, for the DLs of the DL-Lite family, the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is LogSpace in the size

Fuzzy extractors: How to generate strong keys from biometrics and other noisy data

by Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam Smith , 2008
"... We provide formal definitions and efficient secure techniques for • turning noisy information into keys usable for any cryptographic application, and, in particular, • reliably and securely authenticating biometric data. Our techniques apply not just to biometric information, but to any keying mater ..."
Abstract - Cited by 535 (38 self) - Add to MetaCart
if the input changes, as long as it remains reasonably close to the original. Thus, R can be used as a key in a cryptographic application. A secure sketch produces public information about its input w that does not reveal w, and yet allows exact recovery of w given another value that is close to w. Thus

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

Guide to Elliptic Curve Cryptography

by Aleksandar Jurisic, Alfred J. Menezes , 2004
"... Elliptic curves have been intensively studied in number theory and algebraic geometry for over 100 years and there is an enormous amount of literature on the subject. To quote the mathematician Serge Lang: It is possible to write endlessly on elliptic curves. (This is not a threat.) Elliptic curves ..."
Abstract - Cited by 610 (18 self) - Add to MetaCart
also figured prominently in the recent proof of Fermat's Last Theorem by Andrew Wiles. Originally pursued for purely aesthetic reasons, elliptic curves have recently been utilized in devising algorithms for factoring integers, primality proving, and in public-key cryptography. In this article, we

A New Method for Solving Hard Satisfiability Problems

by Bart Selman, Hector Levesque, David Mitchell - AAAI , 1992
"... We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approac ..."
Abstract - Cited by 730 (21 self) - Add to MetaCart
discussed. GSAT is best viewed as a model-finding procedure. Its good performance suggests that it may be advantageous to reformulate reasoning tasks that have traditionally been viewed as theorem-proving problems as model-finding tasks.

Measuring individual differences in implicit cognition: The implicit association test

by Anthony G. Greenwald, Debbie E. McGhee, et al. - J PERSONALITY SOCIAL PSYCHOL 74:1464–1480 , 1998
"... An implicit association test (IAT) measures differential association of 2 target concepts with an attribute. The 2 concepts appear in a 2-choice task (e.g., flower vs. insect names), and the attribute in a 2nd task (e.g., pleasant vs. unpleasant words for an evaluation attribute). When instructions ..."
Abstract - Cited by 1008 (63 self) - Add to MetaCart
An implicit association test (IAT) measures differential association of 2 target concepts with an attribute. The 2 concepts appear in a 2-choice task (e.g., flower vs. insect names), and the attribute in a 2nd task (e.g., pleasant vs. unpleasant words for an evaluation attribute). When instructions

Structural equation modeling in practice: a review and recommended two-step approach.

by James C Anderson , J L Kellogg , David W Gerbing , Jeanne Brett , Claes Fornell , David Larcker , William Perreault Jr , James Steiger - Psychological Bulletin, , 1988
"... In this article, we provide guidance for substantive researchers on the use of structural equation modeling in practice for theory testing and development. We present a comprehensive, two-step modeling approach that employs a series of nested models and sequential chi-square difference tests. We di ..."
Abstract - Cited by 1825 (3 self) - Add to MetaCart
and confirmatory analysis, the distinction between complementary approaches for theory testing versus predictive application, and some developments in estimation methods also are discussed. Substantive use of structural equation modeling has been growing in psychology and the social sciences. One reason

Dual-task interference in simple tasks: Data and theory

by Harold Pashler - Psychological Bulletin , 1994
"... People often have trouble performing 2 relatively simple tasks concurrently. The causes of this interference and its implications for the nature of attentional limitations have been controversial for 40 years, but recent experimental findings are beginning to provide some answers. Studies of the psy ..."
Abstract - Cited by 434 (12 self) - Add to MetaCart
People often have trouble performing 2 relatively simple tasks concurrently. The causes of this interference and its implications for the nature of attentional limitations have been controversial for 40 years, but recent experimental findings are beginning to provide some answers. Studies

A logic of authentication

by Michael Burrows, Martín Abadi, Roger Needham - ACM TRANSACTIONS ON COMPUTER SYSTEMS , 1990
"... Questions of belief are essential in analyzing protocols for the authentication of principals in distributed computing systems. In this paper we motivate, set out, and exemplify a logic specifically designed for this analysis; we show how various protocols differ subtly with respect to the required ..."
Abstract - Cited by 1332 (22 self) - Add to MetaCart
to suggest improvements to the protocols. The reasoning about some protocols has been mechanically verified. This paper starts with an informal account of the problem, goes on to explain the formalism to be used, and gives examples of its application to protocols from the literature, both with shared-key
Results 1 - 10 of 45,539