First International Conference on Availability, Reliability and Security (ARES'06) 2006
DOI: 10.1109/ares.2006.15
|View full text |Cite
|
Sign up to set email alerts
|

A Secure Event Agreement (SEA) protocol for peer-to-peer games

Abstract: Secure updates in a peer-to-peer game where all of the players are untrusted offers a unique challenge. We analyse the NEO protocol [5] which was designed to accomplish the exchange of update information among players in a fair and authenticated manner. We show that of the five forms of cheating it was designed to prevent, it prevents only three. We then propose an improved protocol which we call Secure Event Agreement (SEA) which prevents all five types of cheating as well as meeting some additional security … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

2007
2007
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 33 publications
(28 citation statements)
references
References 9 publications
0
28
0
Order By: Relevance
“…NEO claims to prevent common protocol-level cheats with low latency, such that the adversaries cannot gain any advantages by modifying messages between players. Corman et al [14] later show that NEO cannot prevent all cheats as claimed, and present an improvement called Secure Event Agreement (SEA). However, both protocols are not practical due to the excessive use of cryptographic signatures.…”
Section: Related Workmentioning
confidence: 99%
See 4 more Smart Citations
“…NEO claims to prevent common protocol-level cheats with low latency, such that the adversaries cannot gain any advantages by modifying messages between players. Corman et al [14] later show that NEO cannot prevent all cheats as claimed, and present an improvement called Secure Event Agreement (SEA). However, both protocols are not practical due to the excessive use of cryptographic signatures.…”
Section: Related Workmentioning
confidence: 99%
“…Corman et al [14] present an improvement of NEO as described in Formula (2), where H() is a hash function, U r A is the update from player A for round r, n r is a random value for round r, SessID is the session ID to prevent replaying this message in a different session or with a different group of players, ID A is the unique identity of player A, and V h r−1 A is the update from player A for round r − 1 that includes a hash of the update.…”
Section: Description Of Seamentioning
confidence: 99%
See 3 more Smart Citations