Back to Results
First PageMeta Content
Interactive proof system / Non-interactive zero-knowledge proof / Proof of knowledge / IP / Soundness / Zero-knowledge proof / NP / Random oracle / Oracle machine / Cryptography / Theoretical computer science / Cryptographic protocols


On The (In)security Of Fischlin’s Paradigm P RABHANJAN A NANTH Microsoft Research India V IPUL G OYAL Microsoft Research India
Add to Reading List

Document Date: 2012-12-24 10:18:26

Open Document

File Size: 371,75 KB

Share Result on Facebook

Company

Fiat / VF / Microsoft / /

Currency

pence / /

/

Event

FDA Phase / /

IndustryTerm

knowledge protocol / setup algorithm / probabilistic polynomial time algorithm / non-interactive protocol / least algorithm / probabilistic polynomial-time algorithm / transformed non-interactive protocol / probabilistic polynomial time algorithms / online extractability / secure cryptographic systems / noninteractive protocol / knowledge protocols / zero-knowledge protocol / larger systems / /

Organization

UCLA / AO Department of Computer Science / /

Person

Kalai / /

Position

extractor / knowledge extractor / such / CPA / knowledge extractor / online extractor / /

Product

O(r) / /

ProgrammingLanguage

R / /

ProvinceOrState

Saskatchewan / /

Technology

encryption / noninteractive protocol / probabilistic polynomial time algorithms / transformed non-interactive protocol / Setup algorithm / 3-round protocol / zero-knowledge protocol / 3-round 1 protocol / probabilistic polynomial-time algorithm / knowledge protocol / simulation / underlying protocol / probabilistic polynomial time algorithm / least algorithm / knowledge protocols / non-interactive protocol / resulting protocol / /

SocialTag