( en | de | ru )

 

Disambiguation of "Håstad, Johan"

Author of the publication

copydeleteadd this publication to your clipboard
Everything Provable is Provable in Zero-Knowledge.

, , , , , , and . CRYPTO, volume 403 of Lecture Notes in Computer Science, page 37-56. Springer, (1988)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Johan Waern

Johan Verink

Johan Setianto

Johan Schloemann

Johan Corthals

 

Other publications of authors with the same name

Bounded Independence versus Symmetric Tests., , , and . TOCT, 11 (4): 21:1-21:27 (2019)Following a tangent of proofs.. Providing Sound Foundations for Cryptography, ACM, (2019)On the Approximation Resistance of a Random Predicate.. Comput. Complex., 18 (3): 413-434 (2009)Explicit two-deletion codes with redundancy matching the existential bound., and . CoRR, (2020)Top-Down Lower Bounds for Depth-Three Circuits., , and . Comput. Complex., 5 (2): 99-112 (1995)The security of all RSA and discrete log bits., and . J. ACM, 51 (2): 187-230 (2004)Solving Simultaneous Modular Equations of Low Degree.. SIAM J. Comput., 17 (2): 336-341 (1988)Quantum Algorithms for Computing Short Discrete Logarithms and Factoring RSA Integers., and . PQCrypto, volume 10346 of Lecture Notes in Computer Science, page 347-363. Springer, (2017)Some Recent Strong Inapproximability Results.. SWAT, volume 1432 of Lecture Notes in Computer Science, page 205-209. Springer, (1998)The square lattice shuffle, correction.. Random Struct. Algorithms, 48 (1): 213 (2016)