Back to Results
First PageMeta Content
Electronic commerce / Computational hardness assumptions / Hidden Field Equations / Pseudorandom generator / RSA / XTR / Learning with errors / Clique problem / One-way function / Cryptography / Finite fields / Public-key cryptography


Public-Key Cryptography from Different Assumptions Benny Applebaum∗ Boaz Barak† Avi Wigderson‡
Add to Reading List

Document Date: 2011-10-10 23:51:30

Open Document

File Size: 497,73 KB

Share Result on Facebook

Company

3SAT / /

Country

United States / /

/

Facility

Princeton University / /

Holiday

Assumption / /

IndustryTerm

sub-exponential time algorithms / natural algorithms / approximate search / cryptographic applications / concrete algorithms / non deterministic algorithm / approximate solution / search problem / strongest algorithmic tool / /

Organization

National Science Foundation / Department of Computer Science / Institute for Advanced Study / Princeton University / /

Person

Ron Rivest / Avi Wigderson‡ April / Benny Applebaum∗ Boaz Barak / /

Position

second author / /

ProvinceOrState

New Jersey / /

Technology

encryption / Cryptography / non deterministic algorithm / public key / public-key encryption / semantically secure public key encryption / sub-exponential time algorithms / private key / 49 49 49 51 52 54 55 1 Introduction Public key encryption / three public-key encryption / public key encryption / /

SocialTag