EconPapers    
Economics at your fingertips  
 

On the Design of Agent Agreement Protocol using Linear Error-Correcting Codes

Panayotis E. Nastou (), Panos Pardalos (), Paul Spirakis () and Yannis C. Stamatiou ()
Additional contact information
Panayotis E. Nastou: University of Florida
Panos Pardalos: University of Florida
Paul Spirakis: Computer Technology Institute and Press (“Diophantus”)
Yannis C. Stamatiou: University of Patras

A chapter in Applications of Mathematics and Informatics in Science and Engineering, 2014, pp 389-403 from Springer

Abstract: Abstract In a number of situations, it is necessary for two agents who may have never communicated in the past to, jointly, create a shared information item which can serve as a basis for subsequent protocols that the agents may wish to execute (e.g., negotiation or encryption protocols). One way to create this shared piece of information is to have the two agents start with one random bit string each and then engage in a protocol that enables them to transform, gradually, bit differences (in their strings) into bit agreements. In a previous work, an efficient protocol was proposed which was based on the use of the Extended Golay error-correcting code in order to locate and “correct” bit differences. In this work we generalize this protocol in order to use any generic error-correcting code and derive theoretical performance bounds on the efficiency, based on the characteristics of the employed code. The proposed generalized protocol is fair, in that the final strings (which have the same bits in the majority of positions) depend on the strings possessed by both agents while each agent contributes to the same degree in the formation of these strings. Finally, the proposed protocol is lightweight (both computationally and with respect to message exchanges) and, thus, can be implemented in embedded systems and resource limited devices.

Keywords: Linear Code; Cyclic Code; Information Item; Parity Check Matrix; Decode Scheme (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-04720-1_24

Ordering information: This item can be ordered from
http://www.springer.com/9783319047201

DOI: 10.1007/978-3-319-04720-1_24

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-04-01
Handle: RePEc:spr:spochp:978-3-319-04720-1_24