Sciweavers

344 search results - page 58 / 69
» Some Theorems We Should Prove
Sort
View
JUCS
2008
166views more  JUCS 2008»
13 years 7 months ago
Bilateral Unknown Key-Share Attacks in Key Agreement Protocols
Unknown Key-Share (UKS) resilience is a basic security attribute in authenticated key agreement protocols, whereby two entities A and B should not be able to be coerced into shari...
Liqun Chen, Qiang Tang
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
13 years 8 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
JACM
2000
77views more  JACM 2000»
13 years 7 months ago
The fault span of crash failures
A crashing network protocol is an asynchronous protocol whose memory does not survive crashes. We show that a crashing network protocol that works over unreliable links can be driv...
George Varghese, Mahesh Jayaram
WDAG
2009
Springer
166views Algorithms» more  WDAG 2009»
14 years 1 months ago
New Bounds for the Controller Problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
Yuval Emek, Amos Korman
PODS
2008
ACM
165views Database» more  PODS 2008»
14 years 7 months ago
Data exchange and schema mappings in open and closed worlds
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
Leonid Libkin, Cristina Sirangelo