Alessandro Armando

Alessandro Armando

Auto-generated profile, based on publicly available information

Alessandro Armando

DIBRIS - University of Genova

Research Focus & Metrics

Academic Career Length

38Years (1989-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2005
Verified
Book Chapter
Closed access
PDF file
AAA. Armando
A. Armando
DBD. Basin
D. Basin
YBY. Boichut
Y. Boichut
YCY. Chevalier
Y. Chevalier
LCL. Compagna
L. Compagna
LVL. Vigneron
L. Vigneron

27 October 2008
Verified
Conference Paper
Open access
AAAlessandro Armando
Alessandro Armando
RCRoberto Carbone
Roberto Carbone
LCLuca Compagna
Luca Compagna
JCJorge Cuellar
Jorge Cuellar
LTLlanos Tobarra
Llanos Tobarra
Single-Sign-On (SSO) protocols enable companies to establish a federated environment in which clients sign in the system once and yet are able to access to services offered by different companies. The OASIS Security Assertion Markup Language (SAML) 2.0 Web Browser SSO Profile is the emerging standard in this context. In this paper we provide formal models of the protocol corresponding to one of the most applied use case scenario (the SP-Initiated SSO with Redirect/POST Bindings) and of a variant of the protocol implemented by Google and currently in use by Google's customers (the SAML-based SSO for Google Applications). We have mechanically analysed these formal models with SATMC, a state-of-the-art model checker for security protocols. SATMC has revealed a severe security flaw in the protocol used by Google that allows a dishonest service provider to impersonate a user at another service provider. We have also reproduced this attack in an actual deployment of the SAML-based SSO for Google Applications. This security flaw of the SAML-based SSO for Google Applications was previously unknown.

13 November 2008 in International Journal on Software Tools for Technology Transfer
Verified
Journal Article
Closed access
PDF file
AAAlessandro Armando
Alessandro Armando
JMJacopo Mantovani
Jacopo Mantovani
LPLorenzo Platania
Lorenzo Platania

1 June 2003 in Information and Computation
Verified
Journal Article
Closed access
AAAlessandro Armando
Alessandro Armando
SRSilvio Ranise
Silvio Ranise
MRMichaël Rusinowitch
Michaël Rusinowitch

23 January 2009 in ACM Transactions on Computational Logic
Verified
Journal Article
Open access
AAAlessandro Armando
Alessandro Armando
MBMaria Paola Bonacina
Maria Paola Bonacina
SRSilvio Ranise
Silvio Ranise
SSStephan Schulz
Stephan Schulz
Program analysis and verification require decision procedures to reason on theories of data structures. Many problems can be reduced to the satisfiability of sets of ground literals in theory T . If a sound and complete inference system for first-order logic is guaranteed to terminate on T-satisfiability problems , any theorem-proving strategy with that system and a fair search plan is a T-satisfiability procedure . We prove termination of a rewrite-based first-order engine on the theories of records , integer offsets , integer offsets modulo and lists . We give a modularity theorem stating sufficient conditions for termination on a combination of theories , given termination on each. The above theories, as well as others, satisfy these conditions. We introduce several sets of benchmarks on these theories and their combinations, including both parametric synthetic benchmarks to test scalability , and real-world problems to test performances on huge sets of literals. We compare the rewrite-based theorem prover E with the validity checkers CVC and CVC Lite. Contrary to the folklore that a general-purpose prover cannot compete with reasoners with built-in theories, the experiments are overall favorable to the theorem prover, showing that not only the rewriting approach is elegant and conceptually simple, but has important practical implications.

21 September 2007 in International Journal of Information Security
Verified
Journal Article
Closed access
PDF file
AAAlessandro Armando
Alessandro Armando
LCLuca Compagna
Luca Compagna