Sciweavers

1350 search results - page 220 / 270
» Reasoning about Staged Computation
Sort
View
POPL
1993
ACM
15 years 10 months ago
Graph Types
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
Nils Klarlund, Michael I. Schwartzbach
CSFW
2010
IEEE
15 years 10 months ago
Approximation and Randomization for Quantitative Information-Flow Analysis
—Quantitative information-flow analysis (QIF) is an emerging technique for establishing information-theoretic confidentiality properties. Automation of QIF is an important step...
Boris Köpf, Andrey Rybalchenko
CSFW
2010
IEEE
15 years 10 months ago
Required Information Release
Abstract—Many computer systems have a functional requirement to release information. Such requirements are an important part of a system’s information security requirements. Cu...
Stephen Chong
CCS
2006
ACM
15 years 10 months 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
AFRICACRYPT
2010
Springer
15 years 9 months ago
Efficient Unidirectional Proxy Re-Encryption
Abstract. Proxy re-encryption (PRE) allows a semi-trusted proxy to convert a ciphertext originally intended for Alice into one encrypting the same plaintext for Bob. The proxy only...
Sherman S. M. Chow, Jian Weng, Yanjiang Yang, Robe...