First Page | Document Content | |
---|---|---|
Date: 2007-09-08 17:10:53Finite fields BLS Computational hardness assumptions Digital signature Full Domain Hash Rabin signature algorithm Diffie–Hellman key exchange Diffie–Hellman problem Elliptic Curve DSA Cryptography Public-key cryptography Cryptographic protocols | Short Signatures from the Weil Pairing∗ Dan Boneh† [removed]Add to Reading ListSource URL: cseweb.ucsd.eduDownload Document from Source WebsiteFile Size: 299,34 KBShare Document on Facebook |