The epistemic gossip problem

Cooper, Martin; Herzig, Andreas; Maffre, Faustine; Maris, Frédéric; Régnier, Pierre

doi:10.1016/j.disc.2018.10.041

Cited by 13 publications

(16 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors in [ 128 ] optimized the Byzantine consensus algorithm by adopting time sequence and gossip protocol [ 129 ] to validate IoV information for correctness before adding them to the consortium blockchain. The use of gossip protocol, specifically the push–pull mode, enables faster data exchange among IoV nodes, as each two neighboring nodes can have the same information in one cycle.…”

Section: Blockchain-based Authentication Schemes In Vehicular Networkmentioning

confidence: 99%

Blockchain-Based Authentication in Internet of Vehicles: A Survey

Abbas

Talib

Ahmed

et al. 2021

Sensors

View full text Add to dashboard Cite

Internet of Vehicles (IoV) has emerged as an advancement over the traditional Vehicular Ad-hoc Networks (VANETs) towards achieving a more efficient intelligent transportation system that is capable of providing various intelligent services and supporting different applications for the drivers and passengers on roads. In order for the IoV and VANETs environments to be able to offer such beneficial road services, huge amounts of data are generated and exchanged among the different communicated entities in these vehicular networks wirelessly via open channels, which could attract the adversaries and threaten the network with several possible types of security attacks. In this survey, we target the authentication part of the security system while highlighting the efficiency of blockchains in the IoV and VANETs environments. First, a detailed background on IoV and blockchain is provided, followed by a wide range of security requirements, challenges, and possible attacks in vehicular networks. Then, a more focused review is provided on the recent blockchain-based authentication schemes in IoV and VANETs with a detailed comparative study in terms of techniques used, network models, evaluation tools, and attacks counteracted. Lastly, some future challenges for IoV security are discussed that are necessary to be addressed in the upcoming research.

show abstract

Section: Blockchain-based Authentication Schemes In Vehicular Networkmentioning

confidence: 99%

Blockchain-Based Authentication in Internet of Vehicles: A Survey

Abbas

Talib

Ahmed

et al. 2021

Sensors

View full text Add to dashboard Cite

show abstract

“…Let G 1 be modification of G 1 that is obtained by replacing the actions Call i j by Tcall i j of Example 6. Then G 1 can be solved in log 2 n steps of parallel calls if the number of agents n is even, and in log 2 n + 1 steps if n is odd (Bavelas 1950;Landau 1954;Knödel 1975;Cooper et al 2019). For instance, for n = 4 the parallel plan {Tcall 1 2 , Tcall 3 4 }, {Tcall 1 3 , Tcall 2 4 } is a solution of G 1 with 2 steps.…”

Section: Solvability By Parallel Plansmentioning

confidence: 99%

“…We here apply it to parallel epistemic planning: we provide a reduction of EL-O-based parallel planning to classical planning, which allows us to translate planning tasks into PDDL and use classical planners. We illustrate our approach with a parallel version of the epistemic gossip problem (Cooper et al 2019) where n agents initially each know their secret but not the others'; agents can exchange all secrets they know during a phone call to another agent; and the goal is to achieve shared knowledge of all secrets, i.e., everybody knows every secret. A parallel solution is a sequence of sets of calls.…”

Section: Introductionmentioning

confidence: 99%

Lightweight Parallel Multi-Agent Epistemic Planning

Cooper

Herzig

Maris

et al. 2020

Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning

Self Cite

View full text Add to dashboard Cite

We study a simple version of multi-agent epistemic planning where the number of parallel steps has to be minimized. We prove that this extension of classical planning is in PSPACE. We propose an encoding in PDDL and present some experiments providing evidence that this encoding allows us to solve practical problems. The types of problems we can encode include problems in which one agent can teach another agent how to perform a task and communication problems where some information must not be revealed to some agents.

show abstract

“…The failure to reach a sufficiently high level of coordination for the 2n − 4 solution has lead to many papers on the gossip problem where calls are made randomly [19,22,27,25,28], and more recently to a new wave of papers on the gossip problem that study epistemic protocols [6,1,37,7,26,3,40,4,17]. A protocol, in this context, is simply a list of instructions of the form "if the condition ϕ ab is true, agent a should call agent b".…”

Section: The Gossip Problemmentioning

confidence: 99%

The logic of gossiping

Ditmarsch¹,

Hoek²,

Kuijer³

2020

Artificial Intelligence

View full text Add to dashboard Cite

The so-called gossip problem is a formal model of peer-to-peer communication. In order to perform such communication efficiently, it is important to keep track of what agents know about who holds what information at a given point in time. The knowledge that the agents possess depends strongly on the particular type of communication that is used. Here, we formally define a large number of different variants of the gossip problem, that differ in the extent to which communication is private (observable, synchronous or asynchronous), the direction of the flow of information (caller to callee, callee to caller or both) and whether the agents become aware of the exact set of information possessed by their communication partner. We consider a number of formulas that represent interesting properties that a gossip situation may or may not enjoy, and show for which variants they are valid. Additionally, we show that the model checking and validity checking problems for each variant are decidable, and we introduce sound and complete proof systems for them.

show abstract

The epistemic gossip problem

Cited by 13 publications

References 23 publications

Blockchain-Based Authentication in Internet of Vehicles: A Survey

Blockchain-Based Authentication in Internet of Vehicles: A Survey

Lightweight Parallel Multi-Agent Epistemic Planning

The logic of gossiping

Contact Info

Product

Resources

About