Search

Your search keyword '"Luccio, Flaminia L."' showing total 147 results
Start Over Author "Luccio, Flaminia L."
147 results on '"Luccio, Flaminia L."'

1. A Formally Verified Configuration for Hardware Security Modules in the Cloud

Author

Focardi, Riccardo and Luccio, Flaminia L.

Subjects
Computer Science - Cryptography and Security
Abstract

Hardware Security Modules (HSMs) are trusted machines that perform sensitive operations in critical ecosystems. They are usually required by law in financial and government digital services. The most important feature of an HSM is its ability to store sensitive credentials and cryptographic keys inside a tamper-resistant hardware, so that every operation is done internally through a suitable API, and such sensitive data are never exposed outside the device. HSMs are now conveniently provided in the cloud, meaning that the physical machines are remotely hosted by some provider and customers can access them through a standard API. The property of keeping sensitive data inside the device is even more important in this setting as a vulnerable application might expose the full API to an attacker. Unfortunately, in the last 20+ years a multitude of practical API-level attacks have been found and proved feasible in real devices. The latest version of PKCS#11, the most popular standard API for HSMs, does not address these issues leaving all the flaws possible. In this paper, we propose the first secure HSM configuration that does not require any restriction or modification of the PKCS#11 API and is suitable to cloud HSM solutions, where compliance to the standard API is of paramount importance. The configuration relies on a careful separation of roles among the different HSM users so that known API flaws are not exploitable by any attacker taking control of the application. We prove the correctness of the configuration by providing a formal model in the state-of-the-art Tamarin prover and we show how to implement the configuration in a real cloud HSM solution., Comment: To appear at ACM CCS 2021

Published
2021
Full Text
View/download PDF

2. Accessible Applications to Improve the Tourist Experience

Author

De Paoli, Irene, Di Campi, Alessia M., Luccio, Flaminia L., Filipe, Joaquim, Editorial Board Member, Ghosh, Ashish, Editorial Board Member, Prates, Raquel Oliveira, Editorial Board Member, Zhou, Lizhu, Editorial Board Member, da Silva, Hugo Plácido, editor, and Cipresso, Pietro, editor

Published
2023
Full Text
View/download PDF

4. The Revenge of Password Crackers: Automated Training of Password Cracking Tools

Author

Di Campi, Alessia Michela, Focardi, Riccardo, Luccio, Flaminia L., Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Atluri, Vijayalakshmi, editor, Di Pietro, Roberto, editor, Jensen, Christian D., editor, and Meng, Weizhi, editor

Published
2022
Full Text
View/download PDF

5. Secure Key Management Policies in Strand Spaces

Author

Focardi, Riccardo, Luccio, Flaminia L., Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Dougherty, Daniel, editor, Meseguer, José, editor, Mödersheim, Sebastian Alexander, editor, and Rowe, Paul, editor

Published
2021
Full Text
View/download PDF

7. Gathering of Robots in a Grid with Mobile Faults

Author

Das, Shantanu, Giachoudis, Nikos, Luccio, Flaminia L., Markou, Euripides, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Catania, Barbara, editor, Královič, Rastislav, editor, Nawrocki, Jerzy, editor, and Pighizzini, Giovanni, editor

Published
2019
Full Text
View/download PDF

8. Mobile Agents Rendezvous in spite of a Malicious Agent

Author

Das, Shantanu, Luccio, Flaminia L., and Markou, Euripides

Subjects
Computer Science - Distributed, Parallel, and Cluster Computing
Abstract

We examine the problem of rendezvous, i.e., having multiple mobile agents gather in a single node of the network. Unlike previous studies, we need to achieve rendezvous in presence of a very powerful adversary, a malicious agent that moves through the network and tries to block the honest agents and prevents them from gathering. The malicious agent is assumed to be arbitrarily fast, has full knowledge of the network and it cannot be exterminated by the honest agents. On the other hand, the honest agents are assumed to be quite weak: They are asynchronous and anonymous, they have only finite memory, they have no prior knowledge of the network and they can communicate with the other agents only when they meet at a node. Can the honest agents achieve rendezvous starting from an arbitrary configuration in spite of the malicious agent? We present some necessary conditions for solving rendezvous in spite of the malicious agent in arbitrary networks. We then focus on the ring and mesh topologies and provide algorithms to solve rendezvous. For ring networks, our algorithms solve rendezvous in all feasible instances of the problem, while we show that rendezvous is impossible for an even number of agents in unoriented rings. For the oriented mesh networks, we prove that the problem can be solved when the honest agents initially form a connected configuration without holes if and only if they can see which are the occupied nodes within a two-hops distance. To the best of our knowledge, this is the first attempt to study such a powerful and mobile fault model, in the context of mobile agents. Our model lies between the more powerful but static fault model of black holes (which can even destroy the agents), and the less powerful but mobile fault model of Byzantine agents (which can only imitate the honest agents but can neither harm nor stop them).

