Rolando Trujillo-Rasua

According to our database1, Rolando Trujillo-Rasua
  • authored at least 32 papers between 2010 and 2017.
  • has a "Dijkstra number"2 of four.



In proceedings 
PhD thesis 





Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph.
Fundam. Inform., 2017

Rethinking (k, 𝓁)-anonymity in social graphs: (k, 𝓁)-adjacency anonymity and (k, 𝓁)-(adjacency) anonymous transformations.
CoRR, 2017

Refinement-Aware Generation of Attack Trees.
Proceedings of the Security and Trust Management - 13th International Workshop, 2017

New Directions in Attack Tree Research: Catching up with Industrial Needs.
Proceedings of the Graphical Models for Security - 4th International Workshop, 2017

k-Metric antidimension: A privacy measure for social graphs.
Inf. Sci., 2016

Characterizing 1-Metric Antidimensional Trees and Unicyclic Graphs.
Comput. J., 2016

Man-in-the-Middle Attacks Evolved... but Our Security Models Didn't.
Proceedings of the Security Protocols XXIV, 2016

Optimality Results on the Security of Lookup-Based Protocols.
Proceedings of the Radio Frequency Identification and IoT Security, 2016

Attack Trees for Practical Security Assessment: Ranking of Attack Scenarios with ADTool 2.0.
Proceedings of the Quantitative Evaluation of Systems - 13th International Conference, 2016

Using Attack-Defense Trees to Analyze Threats and Countermeasures in an ATM: A Case Study.
Proceedings of the Practice of Enterprise Modeling, 2016

A Class of Precomputation-Based Distance-Bounding Protocols.
Proceedings of the IEEE European Symposium on Security and Privacy, 2016

The Fréchet/Manhattan Distance and the Trajectory Anonymisation Problem.
Proceedings of the Data and Applications Security and Privacy XXX, 2016

Counteracting Active Attacks in Social Network Graphs.
Proceedings of the Data and Applications Security and Privacy XXX, 2016

Privacy in Spatio-Temporal Databases: A Microaggregation-Based Approach.
Proceedings of the Advanced Research in Data Privacy, 2015

Attack Trees with Sequential Conjunction.
CoRR, 2015

Comparing Distance Bounding Protocols: a Critical Mission Supported by Decision Theory.
CoRR, 2015

Comparing distance bounding protocols: A critical mission supported by decision theory.
Computer Communications, 2015

Attack Trees with Sequential Conjunction.
Proceedings of the ICT Systems Security and Privacy Protection, 2015

Distance Bounding Facing Both Mafia and Distance Frauds.
IEEE Trans. Wireless Communications, 2014

k-Metric Antidimension: a Privacy Measure for Social Graphs.
CoRR, 2014

Distance-bounding facing both mafia and distance frauds: Technical report.
CoRR, 2014

Complexity of distance fraud attacks in graph-based distance bounding.
CoRR, 2014

On the privacy offered by (k, δ)-anonymity.
Inf. Syst., 2013

Privacy in RFID and mobile objects.
CoRR, 2013

Complexity of Distance Fraud Attacks in Graph-Based Distance Bounding.
Proceedings of the Mobile and Ubiquitous Systems: Computing, Networking, and Services, 2013

Microaggregation- and permutation-based anonymization of movement data.
Inf. Sci., 2012

Predictive protocol for the scalable identification of RFID tags through collaborative readers.
Computers in Industry, 2012

Efficient probabilistic communication protocol for the private identification of RFID tags by means of collaborative readers.
Computer Networks, 2011

Scalable trajectory-based protocol for RFID tags identification.
Proceedings of the 2011 IEEE International Conference on RFID-Technologies and Applications, 2011

A Scalable RFID Authentication Protocol Supporting Ownership Transfer and Controlled Delegation.
Proceedings of the RFID. Security and Privacy - 7th International Workshop, 2011

The Poulidor Distance-Bounding Protocol.
Proceedings of the Radio Frequency Identification: Security and Privacy Issues, 2010

Privacy-preserving publication of trajectories using microaggregation.
Proceedings of the 3rd ACM SIGSPATIAL International Workshop on Security and Privacy in GIS and LBS, 2010