Back to Results
First PageMeta Content
Random oracle / Digital signature / Standard model / RSA / Cramer–Shoup cryptosystem / Public key certificate / Strong RSA assumption / Advantage / BLS / Cryptography / Public-key cryptography / Group signature


Dual Form Signatures: An Approach for Proving Security from Static Assumptions Michael Gerbush University of Texas at Austin [removed]
Add to Reading List

Document Date: 2012-05-08 16:56:54


Open Document

File Size: 513,45 KB

Share Result on Facebook

City

Gp2 / /

Company

Oracle / Google / Microsoft / /

/

Facility

Static Assumptions Michael Gerbush University of Texas / University of Texas / /

IndustryTerm

generation algorithm / cryptographic protocols / early signature systems / cryptographic systems / alternate signing algorithm / verification algorithms / signature algorithms / cyclic groups / bilinear / signature algorithm / signature systems / sign systems / dual form signature systems / /

Organization

University of Texas at Austin / National Science Foundation / U.S. Government / U.S. Office / Department of Defense / Boston University / /

Person

A. By / Rabin / Brent Waters / Allison Lewko / /

Position

author / hb / /

ProgrammingLanguage

C / /

ProvinceOrState

Texas / Saskatchewan / /

Technology

encryption / nondeterministic Verify algorithm / Adam / cryptography / SignB algorithm / key generation algorithm / public key / RFID encryption / known encryption / signing algorithms / verification algorithms / signing algorithm / two signature algorithms / PKI / one signing algorithm / signature algorithm / alternate signing algorithm / private key / IBE encryption / secret key / SignA algorithm / simulation / PPT algorithms / digital signature / following algorithms / dual system encryption / Verify algorithm / two signing algorithms / /

SocialTag