Back to Results
First PageMeta Content
Cryptographic protocols / Probabilistic complexity theory / Complexity classes / Interactive proof system / Proof of knowledge / Zero-knowledge proof / IP / Soundness / Commitment scheme / Theoretical computer science / Applied mathematics / Computational complexity theory


Round-Optimal Zero-Knowledge Proofs of Knowledge for NP Li HongDa†1 , Feng DengGuo2 , Li Bao1 , Xu HaiXia1 1 State Key Lab of Information Security, Graduate University of Chinese Academy of Sciences, Beijing, C
Add to Reading List

Document Date: 2008-12-15 09:42:20

Open Document

File Size: 222,99 KB

Share Result on Facebook

City

Beijing / /

Country

China / /

Currency

pence / /

/

Facility

Graduate University of Chinese Academy / /

IndustryTerm

knowledge protocol / non-uniform algorithm / probabilistic polynomial time algorithm / basic protocol / probabilistic polynomial-time generating algorithm / probabilistic polynomialtime algorithm / cryptographic tools / probabilistic algorithm / probabilistic polynomial-time algorithm / basic protocols / knowledge protocols / auxiliary-input zeroknowledge proof systems / knowledge systems / parallel protocol / polynomialtime algorithm / constant-round protocol / /

Organization

Graduate University / State Key Lab of Information Security / Chinese Academy of Sciences / /

Position

hB / knowledge extractor / NP problem author / /

Product

Latte W10 Portable Audio Device / T10 / /

ProgrammingLanguage

L / R / /

RadioStation

Katz / /

Technology

cryptography / constant-round protocol / PPT algorithm / non-uniform algorithm / probabilistic polynomial-time generating algorithm / basic protocol / probabilistic polynomialtime algorithm / parallel protocol / polynomialtime algorithm / probabilistic polynomial-time algorithm / knowledge protocol / simulation / probabilistic polynomial time algorithm / knowledge protocols / probabilistic algorithm / resulting protocol / /

SocialTag