OpenAlex | Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability

Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability

Work

Year: 2019

Type: article

Abstract: In recent years, a new approach has been developed for verifying security protocols with the aim of combining the benefits of symbolic attackers and the benefits of unconditional soundness: the techni... more

Source: ACM Transactions on Computational Logic

Authors Gergei Bana, Rohit Chadha, Ajay Kumar Eeralla, Mitsuhiro Okada

Institutions University of Luxembourg, University of Missouri, Keio University

Cites: 30

Cited by: 2

Related to: 10

FWCI: 0.3

Citation percentile (by year/subfield): 59.85

Topic: Advanced Authentication Protocols Security

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Sustainable Development Goal Peace, justice, and strong institutions

Open Access status: bronze

Funders National Science Foundation, Fonds National de la Recherche Luxembourg, Japan Society for the Promotion of Science, FP7 Ideas: European Research Council

Grant IDS CNS 1553548 and CNS 1314338, Pol-Lux project VoteVerif (POLLUX-IV/1/2016), KAKENHI Grant 17H02263, 17H02265 and AYME, ERC Consolidator Grant CIRCUS (683032)