Skip to main content
SpringerLink
Log in

Leakage-Resilient Zero-Knowledge Proofs of Knowledge for NP

  • Conference paper
Book cover Network and System Security (NSS 2013)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 7873))

Included in the following conference series:

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.

This work was partially supported the National Natural Science Foundation of China (Grant No. 60970139), Strategic Priority Program of Chinese Academy of Sciences (Grant No. XDA06010702), and IIEs Cryptography Research Project.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bitansky, N., Canetti, R., Halevi, S.: Leakage tolerant interactive protocols. Cryptology ePrint Archive, Report 2011/204 (2011)

    Google Scholar 

  2. Bellare, M., Goldreich, O.: On defining proofs of knowledge. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 390–420. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  3. Bellare, M., Goldreich, O.: On probabilistic versus deterministic provers in the definition of proofs of knowledge. Electronic Colloquium on Computational Complexity Report TR06-136

    Google Scholar 

  4. Boyle, E., Goldwasser, S., Jain, A., Kalai, Y.T.: Multiparty computation secure against continual memory leakage. In: Proceedings of the 44th Symposium on Theory of Computing, STOC 2012, pp. 1235–1254 (2012)

    Google Scholar 

  5. Boyle, E., Goldwasser, S., Kalai, Y.T.: Leakage-resilient coin tossing. In: Peleg, D. (ed.) DISC 2011. LNCS, vol. 6950, pp. 181–196. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  6. Damgard, I., Hazay, C., Patra, A.: Leakage resilient two-party computation. Cryptology ePrint Archive, Report 2011/256 (2011)

    Google Scholar 

  7. Garg, S., Jain, A., Sahai, A.: Leakage-resilient zero knowledge. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 297–315. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  8. Goldreich, O., Kahan, A.: How to construct constant-round zero-knowledge proof system for NP. Journal of Cryptology 9(3), 167–189 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  9. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing 18(16), 186–208 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  10. Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. J. of the ACM 38(3), 691–729 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  11. Goldreich, O.: Foundations of Cryptography - Basic Tools. Cambridge University Press (2001)

    Google Scholar 

  12. Halevi, S., Micali, S.: More on proofs of knowledge, http://eprint.iacr.org/1998/015

  13. Li, H., Feng, D., Li, B., Xu, H.: Round-optimal zero-knowledge proofs of knowledge for NP. Science China: Information Science 55(11), 2417–2662 (2012)

    Article  Google Scholar 

  14. Toshiya, I., Kouichi, S.: On the Complexity of Constant Round ZKIP of Possession of Knowledge. IEICE Trans. Fundamentals E76-A(1), 31–39 (1993)

    Google Scholar 

  15. Lindell, Y.: Constant-Round Zero-Knowledge Proofs of Knowledge, http://eprint.iacr.org/2010/656

  16. Naor, M.: Bit commitment using pseudo-randomness (Extended abstract). In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 128–136. Springer, Heidelberg (1990)

    Google Scholar 

  17. Pandey, O.: Achieving constant round leakage-resilient zero knowledge, eprint.iacr.org/2012/362.pdf

  18. Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round-complexity. In: FOCS (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Lab of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, 100093, China

    Hongda Li, Qihua Niu & Bei Liang

Authors
  1. Hongda Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qihua Niu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bei Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, ETSI Informatica, University of Malaga, Campus de Teatinos, 29071, Malaga, Spain

    Javier Lopez

  2. School of Mathematics and Computer Science, Fujian Normal University, No. 32 Shangsan Road, 350007, Fuzhou, China

    Xinyi Huang

  3. Institute for Cyber Security,, University of Texas at San Antonio, One UTSA Circle, 78249, San Antonio, TX, USA

    Ravi Sandhu

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, H., Niu, Q., Liang, B. (2013). Leakage-Resilient Zero-Knowledge Proofs of Knowledge for NP. In: Lopez, J., Huang, X., Sandhu, R. (eds) Network and System Security. NSS 2013. Lecture Notes in Computer Science, vol 7873. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38631-2_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38631-2_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38630-5

  • Online ISBN: 978-3-642-38631-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation