Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from SIGIR 2026 / reviewers in the wild / expert

Aris Zakinthinos

dblp:50/2911 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
0since 2021 · last 1998
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 5 · 5 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Systems and software security · 100%
Theoretical computer science
1 paper
Logic in computer science · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Systems and software security
information flow control		 0.011997
A General Theory of Security Properties · S&P 1997
Systems and software security › information flow control
noninterference		 0.011997
A General Theory of Security Properties · S&P 1997

Methods — techniques the papers use, named apart from their topics

trace-based security modeling · 0.0partial ordering · 0.0
YearPublicationVenuePosition
1998 Composing Secure Systems that have Emergent Properties
abstract
A property is said to emerge if not all of its constituent components satisfy the property. The paper proves the existence of emergent properties and investigates how a property might emerge. The authors introduce a condition called stability on properties that allows one to predict under what circumstances a property might emerge.
Aris Zakinthinos, E. Stewart Lee
 CSFW1
1997 A General Theory of Security Properties
abstract
We present a general theory of possibilistic security properties. We show that we can express a security property as a predicate that is true of every set containing all the traces with the same low level event sequence. Given this security predicate, we show how to construct a partial ordering of security properties. We also discuss information flow and present the weakest property such that no information can flow from high level users to low level users. Finally, we present a comparison of our framework and McLean's (1994) Selective Interleaving Functions framework.
Aris Zakinthinos, E. Stewart Lee
 S&P1
1996 How and why feedback composition fails [secure systems]
abstract
This paper examines the effects of the structure of the system on the composability of Generalized Non-Interference (GNI). It is proven that in a system constructed from GNI secure components, the only possible interconnection that can cause the system not to satisfy GNI occurs when two components are composed with feedback. We also present necessary and sufficient conditions for the composition of GNI secure components to yield a system that is GNI secure. The theorems are then used to provide a procedure to the system designer to construct a GNI secure system from GNI secure components. We also investigate reasons behind the composability of restrictiveness and n-forward correctability. It is shown that these properties compose because they eliminate one of the conditions that causes the composition of GNI secure components to fail.
Aris Zakinthinos, E. Stewart Lee
 CSFW1
1995 The composability of non-interference [system security]
abstract
The failure of non-interference to be preserved under composition is discussed. Two theorems are presented to this effect. The first proves McCullough's conjecture that non-interference is composable without feedback. The second provides a method of composition that preserves the non-interference property in the presence of feedback.
Aris Zakinthinos, E. Stewart Lee
 CSFW1
1995 The Composability of Non-Interference
abstract
The failure of non-interference to be preserved under composition is discussed. Two theorems are presented to this effect. The first proves McCullough's conjecture that non-interference is composable without feedback. The second provides a method of
Aris Zakinthinos, E. Stewart Lee
 J. Comput. Secur.1