Sciweavers

2257 search results - page 56 / 452
» Secure program partitioning
Sort
View
AAIM
2007
Springer
116views Algorithms» more  AAIM 2007»
14 years 2 months ago
Solving Generalized Maximum Dispersion with Linear Programming
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
Gerold Jäger, Anand Srivastav, Katja Wolf
CCS
2006
ACM
14 years 15 days ago
Secure information flow with random assignment and encryption
Type systems for secure information flow aim to prevent a program from leaking information from variables classified as H to variables classified as L. In this work we extend such...
Geoffrey Smith
CCS
2010
ACM
13 years 6 months ago
Platform-independent programs
Given a single program (i.e., bit string), one may assume that the program's behaviors can be determined by first identifying the native runtime architecture and then executi...
Sang Kil Cha, Brian Pak, David Brumley, Richard Ja...
PLDI
2009
ACM
14 years 3 months ago
Laminar: practical fine-grained decentralized information flow control
Decentralized information flow control (DIFC) is a promising model for writing programs with powerful, end-to-end security guarantees. Current DIFC systems that run on commodity ...
Indrajit Roy, Donald E. Porter, Michael D. Bond, K...
ICNP
2000
IEEE
14 years 1 months ago
Optimal Partitioning of Multicast Receivers
Multicast sessions may have a large number of receivers with heterogeneous reception capacities. To accommodate this heterogeneity, various multi-rate schemes, based upon the use ...
Yang Richard Yang, Min Sik Kim, Simon S. Lam