NDLI: Restricted-Verifier Precise Bounded-Concurrent Zero-Knowledge

Content Provider	IEEE Xplore Digital Library
Author	Ning Ding Dawu Gu
Copyright Year	2007
Description	Author affiliation: Shanghai Jiao Tong Univ., Shanghai (Ning Ding; Dawu Gu)
Abstract	We present a stronger notion of precise bounded-concurrent zero-knowledge. Our notion captures the idea that view of any verifier in a bounded-concurrent interaction can be reconstructed in the almost same time. Precise zero-knowledge in stand-alone setting was introduced by Micali and Pass in STOC'06 and they constructed some precise stand-alone zero-knowledge protocols for NP using at least omega(1) rounds. Via providing a precise simulator for the known O(1)-round bounded-concurrent non-black-box zero-knowledge argument, we show the existence of O(1)- round bounded-concurrent zero-knowledge arguments with polynomial precision for NP. Our result assumes that the ratio of running-time of any adversarial verifier on any two different views in bounded-concurrent execution of the protocol is bounded by $n^{a},$ where a is any predeterminate constant. Such verifiers are called restricted verifiers.
Starting Page	819
Ending Page	822
File Size	534401
Page Count	4
File Format	PDF
ISBN	9780769530734
DOI	10.1109/CISW.2007.4425621
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-12-15
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computer science Educational programs Analytical models Protocols Computational modeling Polynomials Time measurement Computer security Computational intelligence
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Constant-Round Restricted-Verifier Zero-Knowledge with Polynomial Precision

Concurrent Non-Malleable Zero Knowledge

Concurrent zero knowledge with logarithmic round-complexity

Simulatable security and polynomially bounded concurrent composability

Constant-Round Concurrent Zero Knowledge from P-Certificates

An unconditional study of computational zero knowledge

Precise Zero-Knowledge in Concurrent Setting ∗

Precise Concurrent Zero Knowledge

Bounded-concurrent secure two-party computation in a constant number of rounds

Restricted-Verifier Precise Bounded-Concurrent Zero-Knowledge

Similar Documents

Constant-Round Restricted-Verifier Zero-Knowledge with Polynomial Precision

Concurrent Non-Malleable Zero Knowledge

Concurrent zero knowledge with logarithmic round-complexity

Simulatable security and polynomially bounded concurrent composability

Constant-Round Concurrent Zero Knowledge from P-Certificates

An unconditional study of computational zero knowledge

Precise Zero-Knowledge in Concurrent Setting ∗

Precise Concurrent Zero Knowledge

Bounded-concurrent secure two-party computation in a constant number of rounds

Restricted-Verifier Precise Bounded-Concurrent Zero-Knowledge