References of "Trujillo Rasua, Rolando 50003226"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailNew Directions in Attack Tree Research: Catching up with Industrial Needs
Gadyatskaya, Olga UL; Trujillo Rasua, Rolando UL

in Mauw, Sjouke (Ed.) Proceedings of the 4th International Workshop on Graphical Models for Security (in press)

Attack trees provide a systematic way of characterizing diverse system threats. Their strengths arise from the combination of an intuitive representation of possible attacks and availability of formal ... [more ▼]

Attack trees provide a systematic way of characterizing diverse system threats. Their strengths arise from the combination of an intuitive representation of possible attacks and availability of formal mathematical frameworks for analyzing them in a qualitative or a quantitative manner. Indeed, the mathematical frameworks have become a large focus of attack tree research. However, practical applications of attack trees in industry largely remain a tedious and error-prone exercise. Recent research directions in attack trees, such as attack tree generation, attempt to close this gap and to improve the attack tree state-of-thepractice. In this position paper we outline the recurrent challenges in manual tree design within industry, and we overview the recent research results in attack trees that help the practitioners. For the challenges that have not yet been addressed by the community, we propose new promising research directions. [less ▲]

Detailed reference viewed: 21 (1 UL)
Full Text
Peer Reviewed
See detailRefinement-Aware Generation of Attack Trees
Gadyatskaya, Olga UL; Ravi, Jhawar; Mauw, Sjouke UL et al

in Livraga, Giovanni; Mitchell, Chris J. (Eds.) Security and Trust Management - 13th International Workshop (2017, September)