Published
2014

10. Usable and Accessible Tourism Websites for Children: A Case Study of a Naturalistic Oasis

Author

Dattolo, Antonina, De March, Chiara, Luccio, Flaminia L., Akan, Ozgur, Series editor, Bellavista, Paolo, Series editor, Cao, Jiannong, Series editor, Coulson, Geoffrey, Series editor, Dressler, Falko, Series editor, Ferrari, Domenico, Series editor, Gerla, Mario, Series editor, Kobayashi, Hisashi, Series editor, Palazzo, Sergio, Series editor, Sahni, Sartaj, Series editor, Shen, Xuemin Sherman, Series editor, Stan, Mircea, Series editor, Xiaohua, Jia, Series editor, Zomaya, Albert Y., Series editor, Guidi, Barbara, editor, Ricci, Laura, editor, Calafate, Carlos, editor, Gaggi, Ombretta, editor, and Marquez-Barja, Johann, editor

Published
2018
Full Text
View/download PDF

14. A Review of Websites and Mobile Applications for People with Autism Spectrum Disorders: Towards Shared Guidelines

Author

Dattolo, Antonina, Luccio, Flaminia L., Akan, Ozgur, Series editor, Bellavista, Paolo, Series editor, Cao, Jiannong, Series editor, Coulson, Geoffrey, Series editor, Dressler, Falko, Series editor, Ferrari, Domenico, Series editor, Gerla, Mario, Series editor, Kobayashi, Hisashi, Series editor, Palazzo, Sergio, Series editor, Sahni, Sartaj, Series editor, Shen, Xuemin Sherman, Series editor, Stan, Mircea, Series editor, Xiaohua, Jia, Series editor, Zomaya, Albert Y., Series editor, Gaggi, Ombretta, editor, Manzoni, Pietro, editor, Palazzi, Claudio, editor, Bujari, Armir, editor, and Marquez-Barja, Johann M., editor

Published
2017
Full Text
View/download PDF

16. Maintaining Intruder Detection Capability in a Rectangular Domain with Sensors

Author

Kranakis, Evangelos, Krizanc, Danny, Luccio, Flaminia L., Smith, Brett, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bose, Prosenjit, editor, Gąsieniec, Leszek Antoni, editor, Römer, Kay, editor, and Wattenhofer, Roger, editor

Published
2015
Full Text
View/download PDF

17. Mobile Agents Rendezvous in Spite of a Malicious Agent

Author

Das, Shantanu, Luccio, Flaminia L., Markou, Euripides, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bose, Prosenjit, editor, Gąsieniec, Leszek Antoni, editor, Römer, Kay, editor, and Wattenhofer, Roger, editor

Published
2015
Full Text
View/download PDF

19. Secure Recharge of Disposable RFID Tickets

Author

Focardi, Riccardo, Luccio, Flaminia L., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Barthe, Gilles, editor, Datta, Anupam, editor, and Etalle, Sandro, editor

Published
2012
Full Text
View/download PDF

20. Type-Based Analysis of PKCS#11 Key Management

Author

Centenaro, Matteo, Focardi, Riccardo, Luccio, Flaminia L., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Degano, Pierpaolo, editor, and Guttman, Joshua D., editor

Published
2012
Full Text
View/download PDF

21. An Introduction to Security API Analysis

Author

Focardi, Riccardo, Luccio, Flaminia L., Steel, Graham, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Aldini, Alessandro, editor, and Gorrieri, Roberto, editor

Published
2011
Full Text
View/download PDF

