Sciweavers

3811 search results - page 583 / 763
» The Safe-Tcl Security Model
Sort
View
POPL
2007
ACM
16 years 6 months ago
Types, bytes, and separation logic
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...
Harvey Tuch, Gerwin Klein, Michael Norrish
STOC
2003
ACM
110views Algorithms» more  STOC 2003»
16 years 6 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 6 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...
ESOP
2010
Springer
16 years 3 months ago
Faulty Logic: Reasoning about Fault Tolerant Programs
Transient faults are single-shot hardware errors caused by high energy particles from space, manufacturing defects, overheating, and other sources. Such faults can be devastating f...
Matthew L. Meola and David Walker
TCC
2010
Springer
231views Cryptology» more  TCC 2010»
16 years 3 months ago
A Domain Extender for the Ideal Cipher
We describe the first domain extender for ideal ciphers, i.e. we show a construction that is indifferentiable from a 2n-bit ideal cipher, given a n-bit ideal cipher. Our construc...
Jean-Sébastien Coron, Yevgeniy Dodis, Avrad...