View in EDS PDF Full Text

How to Achieve Perfect Simulation and a Complete Problem for Non-interactive Perfect Zero-Knowledge.

Saved in:
Bibliographic Details
Title: How to Achieve Perfect Simulation and a Complete Problem for Non-interactive Perfect Zero-Knowledge.
Authors: Malka, Lior1 lior34@gmail.com
Source: Journal of Cryptology. Summer2015, Vol. 28 Issue 3, p533-550. 18p.
Subjects: Computer simulation, Zero-knowledge proofs, Application software, Error analysis in mathematics, Cryptography
Abstract: This paper studies perfect zero-knowledge proofs. Such proofs do not allow any simulation errors, and therefore techniques from the study of statistical zero-knowledge (where a small error is allowed) do not apply to them. We introduce a new error shifting technique for building perfect simulators. Using this technique we give the first complete problem for the class of problems admitting non-interactive perfect zero-knowledge ( NIPZK) proofs, a hard problem for the class of problems admitting public-coin PZK proofs, and other applications. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Cryptology is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 103168992
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: How to Achieve Perfect Simulation and a Complete Problem for Non-interactive Perfect Zero-Knowledge.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Malka%2C+Lior%22">Malka, Lior</searchLink><relatesTo>1</relatesTo><i> lior34@gmail.com</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Cryptology%22">Journal of Cryptology</searchLink>. Summer2015, Vol. 28 Issue 3, p533-550. 18p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Computer+simulation%22">Computer simulation</searchLink><br /><searchLink fieldCode="DE" term="%22Zero-knowledge+proofs%22">Zero-knowledge proofs</searchLink><br /><searchLink fieldCode="DE" term="%22Application+software%22">Application software</searchLink><br /><searchLink fieldCode="DE" term="%22Error+analysis+in+mathematics%22">Error analysis in mathematics</searchLink><br /><searchLink fieldCode="DE" term="%22Cryptography%22">Cryptography</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This paper studies perfect zero-knowledge proofs. Such proofs do not allow any simulation errors, and therefore techniques from the study of statistical zero-knowledge (where a small error is allowed) do not apply to them. We introduce a new error shifting technique for building perfect simulators. Using this technique we give the first complete problem for the class of problems admitting non-interactive perfect zero-knowledge ( NIPZK) proofs, a hard problem for the class of problems admitting public-coin PZK proofs, and other applications. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Cryptology is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=103168992
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s00145-013-9165-6
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 18
        StartPage: 533
    Subjects:
      – SubjectFull: Computer simulation
        Type: general
      – SubjectFull: Zero-knowledge proofs
        Type: general
      – SubjectFull: Application software
        Type: general
      – SubjectFull: Error analysis in mathematics
        Type: general
      – SubjectFull: Cryptography
        Type: general
    Titles:
      – TitleFull: How to Achieve Perfect Simulation and a Complete Problem for Non-interactive Perfect Zero-Knowledge.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Malka, Lior
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 07
              Text: Summer2015
              Type: published
              Y: 2015
          Identifiers:
            – Type: issn-print
              Value: 09332790
          Numbering:
            – Type: volume
              Value: 28
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Journal of Cryptology
              Type: main
ResultId 1