Back to Results
First PageMeta Content
Probabilistic complexity theory / Complexity classes / Computability theory / Oracle machine / Advantage / Randomized algorithm / Random self-reducibility / PP / Reduction / Theoretical computer science / Computational complexity theory / Applied mathematics


Separation Results on the “One-More” Computational Problems Emmanuel Bresson1 , Jean Monnerat?2 , and Damien Vergnaud3 2 1
Add to Reading List

Document Date: 2012-11-06 05:29:19


Open Document

File Size: 240,67 KB

Share Result on Facebook

City

Paris / /

Country

United States / /

Currency

pence / USD / /

Facility

University of California San Diego / /

IndustryTerm

verification algorithm / blind signature protocol / probabilistic algorithms / probabilistic polynomial-time algorithm / un-blinding algorithm / naive algorithm / black-box algorithm / signature protocols / exhaustive search / /

Organization

US Federal Reserve / DCSSI Crypto Lab / Ecole Normale Sup´erieure / PBEL2 / France Department of Computer Science & Engineering / Swiss National Science Foundation / University of California San Diego / /

Person

Jean Monnerat / /

Position

random oracle model / /

ProgrammingLanguage

R / /

ProvinceOrState

Alberta / /

Technology

cryptography / un-blinding algorithm / RSA blind signature protocol / Algebraic algorithms / verification algorithm / black-box algorithm / naive algorithm / probabilistic polynomial-time algorithm / simulation / involved algorithms / R. The algorithm / twoparty RSA-based signature protocols / /

SocialTag