Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
M-ORAM: A Matrix ORAM with Log N Bandwidth Cost Read chapter Read first chapter

2016 | OriginalPaper | Chapter

On Zero Knowledge Argument with PQT Soundness

Authors : Guifang Huang, Hongda Li

Published in: Information Security Applications

Publisher: Springer International Publishing

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Loosely speaking, an interactive argument is said to be zero knowledge if the view of every “efficient” verifier can be “efficiently” simulated. Recently, Pass relaxed the “efficient” adversaries and the simulator to be probabilistic quasi-polynomial time (\(\mathcal {PQT}\))) machines and proposed such a relaxed zero knowledge argument with computational soundness. In this paper, we present a relaxed zero knowledge protocol which achieves \(\mathcal {PQT}\) soundness, instead of computational soundness. Also, it can be regarded as a stand-alone version of PMV scheme, with the difference that it is 5-round while PMV scheme is 6-round in the stand-alone setting. In addition, the simulation way determines that it is secure against \(\mathcal {PPT}\) resettable-soundness attackers.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter Structured Design Approach for an Optimal Programmable Synchronous Security Processor
next chapter Performance Analysis of Multiple Classifier System in DoS Attack Detection
Literature
1.
Barak, B., Goldreich, O., Goldwasser, S., Lindell, Y.: Resettably sound zero knowledge and its applications. In: Proceedings FOCS 2001, pp. 116–125 (2001)
2.
Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-box concurrent zero- knowledge requires (almost) logarithm many rounds. SIAM J. Comput. 32(1), 1–47 (2002)MathSciNetCrossRefMATH
3.
Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable zero knowledge. In: Proceedings STOC 2000, pp. 235–244 (2000)
4.
5.
Deng, Y., Goyal, V., Sahai, A.: Resolving the simultaneous resettability conjecture and a new non-black-box simulation strategy. In: Proceedings FOCS 2009, pp. 251–260 (2009)
6.
Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. In: Proceedins STOC 1998, pp. 409–418 (1998)
7.
8.
Feige, U., Lapidot, D., Shamir, A.: Multiple non-interactive zero knowledge proofs under general assumptions. SIAM J. Comput. 29(1), 1–28 (1999)MathSciNetCrossRefMATH
9.
Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987)CrossRef
10.
Feige, U., Shamir, A.: Witness indinstinguishable and witness hiding protocols. In: Proceedins STOC 1990, pp. 416–426 (1990)
11.
12.
Goldreich, O.: Foundation of Cryptography-Basic Tools. Cambridge University Press, New York (2001)CrossRefMATH
13.
Goldwasser, O., Micali, A., Rackoff, C.: The knowledge complexity of interactive proof system. SIAM J. Comput. 18(1), 186–208 (1989)MathSciNetCrossRefMATH
14.
Goldreich, O., Micali, S., Widerson, A.: Proofs that yields nothing but their validity or all languages in \(\cal {NP}\) have zero knowledge proof systems. J. ACM 38(3), 691–729 (1991)CrossRefMATH
15.
Micali, S., Reyzin, L.: Soundness in the public-key model. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 542–565. springer, Heidelberg (2001)CrossRef
16.
Lindell, Y.: General composition and universal composability in secure multi- party computation. In: proceedins FOCS 2003, pp. 394–403 (2003)
17.
Lindell, Y.: Lower bounds for concurrent self composition. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 203–222. Springer, Heidelberg (2004)CrossRef
18.
Pass, R.: Simulation in quasi-polynomial time, and its application to protocol composition. In: Biham, E. (ed.) Advances in Cryptology – EUROCRYPT 2003. LNCS, vol. 2656, pp. 160–176. Springer, Heidelberg (2003)CrossRef
19.
Pass, R., Venkitasubramaniam, M.: On constant-round concurrent zero-knowledge. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 553–570. Springer, Heidelberg (2008)CrossRef
Metadata
Title
On Zero Knowledge Argument with PQT Soundness
Authors
Guifang Huang
Hongda Li
Copyright Year
2016
Publisher
Springer International Publishing
Book
Information Security Applications

Print ISBN: 978-3-319-31874-5

Electronic ISBN: 978-3-319-31875-2

Copyright Year: 2016

DOI
https://doi.org/10.1007/978-3-319-31875-2_27

Premium Partner

    Image Credits