Browsing Combinatorics and Optimization by Subject "digital signatures"
Now showing items 1-4 of 4
-
Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
(University of Waterloo, 2009-01-22)The Boneh-Boyen signature scheme is a short signature scheme which is provably secure in the standard model under the q-Strong Diffie-Hellman (SDH) assumption. The primary objective of this thesis is to examine the ... -
Practical Lattice Cryptosystems: NTRUEncrypt and NTRUMLS
(University of Waterloo, 2015-12-22)Public key cryptography, as deployed on the internet today, stands on shaky ground. For over twenty years now it has been known that the systems in widespread use are insecure against adversaries equipped with quantum ... -
Revisiting the security model for aggregate signature schemes
(University of Waterloo, 2014-05-26)Aggregate signature schemes combine the digital signatures of multiple users on different messages into one single signature. The Boneh-Gentry-Lynn-Shacham (BGLS) aggregate signature scheme is one such scheme, based on ... -
Signature Schemes in the Quantum Random-Oracle Model
(University of Waterloo, 2017-04-25)A signature scheme is a fundamental component in modern digital communication. It allows for authenticated messages, without which it would be nearly impossible to ensure security when using most modern technologies. ...