NDLI: Secure slices of insecure programs

Please wait, while we are loading the content...

Confronting a mobile adversary in unattended sensor networks

Password recovery attack on authentication protocol MD4(Password||Challenge)

An overview of side channel analysis attacks

A block cipher based pseudo random number generator secure against side-channel key recovery

On the protocol composition logic PCL

Secure slices of insecure programs

Principled reasoning and practical applications of alert fusion in intrusion detection systems

SNAPP: stateless network-authenticated path pinning

On spatio-temporal constraints and inheritance in role-based access control

Securing group key exchange against strong corruptions

Robust, anonymous RFID authentication with constant key-lookup

Provably secure browser-based user-aware mutual authentication over TLS

Exploiting social networks for threshold signing: attack-resilience vs. availability

Practical forward secure sequential aggregate signatures

Cryptanalysis and improvement of a multi-receiver identity-based key encapsulation at INDOCRYPT 06

Prototyping security test objects for use with advanced biometric authentication systems

A strict evaluation method on the number of conditions for the SHA-1 collision search

Avoiding timing channels in fixed-priority schedulers

An integrated framework for security protocol analysis

Verified implementations of the information card federated identity-management protocol

Detecting VoIP based DoS attacks at the public safety answering point

A general model of probabilistic packet marking for IP traceback

Online subscriptions with anonymous access

Security arguments for the UM key agreement protocol in the NIST SP 800-56A standard

Mutual authentication in RFID: security and privacy

Private combinatorial group testing

A short anonymously revocable group signature scheme from decision linear assumption

Efficient signature schemes supporting redaction, pseudonymization, and data deidentification

Stateful identity-based encryption scheme: faster encryption and decryption

HMAC is a randomness extractor and applications to TLS

Computationally sound mechanized proofs for basic and public-key Kerberos

A practical mimicry attack against powerful system-call monitors

Secure neighbor discovery in wireless networks: formal investigation of possibility

Towards an efficient and language-agnostic compliance checker for trust negotiation systems

Non-interactive conference key distribution and its applications

Controlled privacy preserving keyword search

Efficient designated confirmer signature from bilinear pairings

CMV: automatic verification of complete mediation for java virtual machines

SEAR: a secure efficient ad hoc on demand routing protocol for wireless networks

Mechanisms for usage control

Certificateless signcryption

Usage control platformization via trustworthy SELinux

Secure slices of insecure programs

Content Provider	ACM Digital Library
Author	Cavadini, Salvador
Abstract	This paper deals with the problem of protect the confidentiality of data manipulated by sequential programs. In this context, secure information flow refers to the guarantee that program executions are free of non authorized flows of secret information into public channels. There are two established means to enforce information flow policies: static analyses, that are performed at compile time and guarantee that all program executions are free of unauthorized flows; and runtime monitoring, that dynamically detects and neutralizes invalid flows for the current run. Both approaches have their advantages and disadvantages. The main disadvantages of static information flow control (IFC) is, that it does not differentiate between secure and insecure executions of the same program, therefore whole programs are rejected in presence of possible invalid flows. On the contrary, dynamic IFC rejects insecure executions only. This analysis precision comes at the price of the execution overload that imposes the dynamic tracking of information flow. This work presents secure slicing, a technique that statically transforms probably insecure (interfering) programs into secure (non-interfering) ones. Our approach combines static analysis of information flow and program transformation: if invalid flows are detected, instead of rejecting the whole program, we transform it to eliminate the invalid flows. This way, we alleviate drawbacks of static and dynamic approaches: neither we reject full programs nor we impose run-time overhead. The resulting program can be seen as a secure slice of the source program that can be executed without risk of information leaks. In this work we also show that secure slices can be computed for programs that intentionally release secret information, and that the technique can be applied to real programming languages such as Java.
Starting Page	112
Ending Page	122
Page Count	11
File Format	PDF
ISBN	9781595939791
DOI	10.1145/1368310.1368329
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2008-03-18
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Non-interference Program slicing Information flow Program dependences
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Refactoring programs to secure information flows

Combining type-based analysis and model checking for finding counterexamples against non-interference (2006)

Dynamic Information Flow Analysis and Dynamic Slicing (Extended Version)

Detecting and Debugging Insecure Information Flows (2004)

The Impact of Synchronisation on Secure Information Flow in Concurrent Programs (2001)

Pruning dynamic slices with confidence

Classifying data dependences in the presence of pointers for program comprehension, testing, and debugging

A Logic for Information Flow Analysis with an Application to Forward Slicing of Simple Imperative Programs (2005)

Slicing Concurrent Programs Based on Program Reachability Graphs

Secure slices of insecure programs

Similar Documents

Refactoring programs to secure information flows

Combining type-based analysis and model checking for finding counterexamples against non-interference (2006)

Dynamic Information Flow Analysis and Dynamic Slicing (Extended Version)

Detecting and Debugging Insecure Information Flows (2004)

The Impact of Synchronisation on Secure Information Flow in Concurrent Programs (2001)

Pruning dynamic slices with confidence

Classifying data dependences in the presence of pointers for program comprehension, testing, and debugging

A Logic for Information Flow Analysis with an Application to Forward Slicing of Simple Imperative Programs (2005)

Slicing Concurrent Programs Based on Program Reachability Graphs

Secure slices of insecure programs