Sciweavers

2372 search results - page 120 / 475
» is 2012
Sort
View
CSFW
2012
IEEE
13 years 9 months ago
Information-Flow Security for a Core of JavaScript
—Tracking information flow in dynamic languages remains an important and intricate problem. This paper makes substantial headway toward understanding the main challenges and res...
Daniel Hedin, Andrei Sabelfeld
CSFW
2012
IEEE
13 years 9 months ago
Secure Compilation to Modern Processors
—We present a secure (fully abstract) compilation scheme to compile an object-based high-level language to lowchine code. Full abstraction is achieved by relying on a fine-grain...
Pieter Agten, Raoul Strackx, Bart Jacobs, Frank Pi...
CSFW
2012
IEEE
13 years 9 months ago
Labeled Sequent Calculi for Access Control Logics: Countermodels, Saturation and Abduction
—We show that Kripke semantics of modal logic, manifest in the syntactic proof formalism of labeled sequent calculi, can be used to solve three central problems in access control...
Valerio Genovese, Deepak Garg, Daniele Rispoli
CRYPTO
2012
Springer
262views Cryptology» more  CRYPTO 2012»
13 years 9 months ago
Functional Encryption with Bounded Collusions via Multi-party Computation
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee
CRYPTO
2012
Springer
217views Cryptology» more  CRYPTO 2012»
13 years 9 months ago
Securing Circuits against Constant-Rate Tampering
We present a compiler that converts any circuit into one that remains secure even if a constant fraction of its wires are tampered with. Following the seminal work of Ishai et al. ...
Dana Dachman-Soled, Yael Tauman Kalai