Advertisement

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

  • Panayotis E. NastouEmail author
  • Panos Pardalos
  • Paul Spirakis
  • Yannis C. Stamatiou
Chapter
Part of the Springer Optimization and Its Applications book series (SOIA, volume 91)

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 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    S. Aaronson, “The Complexity of Agreement”, University of California, Berkeley, arXiv:cs.cc/406061 v1, 2004.Google Scholar
  2. 2.
    Panayotis E. Nastou, Paul Spirakis, Yiannis C. Stamatiou and Christina Vichou, “Agent Agreement Protocols based on Golay Error-Correcting Code”, Proceedings of the 4th International Conference on Information, Intelligence, Systems and Applications, Pireous, Greece, July 2013.Google Scholar
  3. 3.
    Y. Dodis, R. Ostrovsky, L. Reyzin, and A. Smith, “Fuzzy Extractors: how to generate strong keys from biometrics and other noisy data”, SIAM J. on Comp., 38(1), pp. 97–139, 2008.CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    A. Juels and M. Sudan, “A fuzzy vault scheme”, Designs, Codes and Cryptography, 38(2), pp. 237–257, 2006.CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    J. Bringer, H. Chabanne, G. Cohen, B. Kindarji and G. Zémor, “Optimal iris fuzzy sketches”, IEEE 1st International Conf. on Biometrics: Theory, Applications and Systems, 2007.Google Scholar
  6. 6.
    J. Bringer, H. Chabanne and B. Kindarji, “The best of both worlds: Applying secure sketches to cancelable biometrics”, Science of Computer Programming, 74(1), pp. 43–51, 2008.CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    S. Cimato, M. Gamassi, V. Piuri, R. Sassi and F. Scotti, “Privacy-aware biometrics: Design and implementation of a multimodal verification system”, IEEE Computer Security Applications Conference, ACSAC, pp. 130–139, 2008.Google Scholar
  8. 8.
    R. Dalal, Y. Singh, and M. Khari, “A Review on Key Management Schemes in MANET”, International Journal of Distributed and Parallel Systems, Vol. 3, No. 4, 2012.Google Scholar
  9. 9.
    S. Roman, Coding and Information Theory. Springer Verlag, 1992.Google Scholar
  10. 10.
    Robert Morelos-Zaragosa, The Art of Error-Correcting Coding John Wiley and Sons, Inc., 2006.Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Panayotis E. Nastou
    • 1
    • 2
    • 3
    Email author
  • Panos Pardalos
    • 1
    • 2
  • Paul Spirakis
    • 5
    • 6
  • Yannis C. Stamatiou
    • 4
    • 5
  1. 1.Center for Applied OptimizationUniversity of FloridaGainesvilleUSA
  2. 2.Department of Industrial and Systems EngineeringUniversity of FloridaGainesvilleUSA
  3. 3.Department of MathematicsUniversity of AegeanSamosGreece
  4. 4.Department of Business AdministrationUniversity of PatrasPatraGreece
  5. 5.Computer Technology Institute and Press (“Diophantus”)PatrasGreece
  6. 6.Computer Science DepartmentUniversity of LiverpoolMerseysideUK

Personalised recommendations