International Conference on Computer Aided Systems Theory

EUROCAST 2005: Computer Aided Systems Theory – EUROCAST 2005 pp 346-354

Algorithm for Proving the Knowledge of an Independent Vertex Set

  • Pino Caballero-Gil
  • Candelaria Hernández-Goya
Conference paper

DOI: 10.1007/11556985_45

Volume 3643 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Caballero-Gil P., Hernández-Goya C. (2005) Algorithm for Proving the Knowledge of an Independent Vertex Set. In: Moreno Díaz R., Pichler F., Quesada Arencibia A. (eds) Computer Aided Systems Theory – EUROCAST 2005. EUROCAST 2005. Lecture Notes in Computer Science, vol 3643. Springer, Berlin, Heidelberg

Abstract

A new protocol is presented that allows to convince of the knowledge of a solution to the Independent Vertex Set Problem without revealing anything about it. It is constructed from a bit commitment scheme based on the hardness of the Discrete Logarithm Problem, which guarantees its efficient performance and formal security. One of its possible applications is node identification in ad-hoc wireless network because it does not require any authentication servers. Furthermore, recent works on network security has pointed out the importance of the design of efficient Zero Knowledge Proofs of Knowledge for the Independent Vertex Set Problem in broadcast models.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Pino Caballero-Gil
    • 1
  • Candelaria Hernández-Goya
    • 1
  1. 1.Dept. Statistics, Operations Research and ComputingUniversity of La LagunaLa LagunaSpain