Sciweavers

1226 search results - page 105 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
CRYPTO
1999
Springer
103views Cryptology» more  CRYPTO 1999»
15 years 7 months ago
Information Theoretically Secure Communication in the Limited Storage Space Model
Abstract. We provide a simple secret-key two-party secure communication scheme, which is provably information-theoretically secure in the limited-storage-space model. The limited-s...
Yonatan Aumann, Michael O. Rabin
138
Voted
NETWORKS
2011
14 years 10 months ago
Line planning, path constrained network flow and inapproximability
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
Christina Büsing, Sebastian Stiller
ASIAN
2009
Springer
269views Algorithms» more  ASIAN 2009»
15 years 1 months ago
Noninterference with Dynamic Security Domains and Policies
Abstract. Language-based information flow analysis is used to statically examine a program for information flows between objects of different security domains, and to verify these ...
Robert Grabowski, Lennart Beringer
ISCI
2007
135views more  ISCI 2007»
15 years 3 months ago
Generalising the array split obfuscation
An obfuscation is a behaviour-preserving program transformation whose aim is to make a program “harder to understand”. Obfuscations are mainly applied to make reverse engineer...
Stephen Drape
241
Voted
POPL
2008
ACM
16 years 3 months ago
Relational inductive shape analysis
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...
Bor-Yuh Evan Chang, Xavier Rival