Back to Results
First PageMeta Content
Cryptographic hash functions / Computability theory / Random oracle / Oracle machine / Oracle Corporation / Proof of knowledge / L / Standard model / Oracle Database / Cryptography / Theoretical computer science / Cryptographic protocols


Non Observability in the Random Oracle Model Prabhanjan Ananth and Raghav Bhaskar Microsoft Research India BangaloreAbstract
Add to Reading List

Document Date: 2012-12-18 23:51:34

Open Document

File Size: 304,70 KB

Share Result on Facebook

City

Bangalore / /

Company

Fiat / VF / Microsoft / /

IndustryTerm

online extractability / probabilistic polynomial time algorithm / online extractors / non observing online extractors / Online Extractors In / online extractors2 / extractor algorithms / /

Position

PPT extractor / non observing online extractor / extractor / online extractor / non observing extractor / /

ProgrammingLanguage

R / /

Technology

encryption / extractor algorithms / simulation / digital signature / probabilistic polynomial time algorithm / B. The algorithm / Public key encryption / /

SocialTag