eCommons

 

Concurrent Zero Knowledge: Simplifications and Generalizations

Other Titles

Abstract

Few techniques for obtaining concurrent zero-knowledge exist; all require a complex and subtle analysis. We provide an arguably simpler and more general analysis of the oblivious simulation technique of Kilian and Petrank (STOC'01) while achieving the same bounds as Prabhakaran, Rosen and Sahai (FOCS'02). Using this analysis, and relying on tools recently developed by Ong and Vadhan (Eurocrypt'07, TCC'08) we are able to establish the following \emph{unconditional} results: \begin{itemize} \item every language in NP which has a ZK proof (resp. ZK argument, statistical ZK argument) also has a black-box concurrent ZK proof (resp. ZK argument, statistical ZK argument). \item every languge which has a statistical ZK proof also has an ω(logn)-round black-box concurrent statistical ZK proof. \end{itemize}

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

2008-05-07T20:35:06Z

Publisher

Keywords

zero-knowledge; concurrency; oblivious simulation

Location

Effective Date

Expiration Date

Sector

Employer

Union

Union Local

NAICS

Number of Workers

Committee Chair

Committee Co-Chair

Committee Member

Degree Discipline

Degree Name

Degree Level

Related Version

Related DOI

Related To

Related Part

Based on Related Item

Has Other Format(s)

Part of Related Item

Related To

Related Publication(s)

Link(s) to Related Publication(s)

References

Link(s) to Reference(s)

Previously Published As

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record