Back to Results
First PageMeta Content
Probabilistic complexity theory / Cryptographic protocols / Computational complexity theory / Randomness / Complexity classes / Salil Vadhan / Zero-knowledge proof / Probabilistically checkable proof / Pseudorandomness / Theoretical computer science / Applied mathematics / Cryptography


Research Statement Salil Vadhan September 2006
Add to Reading List

Document Date: 2009-08-20 14:10:08

Open Document

File Size: 155,59 KB

Share Result on Facebook

Company

Vad2 NV / /

Country

Sudan / /

Event

Reorganization / /

Facility

Clay Math Institute / /

IndustryTerm

random selection protocols / deterministic solutions / secure protocols / on-line purchases / zig-zag product / cryptographic protocols / logarithmic-space algorithm / computing / computer technology / cryptographic applications / approximate solutions / zig-zag graph product / /

Organization

Clay Math Institute / Harvard / /

Person

Lev / /

Position

researcher / General Research Areas Computational Complexity / Coo / /

Technology

encryption / cryptography / randomized algorithm / specified protocol / random selection protocols / logarithmic-space algorithm / computer technology / concurrently executing protocols / Design protocols / /

SocialTag