Results 11  20
of
10,351
Short Signatures without Random Oracles
, 2004
"... We describe a short signature scheme which is existentially unforgeable under a chosen message attack without using random oracles. The security of our scheme depends on a new complexity assumption we call the Strong Di#eHellman assumption. This assumption has similar properties to the Strong RS ..."
Abstract

Cited by 393 (11 self)
 Add to MetaCart
RSA assumption, hence the name. Strong RSA was previously used to construct signature schemes without random oracles. However, signatures generated by our scheme are much shorter and simpler than signatures from schemes based on Strong RSA.
The Determinants of Credit Spread Changes.
 Journal of Finance
, 2001
"... ABSTRACT Using dealer's quotes and transactions prices on straight industrial bonds, we investigate the determinants of credit spread changes. Variables that should in theory determine credit spread changes have rather limited explanatory power. Further, the residuals from this regression are ..."
Abstract

Cited by 422 (2 self)
 Add to MetaCart
changes are determined by changes in these state variables. Hence, structural models generate predictions for what the theoretical determinants of credit spread changes should be, and moreover offer a prediction for whether changes in these variables should be positively or negatively correlated
Experimental evaluation of wireless simulation assumptions
, 2004
"... All analytical and simulation research on ad hoc wireless networks must necessarily model radio propagation using simplifying assumptions. A growing body of research, however, indicates that the behavior of the protocol stack may depend significantly on these underlying assumptions. The standard res ..."
Abstract

Cited by 260 (12 self)
 Add to MetaCart
networks, radio behavior in mobile network deployments is a much lessstudied topic. We then reproduce our experimental setup in our simulator, and generate the same applicationlayer metrics under progressively smaller sets of these assumptions. By comparing the simulated outcome to the outcome of our
How to Use Expert Advice
 JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY
, 1997
"... We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called experts. Our analysis is for worstcase situations, i.e., we make no assumptions about the way the sequence of bits to be predicted is generated. We measure the performance of the ..."
Abstract

Cited by 377 (79 self)
 Add to MetaCart
We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called experts. Our analysis is for worstcase situations, i.e., we make no assumptions about the way the sequence of bits to be predicted is generated. We measure the performance
Negotiation decision functions for autonomous agents
 International Journal of Robotics and Autonomous Systems
, 1998
"... We present a formal model of negotiation between autonomous agents. The purpose of the negotiation is to reach an agreement about the provision of a service by one agent for another. The model de nes a range of strategies and tactics that agents can employ to generate initial o ers, evaluate proposa ..."
Abstract

Cited by 359 (58 self)
 Add to MetaCart
We present a formal model of negotiation between autonomous agents. The purpose of the negotiation is to reach an agreement about the provision of a service by one agent for another. The model de nes a range of strategies and tactics that agents can employ to generate initial o ers, evaluate
Reflective and impulsive determinants of social behavior
 Personality and Social Psychology Review
, 2004
"... This article describes a 2systems model that explains social behavior as a joint function of reflective and impulsive processes. In particular, it is assumed that social behavior is controlled by 2 interacting systems that follow different operating principles. The reflective system generates behav ..."
Abstract

Cited by 365 (5 self)
 Add to MetaCart
This article describes a 2systems model that explains social behavior as a joint function of reflective and impulsive processes. In particular, it is assumed that social behavior is controlled by 2 interacting systems that follow different operating principles. The reflective system generates
A Comparison Of Various Frontier Estimation Methods Under Differing Data Generation Assumptions
"... Monte Carlo methods examine the accuracy of several production frontier approximating forms, estimators and methods to rank firms by level of predicted technical efficiency. Results show stochastic frontier methods superior to data envelopment analysis. The CobbDouglas approximating form is superio ..."
Abstract
 Add to MetaCart
Monte Carlo methods examine the accuracy of several production frontier approximating forms, estimators and methods to rank firms by level of predicted technical efficiency. Results show stochastic frontier methods superior to data envelopment analysis. The CobbDouglas approximating form is superior to the translog or generalized Leontief. Presented as a selected paper at the Southern Agricultural Economics Association annual
Learning assumptions for compositional verification
, 2003
"... Compositional verification is a promising approach to addressing the state explosion problem associated with model checking. One compositional technique advocates proving properties of a system by checking properties of its components in an assumeguarantee style. However, the application of this t ..."
Abstract

Cited by 140 (20 self)
 Add to MetaCart
of this technique is difficult because it involves nontrivial human input. This paper presents a novel framework for performing assumeguarantee reasoning in an incremental and fully automated fashion. To check a component against a property, our approach generates assumptions that the environment needs to satisfy
Proofs of partial knowledge and simplified design of witness hiding protocols
, 1994
"... Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S on n participants. Then under certain assumptions on P and S, we show how to transform P into a witness indistinguishab ..."
Abstract

Cited by 335 (14 self)
 Add to MetaCart
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S on n participants. Then under certain assumptions on P and S, we show how to transform P into a witness
Mining timechanging data streams
 IN PROC. OF THE 2001 ACM SIGKDD INTL. CONF. ON KNOWLEDGE DISCOVERY AND DATA MINING
, 2001
"... Most statistical and machinelearning algorithms assume that the data is a random sample drawn from a stationary distribution. Unfortunately, most of the large databases available for mining today violate this assumption. They were gathered over months or years, and the underlying processes genera ..."
Abstract

Cited by 338 (5 self)
 Add to MetaCart
Most statistical and machinelearning algorithms assume that the data is a random sample drawn from a stationary distribution. Unfortunately, most of the large databases available for mining today violate this assumption. They were gathered over months or years, and the underlying pro
Results 11  20
of
10,351