Results 1  10
of
1,373
Random Oracles are Practical: A Paradigm for Designing Efficient Protocols
, 1995
"... We argue that the random oracle model  where all parties have access to a public random oracle  provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol P R for the ..."
Abstract

Cited by 1646 (70 self)
 Add to MetaCart
for the random oracle model, and then replacing oracle accesses by the computation of an "appropriately chosen" function h. This paradigm yields protocols much more efficient than standard ones while retaining many of the advantages of provable security. We illustrate these gains for problems including
Paradigms
, 2002
"... (1) Does knowledge of language (grammar) include paradigms (or paradigm structures)? [i.e., above and beyond constituent morphemes & rules / constraints for combining them] Why is this interesting? Morphological theory has largely converged on the answer “no ” (though with important exceptions—s ..."
Abstract
 Add to MetaCart
raising are explained by differences in the languages ’ inflectional paradimgs (influential in acquisition). (Rohrbacher 1999, see also Vikner 1997) “Paradigm Uniformity ” in Phonology: Allomorphy tends to be minimized in a paradigm. This consideration can yield overapplication and override other formal considerations.
Interpolating Subdivision for Meshes with Arbitrary Topology
"... Subdivision is a powerful paradigm for the generation of surfaces of arbitrary topology. Given an initial triangular mesh the goal is to produce a smooth and visually pleasing surface whose shape is controlled by the initial mesh. Of particular interest are interpolating schemes since they match the ..."
Abstract

Cited by 236 (24 self)
 Add to MetaCart
Subdivision is a powerful paradigm for the generation of surfaces of arbitrary topology. Given an initial triangular mesh the goal is to produce a smooth and visually pleasing surface whose shape is controlled by the initial mesh. Of particular interest are interpolating schemes since they match
Simple Efficient Load Balancing algorithms for PeertoPeer Systems
 SPAA'04
, 2004
"... Load balancing is a critical issue for the efficient operation of peertopeer networks. We give two new loadbalancing protocols whose provable performance guarantees are within a constant factor of optimal. Our protocols refine the consistent hashing data structure that underlies the Chord (and Ko ..."
Abstract

Cited by 204 (1 self)
 Add to MetaCart
Koorde) P2P network. Both preserve Chord’s logarithmic query time and nearoptimal data migration cost. Consistent hashing is an instance of the distributed hash table (DHT) paradigm for assigning items to nodes in a peertopeer system: items and nodes are mapped to a common address space, and nodes
Hot topic: physicallayer network coding
 in Proc. of ACM Mobicom
, 2006
"... A main distinguishing feature of a wireless network compared with a wired network is its broadcast nature, in which the signal transmitted by a node may reach several other nodes, and a node may receive signals from several other nodes simultaneously. Rather than a blessing, this feature is treated ..."
Abstract

Cited by 190 (18 self)
 Add to MetaCart
electromagnetic (EM) waves for equivalent coding operation. PNC can yield higher capacity than straightforward network coding when applied to wireless networks. We believe this is a first paper that ventures into EMwavebased network coding at the physical layer and demonstrates its potential for boosting
Attribute Grammars as a Functional Programming Paradigm
 Functional Programming Languages and Computer Architecture, volume 274 of LNCS
, 1987
"... The purpose of this paper is twofold. Firstly we show how attributes in an attribute grammar can be simply and efficiently evaluated using a lazy functional language. The class of attribute grammars we can deal with are the most general ones possible: attributes may depend on each other in an arbitr ..."
Abstract

Cited by 90 (2 self)
 Add to MetaCart
in an arbitrary way, as long as there are no truly circular data dependencies. Secondly, we describe a methodology based on attribute grammars, where, in a fairly straightforward way, we can develop efficient functional programs where direct, conventional solutions yield less efficient programs. We review two
Inference with an incomplete model of english auctions
 JOURNAL OF POLITICAL ECONOMY
, 2003
"... While English auctions are the most common in practice, their rules typically lack sufficient structure to yield a tractable theoretical model without significant abstractions. Rather than relying on one stylized model to provide an exact interpretation of the data, we explore an incomplete model ba ..."
Abstract

Cited by 154 (7 self)
 Add to MetaCart
While English auctions are the most common in practice, their rules typically lack sufficient structure to yield a tractable theoretical model without significant abstractions. Rather than relying on one stylized model to provide an exact interpretation of the data, we explore an incomplete model
Sparser: A paradigm for running distributed algorithms
, 1990
"... This paper introduces a transformer for improving the communication complexity of several classes of distributed algorithms. The transformer takes a distributed algorithm whose message complexity is O(f \Delta m) and produces a new distributed algorithm to solve the same problem with O(f \Delta n lo ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
log n+m log n) message complexity, where n and m are the total number of nodes and links in the network, and f is an arbitrary function of n and m. Applying our paradigm to the standard all shortest paths algorithm [Gal76, Gal82, Seg83] yields a new algorithm which solves the problem in O(n 2 log
Simple forecasts and paradigm shifts
 Journal of Finance
, 2007
"... Abstract: We study the implications of learning in an environment where the true model of the world is a multivariate one, but where agents update only over the class of simple univariate models. If a particular simple model does a poor job of forecasting over a period of time, it is eventually disc ..."
Abstract

Cited by 28 (2 self)
 Add to MetaCart
yields forecastable variation in the size of the value/glamour differential, in volatility, and in the skewness of returns. Some of these features mirror familiar accounts of stockprice bubbles.
An Integration of Model Checking with Automated Proof Checking
, 1995
"... Although automated proof checking tools for generalpurpose logics have been successfully employed in the verification of digital systems, there are inherent limits to the efficient automation of expressive logics. If the expressiveness is constrained, there are useful logic fragments for which effi ..."
Abstract

Cited by 101 (8 self)
 Add to MetaCart
efficient decision procedures can be found. The model checking paradigm yields an important class of decision procedures for establishing temporal properties of finitestate systems. Model checking is remarkably effective for automatically verifying finite automata with relatively small state spaces
Results 1  10
of
1,373