22. Secure Upgrade of Hardware Security Modules in Bank Networks

Author

Focardi, Riccardo, Luccio, Flaminia L., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Armando, Alessandro, editor, and Lowe, Gavin, editor

Published
2010
Full Text
View/download PDF

23. Cracking Bank PINs by Playing Mastermind

Author

Focardi, Riccardo, Luccio, Flaminia L., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Boldi, Paolo, editor, and Gargano, Luisa, editor

Published
2010
Full Text
View/download PDF

24. A New Concept Map Model for E-Learning Environments

Author

Dattolo, Antonina, Luccio, Flaminia L., van der Aalst, Will, Series editor, Mylopoulos, John, Series editor, Sadeh, Norman M., Series editor, Shaw, Michael J., Series editor, Szyperski, Clemens, Series editor, Cordeiro, José, editor, Hammoudi, Slimane, editor, and Filipe, Joaquim, editor

Published
2009
Full Text
View/download PDF

25. Blunting Differential Attacks on PIN Processing APIs

Author

Focardi, Riccardo, Luccio, Flaminia L., Steel, Graham, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Jøsang, Audun, editor, Maseng, Torleiv, editor, and Knapskog, Svein Johan, editor

Published
2009
Full Text
View/download PDF

26. Type-Based Analysis of PIN Processing APIs

Author

Centenaro, Matteo, Focardi, Riccardo, Luccio, Flaminia L., Steel, Graham, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Backes, Michael, editor, and Ning, Peng, editor

Published
2009
Full Text
View/download PDF

29. Intruder Capture in Sierpiński Graphs

Author

Luccio, Flaminia L., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Crescenzi, Pierluigi, editor, Prencipe, Giuseppe, editor, and Pucci, Geppino, editor

Published
2007
Full Text
View/download PDF

30. Mobile Agents Rendezvous When Tokens Fail

Author

Flocchini, Paola, Kranakis, Evangelos, Krizanc, Danny, Luccio, Flaminia L., Santoro, Nicola, Sawchuk, Cindy, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Královic̆, Ratislav, editor, and Sýkora, Ondrej, editor

Published
2004
Full Text
View/download PDF

31. Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks

Author

Luccio, Flaminia L., Sibeyn, Jop F., Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Královic̆, Ratislav, editor, and Sýkora, Ondrej, editor

Published
2004
Full Text
View/download PDF

33. Complexity of Nesting Analysis in Mobile Ambients

Author

Braghin, Chiara, Cortesi, Agostino, Focardi, Riccardo, Luccio, Flaminia L., Piazza, Carla, Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Zuck, Lenore D., editor, Attie, Paul C., editor, Cortesi, Agostino, editor, and Mukhopadhyay, Supratik, editor

Published
2003
Full Text
View/download PDF

35. String recognition on anonymous rings

Author

Kranakis, Evangelos, Krizanc, Danny, Luccio, Flaminia L., Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Wiedermann, Jiří, editor, and Hájek, Petr, editor

Published
1995
Full Text
View/download PDF

39. Broadcasting with Mobile Agents in Dynamic Networks

Author

Das, Shantanu, Giachoudis, Nikos, Luccio, Flaminia L., Markou, Euripides, Das, Shantanu, Giachoudis, Nikos, Luccio, Flaminia L., and Markou, Euripides

Abstract

We study the standard communication problem of broadcast for mobile agents moving in a network. The agents move autonomously in the network and can communicate with other agents only when they meet at a node. In this model, broadcast is a communication primitive for information transfer from one agent, the source, to all other agents. Previous studies of this problem were restricted to static networks while, in this paper, we consider the problem in dynamic networks modelled as an evolving graph. The dynamicity of the graph is unknown to the agents; in each round an adversary selects which edges of the graph are available, and an agent can choose to traverse one of the available edges adjacent to its current location. The only restriction on the adversary is that the subgraph of available edges in each round must span all nodes; in other words the evolving graph is constantly connected. The agents have global visibility allowing them to see the location of other agents in the graph and move accordingly. Depending on the topology of the underlying graph, we determine how many agents are necessary and sufficient to solve the broadcast problem in dynamic networks. While two agents plus the source are sufficient for ring networks, much larger teams of agents are necessary for denser graphs such as grid graphs and hypercubes, and finally for complete graphs of n nodes at least n-2 agents plus the source are necessary and sufficient. We show lower bounds on the number of agents and provide some algorithms for solving broadcast using the minimum number of agents, for various topologies.

