Reasoning about DNSSEC

Authors:
Kollapalli Ramesh Babu;Vineet Padmanabhan;Wilson Naik Bhukya
Affiliations:
Department of Computers & Information Sciences, University of Hyderabad, Hyderabad, India;Department of Computers & Information Sciences, University of Hyderabad, Hyderabad, India;Department of Computers & Information Sciences, University of Hyderabad, Hyderabad, India
Venue:
MIWAI'11 Proceedings of the 5th international conference on Multi-Disciplinary Trends in Artificial Intelligence
Year:
2011

Citing 6
Cited 0

A logic of authentication

ACM Transactions on Computer Systems (TOCS)
A semantics for a logic of authentication (extended abstract)

PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Extending cryptographic logics of belief to key agreement protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Reasoning about knowledge

Reasoning about knowledge
DNS and BIND

DNS and BIND
Security vulnerabilities in DNS and DNSSEC

ARES '07 Proceedings of the The Second International Conference on Availability, Reliability and Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

This Paper outlines a logic based formal approach to represent and reason about the DNSSEC (Domain Name System Security Extensions) protocol. DNSSEC provides security services to the existing DNS protocol mainly through public key cryptography. But, it is well known that even the use of the most perfect cryptographic tools does not always ensure the desired security goals. This situation arises because of logical flaws in the design of protocols. Our aim is to represent and reason about DNSSEC protocol using the Modal Logic system SVO so as to derive the desired goals of the protocol.