Algorithm for Proving the Knowledge of an Independent Vertex Set

机译：证明独立顶点集的知识的算法

获取原文

获取原文并翻译 | 示例

页面导航

摘要
著录项
相似文献
相关主题

摘要

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.

机译：提出了一种新的协议，该协议可以说服独立顶点集问题的解决方案知识，而无需透露任何相关信息。它基于离散对数问题的难点，由一个位承诺方案构造而成，从而保证了其有效的性能和形式上的安全性。其可能的应用之一是自组织无线网络中的节点标识，因为它不需要任何身份验证服务器。此外，有关网络安全的最新工作指出广播模型中针对独立顶点集问题设计有效的零知识证明的重要性。

著录项

来源
《International Conference on Computer Aided Systems Theory(EUROCAST 2005); 20050207-11; Las Palmas de Gran Canaria(ES)》|2005年|P.346-354|共9页
会议地点 Las Palmas de Gran Canaria(ES)
作者
Pino Caballero-Gil; Candelaria Hernandez-Goya;
展开▼
作者单位

Dept. Statistics, Operations Research and Computing, University of La Laguna, 38271 La Laguna, Tenerife, Spain;

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类机器辅助技术;
关键词

相似文献

外文文献
中文文献
专利

1. Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set [J] . Akanksha Agrawal, Sushmita Gupta, Saket Saurabh, LIPIcs : Leibniz International Proceedings in Informatics . 2017,第2期

机译：独立反馈顶点集的改进算法和组合界
2. Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms [J] . Bourgeois N., Escoffier B., Paschos V.T. Discrete Applied Mathematics . 2011,第17期

机译：用中等指数算法逼近最大独立集，最小顶点覆盖及相关问题
3. An Improved FPT Algorithm for Independent Feedback Vertex Set [J] . Shaohua Li, Martin Pilipczuk Theory of computing systems . 2020,第8期

机译：一种改进的独立反馈顶点集的FPT算法
4. Algorithm for Proving the Knowledge of an Independent Vertex Set [C] . Pino Caballero-Gil, Candelaria Hernandez-Goya International Conference on Computer Aided Systems Theory(EUROCAST 2005) . 2005

机译：用于证明独立顶点集的知识的算法
5. Exploration of Algorithms Related to Independent Sets of Steiner Triple Systems [D] . Wang, Zhaomeng. 2021

机译：与施泰克三重系统独立套装算法探索
6. Setting up a large set of protein-ligand PDB complexes for the development and validation of knowledge-based docking algorithms [O] . Luis A Diago, Persy Morell, Longendri Aguilera, 2007

机译：建立大量的蛋白质-配体PDB复合物用于开发和验证基于知识的对接算法
7. Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set [O] . Agrawal Akanksha, Gupta Sushmita, Saurabh Saket, 2017

机译：独立反馈顶点集的改进算法和组合界
8. Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems. [R] . Zhang, C. Q. 1989

机译：查找临界独立集和关键顶点子集是多项式问题。

Algorithm for Proving the Knowledge of an Independent Vertex Set

摘要

著录项

相似文献

相关主题

期刊订阅