Towards a Quantitative Analysis of Security Protocols

Adão, Pedro; Mateus, Paulo; Reis, Tiago; Viganò, Luca

doi:10.1016/j.entcs.2006.07.009

Cited by 5 publications

(4 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Classical techniques, like numerical analysis and performance evaluation, received attention from time to time. During this period, 72 papers were published, collecting 924 citations, CiteScore equal to 12.83 and h-index equal to 15 1 .…”

Section: Trendsmentioning

confidence: 99%

“…Other interesting extensions of model checking are concerned with both analysis and modeling issues. For instance, in the former case it is worth mentioning the analysis of infinite-state models (see, e.g., the case of CTMCs and CSL [120], and the local abstraction refinement approach developed for MDPs and reachability properties, and even implemented in PRISM [64]) and of distributed probabilistic input/output automata [75], while in the latter case, some developments emerged in the last decade are given by the analysis of security [1], mobility [53], and of temporal and epistemic properties of quantum systems, the automated verification of which is proposed in the setting of the symbolic model checker MCMAS [21].…”

Section: Analysis Techniques and Tools: Program Analysis Model Checki...mentioning

confidence: 99%

See 1 more Smart Citation

Quantitative Aspects of Programming Languages and Systems over the past 2^4 years and beyond

Aldini

2020

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Quantitative aspects of computation are related to the use of both physical and mathematical quantities, including time, performance metrics, probability, and measures for reliability and security. They are essential in characterizing the behaviour of many critical systems and in estimating their properties. Hence, they need to be integrated both at the level of system modeling and within the verification methodologies and tools. Along the last two decades a variety of theoretical achievements and automated techniques have contributed to make quantitative modeling and verification mainstream in the research community. In the same period, they represented the central theme of the series of workshops entitled Quantitative Aspects of Programming Languages and Systems (QAPL) and born in 2001. The aim of this survey is to revisit such achievements and results from the standpoint of QAPL and its community.

show abstract

Section: Trendsmentioning

confidence: 99%

Section: Analysis Techniques and Tools: Program Analysis Model Checki...mentioning

confidence: 99%

Quantitative Aspects of Programming Languages and Systems over the past 2^4 years and beyond

Aldini

2020

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…A number of approaches, e.g. [1,3,4,5,6,9,10,13], have been recently presented to perform formal protocol analysis in the presence of an intruder who can perform off-line guessing.…”

Section: Introductionmentioning

confidence: 99%

Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete

Adão

Mateus

Viganò

2014

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

Guessing, or dictionary, attacks arise when an intruder exploits the fact that honest agents executing a security protocol exchange certain data like passwords that may have low entropy, i.e. stem from a small set of values. One way to model such attacks is to formalize a Dolev-Yao-style intruder model with inference rules to capture the additional capabilities of the intruder concerning guessable data. In this paper, we formalize a cost-sensitive intruder deduction system where information is available at a cost: to get hold of data he does not know, the intruder invokes an oracle rule, which associates a cost to each data the intruder deduces in this way. Our deduction system manipulates data items labeled with their costs, so that we can answer the question of what is the cost of deducing a particular data that was meant to remain a secret between honest protocol participants. We also investigate the complexity of this quantitative intruder deduction insecurity problem and show that it is NP-complete in the case of a finite number of protocol sessions (i.e. for a fixed number of interleaved protocol runs).

show abstract

“…At IST-UTL, within the context of the QuantLog project described in Section 3, some aspects of the non experimental issues above are being addressed, namely: properties of entanglement in solid state systems [31]; particle statistics in quantum information [61,60]; quantum walks and their comparison with random walks [62]; quantum algorithms for searching [49] and in logic; quantum automata and their minimization and interconnection; quantum transition systems for model checking of quantum systems [7]; quantum logic [ [6]; and quantum attacks to classical cryptosystems.…”

Section: Discussionmentioning

confidence: 99%

Quantum Computation and Information

Sernadas

Mateus

Omar³

A Portrait of State-of-the-Art Research at the Technical University of Lisbon

Self Cite

View full text Add to dashboard Cite

After a very brief survey of the key milestones and open problems in quantum computation and information, the research effort at IST-UTL is outlined, namely, the goals, ongoing tasks and results of the QuantLog project. In order to illustrate some key issues in quantum computation, the problem of minimizing the number of qubits in quantum automata is presented in detail at a level appropriate for non-specialists.

show abstract

Towards a Quantitative Analysis of Security Protocols

Cited by 5 publications

References 33 publications

Quantitative Aspects of Programming Languages and Systems over the past 2^4 years and beyond

Quantitative Aspects of Programming Languages and Systems over the past 2^4 years and beyond

Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete

Quantum Computation and Information

Contact Info

Product

Resources

About