Please use this identifier to cite or link to this item: http://drsr.daiict.ac.in//handle/123456789/150
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorMathuria, Anish M.
dc.contributor.authorGahlot, Jai
dc.date.accessioned2017-06-10T14:37:10Z-
dc.date.available2017-06-10T14:37:10Z-
dc.date.issued2007
dc.identifier.citationGahlot, Jai (2007). Security analysis of two fair exchange protocols. Dhirubhai Ambani Institute of Information and Communication Technology, vii, 97 p. (Acc.No: T00113)
dc.identifier.urihttp://drsr.daiict.ac.in/handle/123456789/150-
dc.description.abstractE-commerce applications enable two parties to exchange digital items electronically. It is critical for such applications that the underlying protocols ensure the fairness requirement: no honest participant should suffer any loss of significant value. It is important to verify that an e-commerce protocol satisfies its fairness goal. Formal methods such as model checking can be helpful in this regard. To this end, it is essential to develop a model of the protocol under realistic assumptions. Using the NetBill protocol as an example this work shows how improper modelling can lead to incorrect claims about the protocol. It also shows how a carefully developed formal model can be successfully used to discover previously unknown flaws in an existing protocol.
dc.publisherDhirubhai Ambani Institute of Information and Communication Technology
dc.subjectComputer security
dc.subjectAccess control
dc.subjectComputer network protocols
dc.subjectRight of electronic commerce
dc.subjectSecurity measures
dc.subjectSecurity assessment
dc.subjectSecurity auditing
dc.classification.ddc005.8 GAH
dc.titleSecurity analysis of two fair exchange protocols
dc.typeDissertation
dc.degreeM. Tech
dc.student.id200511014
dc.accession.numberT00113
Appears in Collections:M Tech Dissertations

Files in This Item:
File Description SizeFormat 
200511014.pdf
  Restricted Access
540.25 kBAdobe PDFThumbnail
View/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.