Back to Results
First PageMeta Content
Cryptographic protocols / Computational complexity theory / Proof theory / Complexity classes / Combinatorics / Interactive proof system / IP / Soundness / Non-interactive zero-knowledge proof / Theoretical computer science / Cryptography / Applied mathematics


Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the art Oded Goldreich Abstract. The purpose of this article is to correct the inaccurate account of this subject that is provided
Add to Reading List

Document Date: 2010-07-22 08:07:12


Open Document

File Size: 197,78 KB

Share Result on Facebook

Company

The Basic Definition / /

IndustryTerm

non-interactive proof systems / non-interactive zero-knowledge proof systems / proof systems / probabilistic polynomial-time algorithm / probabilistic polynomial-time algorithms / noninteractive zero-knowledge proof systems / domain-sampling algorithm / obvious solution / /

Organization

U.S. Securities and Exchange Commission / Foundation of Cryptography / /

Person

Oded Goldreich Abstract / Rabin / Jonathan Katz / /

Position

author / rt / hidden-bits model / and invokes V on these values / /

Technology

Cryptography / four probabilistic polynomial-time algorithms / probabilistic polynomial-time algorithm / simulation / domain-sampling algorithm / sampling 309 algorithm / /

SocialTag