RT Journal Article
JF IEEE Transactions on Dependable and Secure Computing
YR 2013
VO 10
IS
SP 28
TI The Foundational Work of Harrison-Ruzzo-Ullman Revisited
A1 Ninghui Li,
A1 Mahesh V. Tripunitara,
K1 Safety
K1 Access control
K1 Context
K1 Computer security
K1 Educational institutions
K1 Computational modeling
K1 computational complexity
K1 Access control
K1 reducibility and completeness
AB The work by Harrison, Ruzzo, and Ullman (the HRU paper) on safety in the context of the access matrix model is widely considered to be foundational work in access control. In this paper, we address two errors we have discovered in the HRU paper. To our knowledge, these errors have not been previously reported in the literature. The first error regards a proof that shows that safety analysis for mono-operational HRU systems is in {\bf NP}. The error stems from a faulty assumption that such systems are monotonic for the purpose of safety analysis. We present a corrected proof in this paper. The second error regards a mapping from one version of the safety problem to another that is presented in the HRU paper. We demonstrate that the mapping is not a reduction, and present a reduction that enables us to infer that the second version of safety introduced in the HRU paper is also undecidable for the HRU scheme. These errors lead us to ask whether the notion of safety as defined in the HRU paper is meaningful. We introduce other notions of safety that we argue have more intuitive appeal, and present the corresponding safety analysis results for the HRU scheme.
PB IEEE Computer Society, [URL:http://www.computer.org]
SN 1545-5971
LA English
DO 10.1109/TDSC.2012.77
LK http://doi.ieeecomputersociety.org/10.1109/TDSC.2012.77

RT Journal Article
JF IEEE Transactions on Dependable and Secure Computing
YR 2013
VO 10
IS
SP 1
TI Securing Class Initialization in Java-like Languages
A1 Andrei Sabelfeld,
A1 Keiko Nakata,
A1 Willard Rafnsson,
K1 Security
K1 Java
K1 Context
K1 Lattices
K1 Loading
K1 Syntactics
K1 Semantics
K1 program analysis
K1 Information flow control
AB Language-based information-flow security is concerned with specifying and enforcing security policies for information flow via language constructs. Although much progress has been made on understanding information flow in object-oriented programs, little attention has been given to the impact of class initialization on information flow. This paper turns the spotlight on security implications of class initialization. We reveal the subtleties of information propagation when classes are initialized, and demonstrate how these flows can be exploited to leak information through error recovery. Our main contribution is a type-and-effect system which tracks these information flows. The type system is parameterized by an arbitrary lattice of security levels. Flows through the class hierarchy and dependencies in field initializers are tracked by typing class initializers wherever they could be executed. The contexts in which each class can be initialized are tracked to prevent insecure flows of out-of-scope contextual information through class initialization statuses and error recovery. We show that the type system enforces termination-insensitive noninterference.
PB IEEE Computer Society, [URL:http://www.computer.org]
SN 1545-5971
LA English
DO 10.1109/TDSC.2012.73
LK http://doi.ieeecomputersociety.org/10.1109/TDSC.2012.73

RT Journal Article
JF IEEE Transactions on Dependable and Secure Computing
YR 2013
VO 10
IS
SP 14
TI SORT: A Self-ORganizing Trust Model for Peer-to-Peer Systems
A1 Ahmet Burak Can,
A1 Bharat Bhargava,
K1 Measurement
K1 Peer to peer computing
K1 Context
K1 History
K1 Computational modeling
K1 Fading
K1 Buildings
K1 security
K1 Peer-to-peer systems
K1 trust management
K1 reputation
AB Open nature of peer-to-peer systems exposes them to malicious activity. Building trust relationships among peers can mitigate attacks of malicious peers. This paper presents distributed algorithms that enable a peer to reason about trustworthiness of other peers based on past interactions and recommendations. Peers create their own trust network in their proximity by using local information available and do not try to learn global trust information. Two contexts of trust, service, and recommendation contexts, are defined to measure trustworthiness in providing services and giving recommendations. Interactions and recommendations are evaluated based on importance, recentness, and peer satisfaction parameters. Additionally, recommender's trustworthiness and confidence about a recommendation are considered while evaluating recommendations. Simulation experiments on a file sharing application show that the proposed model can mitigate attacks on 16 different malicious behavior models. In the experiments, good peers were able to form trust relationships in their proximity and isolate malicious peers.
PB IEEE Computer Society, [URL:http://www.computer.org]
SN 1545-5971
LA English
DO 10.1109/TDSC.2012.74
LK http://doi.ieeecomputersociety.org/10.1109/TDSC.2012.74

RT Journal Article
JF IEEE Transactions on Dependable and Secure Computing
YR 2013
VO 10
IS
SP 40
TI Unprivileged Black-Box Detection of User-Space Keyloggers
A1 Cristiano Giuffrida,
A1 Stefano Ortolani,
A1 Bruno Crispo,
K1 Monitoring
K1 Kernel
K1 Keyboards
K1 Correlation
K1 Robustness
K1 PCC
K1 Invasive software
K1 keylogger
K1 security
K1 black-box
AB Software keyloggers are a fast growing class of invasive software often used to harvest confidential information. One of the main reasons for this rapid growth is the possibility for unprivileged programs running in user space to eavesdrop and record all the keystrokes typed by the users of a system. The ability to run in unprivileged mode facilitates their implementation and distribution, but, at the same time, allows one to understand and model their behavior in detail. Leveraging this characteristic, we propose a new detection technique that simulates carefully crafted keystroke sequences in input and observes the behavior of the keylogger in output to unambiguously identify it among all the running processes. We have prototyped our technique as an unprivileged application, hence matching the same ease of deployment of a keylogger executing in unprivileged mode. We have successfully evaluated the underlying technique against the most common free keyloggers. This confirms the viability of our approach in practical scenarios. We have also devised potential evasion techniques that may be adopted to circumvent our approach and proposed a heuristic to strengthen the effectiveness of our solution against more elaborated attacks. Extensive experimental results confirm that our technique is robust to both false positives and false negatives in realistic settings.
PB IEEE Computer Society, [URL:http://www.computer.org]
SN 1545-5971
LA English
DO 10.1109/TDSC.2012.76
LK http://doi.ieeecomputersociety.org/10.1109/TDSC.2012.76

RT Journal Article
JF IEEE Transactions on Dependable and Secure Computing
YR 2013
VO 10
IS
SP 53
TI 2012 Reviewers List
K1 IEEE publishing
AB The publication offers a note of thanks and lists its reviewers.
PB IEEE Computer Society, [URL:http://www.computer.org]
SN 1545-5971
LA English
DO 10.1109/TDSC.2013.2
LK http://doi.ieeecomputersociety.org/10.1109/TDSC.2013.2

RT Journal Article
JF IEEE Transactions on Dependable and Secure Computing
YR 2013
VO 10
IS 1
SP [object Object]
TI 2012 Annual IndexK1 undefined

AB This index covers all technical items - papers, correspondence, reviews, etc. - that appeared in this periodical during the year, and items from previous years that were commented upon or corrected in this year. Departments and other items may also be covered if they have been judged to have archival value. The Author Index contains the primary entry for each item, listed under the first author's name. The primary entry includes the co-authors' names, the title of the paper or other item, and its location, specified by the publication abbreviation, year, month, and inclusive pagination. The Subject Index contains entries describing the item under all appropriate subject headings, plus the first author's name, the publication abbreviation, month, and year, and inclusive pages. Note that the item title is found only under the primary entry in the Author Index.
PB IEEE Computer Society, [URL:http://www.computer.org]
SN 1545-5971
LA English
DO 10.1109/TDSC.2013.1
LK http://doi.ieeecomputersociety.org/10.1109/TDSC.2013.1