References of "Lenzini, Gabriele 50002200"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailSelective location blinding using hash chains
Lenzini, Gabriele UL; Mauw, Sjouke UL; Pang, Jun UL

in Proc. 19th International Workshop on Security Protocols (2011)

Detailed reference viewed: 161 (7 UL)
Full Text
Peer Reviewed
See detailContextual biometric-based authentication for ubiquitous services
Buhan, Ileana; Lenzini, Gabriele UL; Radomirovic, Sasa UL

in Proc. of the 7th International Conference on Ubiquitous Intelligence and Computing (UIC 2010) (2010)

We introduce and comment on the concept of contextual pseudo identity. A contextual pseudo identity is a soft identity token that is built from both a user's biometric and the context. When it comes to ... [more ▼]

We introduce and comment on the concept of contextual pseudo identity. A contextual pseudo identity is a soft identity token that is built from both a user's biometric and the context. When it comes to ubiquitous authentication, a contextual pseudo identity promises better security than that o ered by traditional biometrics-based identity tokens: the use of context improves the tokens' disposability and renewability, which are two essential properties in the protection of a user's real identity. Our algorithm for generating contextual pseudo identities extends a Fuzzy Embedder so that it accepts both biometric and context dependent input. We prove that our way of processing the context preserves the security and reliability properties of the Fuzzy Embedder used in our extension. An example shows how a user can utilize contextual pseudo identity to authenticate to and access ubiquitous services. [less ▲]

Detailed reference viewed: 138 (4 UL)
Peer Reviewed
See detailTrust-Based and Context-Aware Authentication in a Software Architecture for Context and Proximity-Aware Services
Lenzini, Gabriele UL

in de Lemos, R.; Fabre, J. C.; Gacek, C. (Eds.) et al Architecting Dependable Systems VI 2018-09-18 22:51:18 +0000 2019-06-15 18:11:00 +0200 (2009)

Detailed reference viewed: 33 (0 UL)
Peer Reviewed
See detailA Formal Specification and Validation of a Control System in Presence of Byzantine Errors
Gnesi, Stefania; Latella, Diego; Lenzini, Gabriele UL et al

in Proc.~of the 6th Int. Conference Tool and Algorithms for the Construction and Analysis of Systems (TACAS 2000), in ETAPS 2000 -- March 25 - April 2, 2000, Berlin, Germany (2000)

This paper describes an experience in formal specification and fault tolerant behavior validation of a railway critical system. The work, performed in the context of a real industrial project, had the ... [more ▼]

This paper describes an experience in formal specification and fault tolerant behavior validation of a railway critical system. The work, performed in the context of a real industrial project, had the following main targets: (a) to validate specific safety properties in the presence of byzantine system components or of some hardware temporary faults; (b) to design a formal model of a critical railway system at a right level of abstraction so that could be possible to verify certain safety properties and at the same time to use the model to simulate the system. For the model specification we used the Promela language, while the verification was performed using the SPIN model checker. Safety properties were specifi%% Part Glue ed by means of both assertions and temporal logic formulae. To make the problem of validation tractable in the SPIN environment, we used ad hoc abstraction techniques. http://matrix.iei.pi.cnr.it/~lenzini/papers/tacas00.ps.gz 2018-09-18 22:51:18 +0000 2019-06-15 18:30:22 +0200 [less ▲]

Detailed reference viewed: 64 (0 UL)
Peer Reviewed
See detailModel Checking of Cryptographic Protocols using HD-Automata
Gnesi, Stefania; Latella, Diego; Lenzini, Gabriele UL

in 4th Italian Workshop on Sistemi Distribuiti: Algoritmi, Architetture e Linguaggi (WSDAAL'99), June 13-15, 1999, Fonte Cerreto (L'Aquila), Italy 2018-09-18 22:51:18 +0000 2019-06-15 18:31:23 +0200 (1999)

In this work we will present a preliminary study about the design of a model checking environment for cryptographic protocols. In particular given a specification of a protocol in spi-calculus and given ... [more ▼]

In this work we will present a preliminary study about the design of a model checking environment for cryptographic protocols. In particular given a specification of a protocol in spi-calculus and given some properties expressed in an appropriate logic (i.e., ACTL) we will propose a specialized version of the History Dependent Automata Laboratory (HAL) environment, in such a way to treat with cryptographic protocols. HAL is an integrated tool set for specification, verification an analysis of concurrent system, based on HD automata. [less ▲]

Detailed reference viewed: 66 (0 UL)
Peer Reviewed
See detailSequence Comparison: Close and Open problems
Lenzini, Gabriele UL

in Proc.~of Workshop ``La matematizzazione della Biologia: storia e problematiche attuali'', Arcidosso (GR), Italy (1998)

Comparing sequences is a very important activity both in computer science and in a many other areas as well. For example thank to text editors, everyone knows the particular instance of a sequence ... [more ▼]

Comparing sequences is a very important activity both in computer science and in a many other areas as well. For example thank to text editors, everyone knows the particular instance of a sequence comparison problem knonw as ``string mathcing problem''. It consists in searching a given work eventually with errors, in a long text. Among the wide literature about sequence comparison problems this paper focuses on those problems which arestricty related with molecular biology. These problems are significant representatives of formal problems in the ``computational biology'', a discipline recently born whose aim is the formalization and the analysis of biological discrete problems. http://matrix.iei.pi.cnr.it/~lenzini/papers/pcr-cissc98.ps.gz 2018-09-18 22:51:18 +0000 2019-06-15 18:30:42 +0200 [less ▲]

Detailed reference viewed: 28 (0 UL)
Peer Reviewed
See detailAlgorithms For Phylogeny Reconstruction In a New Mathematical Model
Lenzini, Gabriele UL; Marianelli, Silvia

in Calcolo (1997), 1-4(34), 1-24

The evolutionary history of a set of species is represented by a tree called phylogenetic tree or phylogeny. Its structure depends on precise biological assumptions about the evolution of species ... [more ▼]

The evolutionary history of a set of species is represented by a tree called phylogenetic tree or phylogeny. Its structure depends on precise biological assumptions about the evolution of species. Problems related to phylogeny reconstruction (i.e., finding a tree representation of information regarding a set of items) are widely studied in computer science. Most of these problems have found to be NP-hard. Sometimes they can solved polynomially if appropriate restrictions on the structure of the tree are fixed. This paper summarizes the most recent problems and results in phylogeny reconstruction, and introduces an innovative tree model, called Phylogenetic Parsimonious Tree, which is justified by significant biological hypothesis. Using PPT two problems are studied: the existence and the reconstruction of a tree both when sequences of characters and partial order on interspecies distances are given. We rove complexity results that confirm the hardness of this class of problems. [less ▲]

Detailed reference viewed: 41 (5 UL)
See detailAutomatic Phylogeny Reconstruction Under a New Hypothesis
Lenzini, Gabriele UL; Marianelli, Silvia; Luccio, Fabrizio et al

Scientific Conference (1996)

Detailed reference viewed: 30 (0 UL)