Leakage-resilient zero-knowledge proofs of knowledge for NP

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Leakage-resilient zero-knowledge proofs for all NP was presented by Garg et al in 2011. How to construct leakage-resilient zero-knowledge proofs of knowledge for all NP languages is an interesting problem. This paper focuses on this problem and presents a constructions of leakage-resilient zero-knowledge proofs of knowledge for HC (Hamiltonian Cycle) problem. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Li, H., Niu, Q., & Liang, B. (2013). Leakage-resilient zero-knowledge proofs of knowledge for NP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7873 LNCS, pp. 365–380). https://doi.org/10.1007/978-3-642-38631-2_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free