Diapositive PPT

The Strong Discrete Logarithm Assumption:

It is hard to compute discrete logs modulo primes of size k in time 2k for some _ >0.

Theorem:

Under the strong DL assumption,

there exist 4-round rZK arguments

for NP in the public-key model.

_

Diapositive prÈcÈdente

Diapositive suivante

Revenir ý la premiËre diapositive

Afficher la version graphique