Author of the publication

The Bit Security of Modular Squaring Given Partial Factorization of the Modulos.

, , and . CRYPTO, volume 218 of Lecture Notes in Computer Science, page 448-457. Springer, (1985)

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.

 

Other publications of authors with the same name

Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs., , , and . CRYPTO, volume 963 of Lecture Notes in Computer Science, page 325-338. Springer, (1995)The Minimum-Length Generator Sequence Problem is NP-Hard., and . J. Algorithms, 2 (3): 311-313 (1981)Pseudorandomness.. ICALP, volume 1853 of Lecture Notes in Computer Science, page 687-704. Springer, (2000)Improved Derandomization of BPP Using a Hitting Set Generator., and . RANDOM-APPROX, volume 1671 of Lecture Notes in Computer Science, page 131-137. Springer, (1999)On the Limits of Non-Approximability of Lattice Problems., and . STOC, page 1-9. ACM, (1998)Property Testing in Bounded Degree Graphs., and . STOC, page 406-415. ACM, (1997)Adaptively Secure Multi-Party Computation., , , and . STOC, page 639-648. ACM, (1996)On our duties as scientists.. SIGACT News, 40 (3): 53-59 (2009)A taxonomy of proof systems (part 2).. SIGACT News, 25 (1): 22-30 (1994)Three theorems regarding testing graph properties, and . Random Struct. Algorithms, 23 (1): 23-57 (2003)