Detailed reference viewed: 29 (3 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: 55 (1 UL)
Full Text
Peer Reviewed
See detailOptimality Results on the Security of Lookup-Based Protocols
Mauw, Sjouke UL; Toro Pozo, Jorge Luis UL; Trujillo Rasua, Rolando UL

in Hancke, Gerard P.; Markantonakis, Konstantinos (Eds.) Radio Frequency Identification and IoT Security - 12th International Workshop, RFIDSec 2016, Hong Kong, China, November 30 - December 2, 2016, Revised Selected Papers (2016, December)

Distance-bounding protocols use the round-trip time of a challenge-response cycle to provide an upper-bound on the distance between prover and verifier. In order to obtain an accurate upper-bound, the ... [more ▼]

Distance-bounding protocols use the round-trip time of a challenge-response cycle to provide an upper-bound on the distance between prover and verifier. In order to obtain an accurate upper-bound, the computation time at the prover’s side should be as short as possible, which can be achieved by precomputing the responses and storing them in a lookup table. However, such lookup-based distance bounding protocols suffer from a trade-off between the achieved security level and the size of the lookup table. In this paper, we study this security-memory trade-off problem for a large class of lookup-based distance bounding protocols; called layered protocols. Relying on an automata-based security model, we provide mathematical definitions for different design decisions used in previous lookup-based protocols, and perform general security analyses for each of them. We also formalize an interpretation of optimal trade-off and find a non-trivial protocol transformation approach towards optimality. That is to say, our transformation applied to any layered protocol results in either an improved or an equal protocol with respect to the optimality criterion. This transformation allows us to provide a subclass of lookup-based protocol that cannot be improved further, which means that it contains an optimal layered protocol. [less ▲]

Detailed reference viewed: 11 (3 UL)
Full Text
See detailA class of precomputation-based distance-bounding protocols
Mauw, Sjouke UL; Toro Pozo, Jorge Luis UL; Trujillo Rasua, Rolando UL

Presentation (2016, March 16)

Distance-bounding protocols serve to thwart various types of proximity-based attacks, such as relay attacks. A particular class of distance-bounding protocols measures round trip times of a series of one ... [more ▼]

Distance-bounding protocols serve to thwart various types of proximity-based attacks, such as relay attacks. A particular class of distance-bounding protocols measures round trip times of a series of one-bit challenge-response cycles, during which the proving party must have minimal computational overhead. This can be achieved by precomputing the responses to the various possible challenges. We formalize this class of precomputation-based distance-bounding protocols. By designing an abstract model for these protocols, we can study their generic properties, such as security lower bounds in relation to space complexity. Further, we present a novel family of protocols in this class that resists well to mafia fraud attacks. [less ▲]

Detailed reference viewed: 64 (13 UL)
Full Text
Peer Reviewed
See detailAttack trees for practical security assessment: ranking of attack scenarios with ADTool 2.0
Gadyatskaya, Olga UL; Jhawar, Ravi UL; Kordy, Piotr UL et al

in Quantitative Evaluation of Systems - 13th International Conference (2016)

Detailed reference viewed: 80 (7 UL)
Full Text
Peer Reviewed
See detailA Class of Precomputation-based Distance-bounding Protocols
Mauw, Sjouke UL; Toro Pozo, Jorge Luis UL; Trujillo Rasua, Rolando UL

in 1st IEEE European Symposium on SECURITY and PRIVACY (2016)

Distance-bounding protocols serve to thwart various types of proximity-based attacks, such as relay attacks. A particular class of distance-bounding protocols measures round trip times of a series of one ... [more ▼]

Distance-bounding protocols serve to thwart various types of proximity-based attacks, such as relay attacks. A particular class of distance-bounding protocols measures round trip times of a series of one-bit challenge-response cycles, during which the proving party must have minimal computational overhead. This can be achieved by precomputing the responses to the various possible challenges. In this paper we study this class of precomputation-based distance-bounding protocols. By designing an abstract model for these protocols, we can study their generic properties, such as security lower bounds in relation to space complexity. Further, we develop a novel family of protocols in this class that resists well to mafia fraud attacks. [less ▲]

Detailed reference viewed: 40 (7 UL)
Full Text
Peer Reviewed
See detailUsing attack-defense trees to analyze threats and countermeasures in an ATM: a case study
Fraile, Marlon; Ford, Margaret; Gadyatskaya, Olga UL et al

in IFIP Working Conference on The Practice of Enterprise Modeling (2016)

Detailed reference viewed: 40 (1 UL)
Full Text
Peer Reviewed
See detailCounteracting active attacks in social network graphs
Mauw, Sjouke UL; Trujillo Rasua, Rolando UL; Xuan, Bochuan

in Proceedings of Data and Applications Security and Privacy - 30th Annual IFIP WG 11.3 Conference (DBSec 2016) (2016)

Detailed reference viewed: 20 (0 UL)
Full Text
Peer Reviewed
See detailCharacterizing 1-metric antidimensional trees and unicyclic graphs
Trujillo Rasua, Rolando UL; Yero, Ismael G.

in Computer Journal (2016), 59(8), 1264--1273

Detailed reference viewed: 25 (4 UL)
Full Text
Peer Reviewed
See detailThe Fréchet/Manhattan distance and the trajectory anonymisation problem
Torres, Christof Ferreira; Trujillo Rasua, Rolando UL

in Proceedings of Data and Applications Security and Privacy - 30th Annual IFIP WG 11.3 Conference (DBSec 2016) (2016)

Detailed reference viewed: 26 (3 UL)
Full Text
Peer Reviewed
See detailk-Metric Antidimension: a Privacy Measure for Social Graphs
Trujillo Rasua, Rolando UL; Yero, Ismael G.

in Information Sciences (2015), 328

Detailed reference viewed: 43 (4 UL)
Full Text
Peer Reviewed
See detailAttack Trees with Sequential Conjunction
Jhawar, Ravi UL; Kordy, Barbara; Mauw, Sjouke UL et al

in Federrath, Hannes; Gollmann, Dieter (Eds.) ICT Systems Security and Privacy Protection - 30th IFIP TC 11 International Conference, SEC 2015 (2015)

Detailed reference viewed: 59 (6 UL)
Full Text
Peer Reviewed
See detailComparing distance bounding protocols: A critical mission supported by decision theory
Avoine, Gildas; Mauw, Sjouke UL; Trujillo Rasua, Rolando UL

in Computer Communications (2015), 67

Detailed reference viewed: 19 (5 UL)
Full Text
Peer Reviewed
See detailPrivacy in Spatio-Temporal Databases: A Microaggregation-Based Approach
Trujillo Rasua, Rolando UL; Domingo-Ferrer, Josep

in Navarro-Arribas, Guillermo; Vicenç, Torra (Eds.) Advanced Research in Data Privacy (2015)

Detailed reference viewed: 31 (1 UL)
Full Text
Peer Reviewed
See detailDistance Bounding Facing Both Mafia and Distance Frauds
Trujillo Rasua, Rolando UL; Martin, Benjamin; Avoine, Gildas

in IEEE Transactions on Wireless Communications (2014), 13(10), 56905698

Detailed reference viewed: 26 (5 UL)
Full Text
Peer Reviewed
See detailOn the privacy offered by (k,δ)-anonymity
Trujillo Rasua, Rolando UL; Domingo-Ferrer, Josep

in Information Systems (2013), 38(4), 491-494

Detailed reference viewed: 21 (2 UL)
Full Text
Peer Reviewed
See detailComplexity of Distance Fraud Attacks in Graph-Based Distance Bounding
Trujillo Rasua, Rolando UL

in Stojmenovic, Ivan; Zixue, Cheng; Song, Guo (Eds.) Mobile and Ubiquitous Systems: Computing, Networking, and Services - 10th International Conference (2013)

Detailed reference viewed: 21 (2 UL)
Full Text
Peer Reviewed
See detailMicroaggregation-and permutation-based anonymization of movement data
Domingo-Ferrer, Josep; Trujillo Rasua, Rolando UL

in Information Sciences (2012), 208

Detailed reference viewed: 19 (1 UL)
Full Text
Peer Reviewed
See detailMicroaggregation-and Permutation-Based Anonymization of Mobility Data
Domingo-Ferrer, Josep; Trujillo Rasua, Rolando UL

in Information Sciences (2012), 208

Detailed reference viewed: 19 (1 UL)