ants.dvi
crypto.stanford.edu · 7,910 words · saved by 1 readers
N/A
The Decision Die-Hellman Problem Dan Boneh dabo@cs.stanford.edu Stanford University Abstract The Decision Die-Hellman assumption (ddh) is a gold mine. It enables one to construct ecient cryptographic systems with strong security properties. In this paper we survey the recent applications of DDH as well as known results regarding its security. We describe some open problems in…
saved by
related reading
- thesis.pdfaayushg.com
- 174.pdfeprint.iacr.org
- Diffie–Hellman key exchange - Wikipediaen.wikipedia.org
- 293.pdfeprint.iacr.org
- Lecture 14: Zero knowledge proofsboazbarak.org
- Collaborative zkSNARKseprint.iacr.org
- There is no Diffie-Hellman but Elliptic Curve Diffie-Hellman – Key Materialkeymaterial.net
- Verifable Delay Functions (paper)eprint.iacr.org
- Private information retrieval using homomorphic encryption (explained from scratch)blintzbase.com
- 535.pdfeprint.iacr.org
- Book-titleeprint.iacr.org
- Unclonable Polymers and Their Cryptographic Applicationseprint.iacr.org