Algorithm for proving the knowledge of an independent vertex set

Authors:
Pino Caballero-Gil;Candelaria Hernández-Goya
Affiliations:
Dept. Statistics, Operations Research and Computing, University of La Laguna, La Laguna, Tenerife, Spain;Dept. Statistics, Operations Research and Computing, University of La Laguna, La Laguna, Tenerife, Spain
Venue:
EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory
Year:
2005

Citing 10
Cited 0

The knowledge complexity of interactive proof-systems

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The complexity of perfect zero-knowledge

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
How to prove all NP-statements in zero-knowledge, and a methodology of cryptographic protocol design

Proceedings on Advances in cryptology---CRYPTO '86
How to prove yourself: practical solutions to identification and signature problems

Proceedings on Advances in cryptology---CRYPTO '86
Demonstrating possession of a discrete logarithm without revealing it

Proceedings on Advances in cryptology---CRYPTO '86
Minimum disclosure proofs of knowledge

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Zero-knowledge proofs of identity

Journal of Cryptology
Strong Solutions to the Identification Problem

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Efficient Identification and Signatures for Smart Cards

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Efficient zero-knowledge proofs for some practical graph problems

SCN'02 Proceedings of the 3rd international conference on Security in communication networks

Quantified Score

Hi-index	0.00

Visualization

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.