References of "Fundamenta Informaticae"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailSemantics for specialising attack trees based on linear logic
Horne, Ross; Mauw, Sjouke UL; Tiu, Alwen

in Fundamenta Informaticae (2017), 153(1-2), 57-86

Attack trees profile the sub-goals of the proponent of an attack. Attack trees have a variety of semantics depending on the kind of question posed about the attack, where questions are captured by an ... [more ▼]

Attack trees profile the sub-goals of the proponent of an attack. Attack trees have a variety of semantics depending on the kind of question posed about the attack, where questions are captured by an attribute domain. We observe that one of the most general semantics for attack trees, the multiset semantics, coincides with a semantics expressed using linear logic propositions. The semantics can be used to compare attack trees to determine whether one attack tree is a specialisation of another attack tree. Building on these observations, we propose two new semantics for an extension of attack trees named causal attack trees. Such attack trees are extended with an operator capturing the causal order of sub-goals in an attack. These two semantics extend the multiset semantics to sets of series-parallel graphs closed under certain graph homomorphisms, where each semantics respects a class of attribute domains. We define a sound logical system with respect to each of these semantics, by using a recently introduced extension of linear logic, called MAV , featuring a non-commutative operator. The non-commutative operator models causal dependencies in causal attack trees. Similarly to linear logic for attack trees, implication defines a decidable preorder for specialising causal attack trees that soundly respects a class of attribute domains. [less ▲]

Detailed reference viewed: 97 (0 UL)
Full Text
Peer Reviewed
See detailSimilarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
Lemanska, Magdalena; Rodríguez-Velázquez, Alberto; Trujillo Rasua, Rolando UL

in Fundamenta Informaticae (2017), 152(3), 273-287

Detailed reference viewed: 95 (18 UL)
Full Text
Peer Reviewed
See detailCryptanalysis of the Full AES Using GPU-Like Special-Purpose Hardware
Biryukov, Alex UL; Groszschädl, Johann UL

in Fundamenta Informaticae (2012), 114(3-4), 221-237

The block cipher Rijndael has undergone more than ten years of extensive cryptanalysis since its submission as a candidate for the Advanced Encryption Standard (AES) in April 1998. To date, most of the ... [more ▼]

The block cipher Rijndael has undergone more than ten years of extensive cryptanalysis since its submission as a candidate for the Advanced Encryption Standard (AES) in April 1998. To date, most of the publicly-known cryptanalytic results are based on reduced-round variants of the AES (respectively Rijndael) algorithm. Among the few exceptions that target the full AES are the Related-Key Cryptanalysis (RKC) introduced at ASIACRYPT 2009 and attacks exploiting Time-Memory-Key (TMK) trade-offs such as demonstrated at SAC 2005. However, all these attacks are generally considered infeasible in practice due to their high complexity (i.e. 2^99.5 AES operations for RKC, 2^80 for TMK). In this paper, we evaluate the cost of cryptanalytic attacks on the full AES when using special-purpose hardware in the form of multi-core AES processors that are designed in a similar way as modern Graphics Processing Units (GPUs) such as the NVIDIA GT200b. Using today's VLSI technology would allow for the implementation of a GPU-like processor reaching a throughput of up to 10^12 AES operations per second. An organization able to spend one trillion US$ for designing and building a supercomputer based on such processors could theoretically break the full AES in a time frame of as little as one year when using RKC, or in merely one month when performing a TMK attack. We also analyze different time-cost trade-offs and assess the implications of progress in VLSI technology under the assumption that Moore's law will continue to hold for the next ten years. These assessments raise some concerns about the long-term security of the AES. [less ▲]

Detailed reference viewed: 127 (6 UL)
Full Text
Peer Reviewed
See detailReducibility proofs in the lambda-calculus
Kamareddine, Fairouz; Rahli, Vincent UL; Wells, J. B.

in Fundamenta Informaticae (2012), 121

Detailed reference viewed: 32 (0 UL)
Full Text
Peer Reviewed
See detailOn Realisability Semantics for Intersection Types with Expansion Variables.
Kamareddine, Fairouz; Nour, Karim; Rahli, Vincent UL et al

in Fundamenta Informaticae (2012), 121

Detailed reference viewed: 23 (0 UL)
Full Text
Peer Reviewed
See detailA Boolean Approach for Disentangling the Roles of Submodules to the Global Properties of a Biomodel
Czeizler, Elena; Mizera, Andrzej UL; Petre, Ion

in Fundamenta Informaticae (2012), 116(1-4), 51-63

Detailed reference viewed: 15 (0 UL)
Full Text
Peer Reviewed
See detailWhat agents can probably enforce
Bulling, N.; Jamroga, Wojciech UL

in Fundamenta Informaticae (2009)

Detailed reference viewed: 10 (0 UL)
Full Text
Peer Reviewed
See detailIs timed branching bisimilarity a congruence indeed?
Fokkink, W. J.; Pang, Jun UL; Wijs, A. J.

in Fundamenta Informaticae (2008), 87(3-4), 287311

Detailed reference viewed: 28 (1 UL)
Full Text
Peer Reviewed
See detailNuovo DRM Paradiso: Designing a Secure, Verified, Fair Exchange DRM Scheme
Torabi Dashti, Mohammad; Krishnan Nair, Srijith; Jonker, Hugo UL

in Fundamenta Informaticae (2008), 89(4), 393-417

Detailed reference viewed: 10 (0 UL)
Full Text
Peer Reviewed
See detailA process specification formalism
Mauw, Sjouke UL; Veltink, G. J.

in Fundamenta Informaticae (1990), XIII

Detailed reference viewed: 28 (0 UL)