<P>The volume provides state-of-the-art in non-repudiation protocols and gives insight of its applicability to e-commerce applications. This professional book organizes the existing scant literature regarding non-repudiation protocols with multiple entities participation. It provides the reader with
Secure Multi-Party E-Commerce Protocols
✍ Scribed by Cătălin V. Bîrjoveanu, Mirela Bîrjoveanu
- Publisher
- Springer
- Year
- 2022
- Tongue
- English
- Leaves
- 117
- Series
- SpringerBriefs in Computer Science
- Category
- Library
No coin nor oath required. For personal study only.
✦ Synopsis
This book presents the state of the art for multi-party fair exchange protocols and provides insight details regarding multi-party applications for buying physical products. The authors tackle the fairness problem in e-commerce protocols for buying physical products in scenarios involving complex and chained transactions and provide use cases of these protocols for B2C and B2B scenarios. The book also includes the formal verification of the fair multi-party exchange e-commerce protocols using the Constraint-Logic-based Attack Searcher from AVISPA, a tool for the Automated Validation of Internet Security Protocols and Applications.
This book is mainly targeted to researchers in e-commerce security, yet it shall be interesting as well for professional developers in e-commerce. They all are provided with an understanding of and a starting point for designing secure multi-party e-commerce protocols.
✦ Table of Contents
Preface
Contents
1 Introduction
1.1 E-Commerce Types and Features
1.2 Security Threats in E-Commerce
1.3 E-Commerce Security Requirements and Protocols
1.4 Challenges and Purposes of the Book
1.5 Book Structure
References
2 Two-Party E-Commerce Protocols
2.1 State-of-the-Art Analysis
2.2 Subtransaction Protocol
2.2.1 Exchange Sub-protocol
2.2.2 Resolution Sub-protocol
SP Security Discussion
2.3 Protocol with Physical Product Delivery Providing Customer's Privacy
2.3.1 SPayment Sub-protocol
2.3.2 SDelivery Sub-protocol
2.3.3 Resolution Sub-protocols
Resolution 1 Sub-protocol
Resolution 2 Sub-protocol
Resolution 3 Sub-protocol
2.3.4 Security Analysis
2.4 Comparative Analysis
References
3 Multi-party E-Commerce Protocols for Complex Transactions
3.1 State-of-the-Art Analysis
3.2 B2B and B2C Use Cases
3.3 Security Requirements
3.4 Complex Transaction Protocol
3.4.1 AggregateAbort Sub-protocol
CTP Security Discussion
3.5 Complex Transaction Protocol Providing Customer's Privacy
3.5.1 CTPCP Security Discussion
3.6 Comparative Analysis
References
4 E-Commerce Protocols for Multi-chained Complex Transactions
4.1 State-of-the-Art Analysis
4.2 Applications B2C/B2B
4.3 Security Requirements
4.4 Chained Transaction Protocol
4.4.1 Resolution 1 Sub-protocol
4.4.2 Resolution 2 Sub-protocol
ChainedTP Security Discussion
4.5 Multi-chained Complex Transactions Protocol
4.5.1 AggregateChainsAbort Sub-protocol
MCCTP Security Discussion
References
5 Formal Verification of Multi-party Fair Exchange E-Commerce Protocols
5.1 AVISPA Tool
5.1.1 High-Level Protocol Specification Language
Messages and Types
Agent Roles
Composed Roles
Security Properties
5.1.2 Verification Results Using AVISPA
5.2 Verification of Complex Transaction Protocols
References
6 Conclusions
📜 SIMILAR VOLUMES
<p><P>Research oriented non-repudiation protocols have been active since the beginning of this millennium. It is time to take a step forward and realize that in many applications there are more than two entities. <STRONG>Secure Multi-Party Non-Repudiation Protocols and Applications</STRONG> supports
<p><P>In the setting of multi-party computation, sets of two or more parties with private inputs wish to jointly compute some (predetermined) function of their inputs. General results concerning secure two-party or multi-party computation were first announced in the 1980s. Put briefly, these results
<p><P>In the setting of multi-party computation, sets of two or more parties with private inputs wish to jointly compute some (predetermined) function of their inputs. General results concerning secure two-party or multi-party computation were first announced in the 1980s. Put briefly, these results
<p><P>In the setting of multi-party computation, sets of two or more parties with private inputs wish to jointly compute some (predetermined) function of their inputs. General results concerning secure two-party or multi-party computation were first announced in the 1980s. Put briefly, these results
<p><P>In the setting of multi-party computation, sets of two or more parties with private inputs wish to jointly compute some (predetermined) function of their inputs. General results concerning secure two-party or multi-party computation were first announced in the 1980s. Put briefly, these results