Published
2021
Full Text
View/download PDF

40. Broadcasting with Mobile Agents in Dynamic Networks

Author

Shantanu Das and Nikos Giachoudis and Flaminia L. Luccio and Euripides Markou, Das, Shantanu, Giachoudis, Nikos, Luccio, Flaminia L., Markou, Euripides, Shantanu Das and Nikos Giachoudis and Flaminia L. Luccio and Euripides Markou, Das, Shantanu, Giachoudis, Nikos, Luccio, Flaminia L., and Markou, Euripides

Abstract

We study the standard communication problem of broadcast for mobile agents moving in a network. The agents move autonomously in the network and can communicate with other agents only when they meet at a node. In this model, broadcast is a communication primitive for information transfer from one agent, the source, to all other agents. Previous studies of this problem were restricted to static networks while, in this paper, we consider the problem in dynamic networks modelled as an evolving graph. The dynamicity of the graph is unknown to the agents; in each round an adversary selects which edges of the graph are available, and an agent can choose to traverse one of the available edges adjacent to its current location. The only restriction on the adversary is that the subgraph of available edges in each round must span all nodes; in other words the evolving graph is constantly connected. The agents have global visibility allowing them to see the location of other agents in the graph and move accordingly. Depending on the topology of the underlying graph, we determine how many agents are necessary and sufficient to solve the broadcast problem in dynamic networks. While two agents plus the source are sufficient for ring networks, much larger teams of agents are necessary for denser graphs such as grid graphs and hypercubes, and finally for complete graphs of n nodes at least n-2 agents plus the source are necessary and sufficient. We show lower bounds on the number of agents and provide some algorithms for solving broadcast using the minimum number of agents, for various topologies.

Published
2021
Full Text
View/download PDF

42. Broadcasting with Mobile Agents in Dynamic Networks

Author

Das, Shantanu, Giachoudis, Nikos, Luccio, Flaminia L., Markou, Euripides, Algorithmique Distribuée (DALGO), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Aix-Marseille Université - Faculté des Sciences (AMU SCI), Aix Marseille Université (AMU), Université de Venise Ca’ Foscari | Università Ca’ Foscari di Venezia, University of Thessaly [Lamia], and DAS, Shantanu

Subjects
Constantly Connected, Settore INF/01 - Informatica, Global visibility, Dynamic Networks, Computer Science::Multiagent Systems, Broadcast, Constantly connected, Distributed algorithm, Dynamic networks, Mobile agents, Theory of computation → Graph algorithms analysis, Distributed Algorithm, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Networks → Network algorithms, Theory of computation → Distributed algorithms, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Mobile Agents
Abstract

We study the standard communication problem of broadcast for mobile agents moving in a network. The agents move autonomously in the network and can communicate with other agents only when they meet at a node. In this model, broadcast is a communication primitive for information transfer from one agent, the source, to all other agents. Previous studies of this problem were restricted to static networks while, in this paper, we consider the problem in dynamic networks modelled as an evolving graph. The dynamicity of the graph is unknown to the agents; in each round an adversary selects which edges of the graph are available, and an agent can choose to traverse one of the available edges adjacent to its current location. The only restriction on the adversary is that the subgraph of available edges in each round must span all nodes; in other words the evolving graph is constantly connected. The agents have global visibility allowing them to see the location of other agents in the graph and move accordingly. Depending on the topology of the underlying graph, we determine how many agents are necessary and sufficient to solve the broadcast problem in dynamic networks. While two agents plus the source are sufficient for ring networks, much larger teams of agents are necessary for denser graphs such as grid graphs and hypercubes, and finally for complete graphs of n nodes at least n-2 agents plus the source are necessary and sufficient. We show lower bounds on the number of agents and provide some algorithms for solving broadcast using the minimum number of agents, for various topologies., LIPIcs, Vol. 184, 24th International Conference on Principles of Distributed Systems (OPODIS 2020), pages 24:1-24:16

Published
2020

Catalog

Books, media, physical & digital resources
See catalog results