Logical Verification of Secure Electronic Transactions Protocol

Qing Chen · 2000

In the previous work, some segments of secure electronic transactions (SET) are verified, and some potential problems in SET are also discussed. Based on these, all transactions in SET are strictly logically verified in this paper. Though this formal logic verification, certain problems are found to do exist in SET. Solutions to these problems are also discussed.

Read the paper · More papers on PaperTik