Back to Results
First PageMeta Content
Computational hardness assumptions / BLS / Schnorr signature / Forking lemma / Digital signature / XTR / ElGamal encryption / Random oracle / Diffie–Hellman problem / Cryptography / Public-key cryptography / Finite fields


A Signature Scheme as Secure as the Diffie-Hellman Problem Eu-Jin Goh and StanisÃlaw Jarecki Computer Science Department, Stanford University, Stanford CA[removed]removed], [removed]
Add to Reading List

Document Date: 2008-09-15 00:54:52


Open Document

File Size: 163,11 KB

Share Result on Facebook

Company

Fiat / Gg / /

/

Event

FDA Phase / /

Facility

Stanford University / /

IndustryTerm

reduction algorithm / generation algorithm / adversarial algorithms / probabilistic algorithm / verification algorithm / probabilistic algorithms / reduction algorithms / poly-time algorithm / identification protocol / exponent / adversarial algorithm / computing / polynomial time reduction algorithm / proof systems / signature algorithm / correct solution / /

Organization

Stanford University / Diffie-Hellman Problem Eu-Jin Goh and StanisÃlaw Jarecki Computer Science Department / /

/

Product

BR96 / CS97 / /

SportsLeague

Stanford University / /

Technology

reduction algorithms / adversarial algorithms / cryptography / polynomial time reduction algorithm / key generation algorithm / public key / F. Then algorithm / poly-time algorithm / forging algorithm / forger F. Algorithm / RSA identification protocol / verification algorithm / signature algorithm / private key / adversarial algorithm / secret key / simulation / reduction algorithm / ElGamal encryption / Sig algorithms / probabilistic algorithm / /

SocialTag