Sciweavers

1871 search results - page 357 / 375
» The Ephemeral Pairing Problem
Sort
View
FOCS
2000
IEEE
15 years 9 months ago
How Bad is Selfish Routing?
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency ...
Tim Roughgarden, Éva Tardos
EUROCRYPT
1997
Springer
15 years 9 months ago
Oblivious Transfers and Privacy Amplification
Oblivious transfer (OT) is an important primitive in cryptography. In chosen one-out-of-two string OT, a sender offers two strings, one of which the other party, called the receive...
Gilles Brassard, Claude Crépeau
COMPCON
1995
IEEE
15 years 9 months ago
IEEE 1394: A Ubiquitous Bus
A link is an unreliable FIFO channel. As we mentioned earlier, it is an abstraction of a point-topoint wire or of a simple broadcast LAN. It is unreliable because noise or other ph...
Gary Hoffman, Daniel Moore
EDBT
2009
ACM
126views Database» more  EDBT 2009»
15 years 9 months ago
A tool for mapping discovery over revealing schemas
In a world of wide-scale information sharing, the decentralized coordination has to consolidate a variety of heterogeneity. Shared data are described in different formats, i.e. da...
Verena Kantere, Dimos Bousounis, Timos K. Sellis
CSFW
2010
IEEE
15 years 9 months ago
Automating Open Bisimulation Checking for the Spi Calculus
We consider the problem of automating open bisimulation checking for the spi-calculus, an extension of the pi-calculus with cryptographic primitives. The notion of open bisimulatio...
Alwen Tiu, Jeremy E. Dawson