A Logic Programming Approach for Formal Verification of NetBill Security and Transactions Protocol
Suvansh Lal

TL;DR
This paper applies logic programming techniques, specifically ALSP and SMODELS, to formally verify the security properties of the NetBill protocol, aiming to improve electronic commerce security reliability.
Contribution
It introduces a novel application of ALSP and SMODELS for formal verification and attack planning on the NetBill protocol.
Findings
Successful formal analysis of NetBill security features
Identification of potential vulnerabilities in the protocol
Demonstration of logic programming effectiveness in protocol verification
Abstract
Use of formal techniques for verifying the security features of electronic commerce protocols would facilitate, the enhancement of reliability of such protocols, thereby increasing their usability. This paper projects the application of logic programming techniques for formal verification of a well referred security and transactions protocol, the NetBill. The paper uses ALSP (Action Language for Security Protocols) as an efficient formal specification language and SMODELS a model generator to formally analyze and plan attacks on the protocol.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Authentication Protocols Security · Formal Methods in Verification · Access Control and Trust
