Sciweavers

14850 search results - page 2483 / 2970
» The Security of
Sort
View
CADE
2007
Springer
16 years 7 months ago
A History-based Verification of Distributed Applications
Safety and security guarantees for individual applications in general depend on assumptions on the given context provided by distributed instances of operating systems, hardware pl...
Bruno Langenstein, Andreas Nonnengart, Georg Rock,...
STOC
2005
ACM
93views Algorithms» more  STOC 2005»
16 years 7 months ago
Representing hard lattices with O(n log n) bits
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
Miklós Ajtai
STOC
2003
ACM
110views Algorithms» more  STOC 2003»
16 years 7 months ago
Non-interactive and reusable non-malleable commitment schemes
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...
Ivan Damgård, Jens Groth
OSDI
2008
ACM
16 years 7 months ago
Leveraging Legacy Code to Deploy Desktop Applications on the Web
Xax is a browser plugin model that enables developers to leverage existing tools, libraries, and entire programs to deliver feature-rich applications on the web. Xax employs a nov...
John R. Douceur, Jeremy Elson, Jon Howell, Jacob R...
OSDI
2008
ACM
16 years 7 months ago
From Optimization to Regret Minimization and Back Again
Internet routing is mostly based on static information-it's dynamicity is limited to reacting to changes in topology. Adaptive performance-based routing decisions would not o...
Ioannis C. Avramopoulos, Jennifer Rexford, Robert ...
« Prev « First page 2483 / 2970 Last » Next »