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

The Complexity of Problems in P Given Correlated Instances., and . ITCS, volume 67 of LIPIcs, page 13:1-13:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Pseudo-deterministic Algorithms (Invited Talk).. STACS, volume 14 of LIPIcs, page 29-29. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Leakage-resilient coin tossing., , and . Distributed Comput., 27 (3): 147-164 (2014)Functional Signatures and Pseudorandom Functions., , and . Public Key Cryptography, volume 8383 of Lecture Notes in Computer Science, page 501-519. Springer, (2014)Planting Undetectable Backdoors in Machine Learning Models : Extended Abstract., , , and . FOCS, page 931-942. IEEE, (2022)Using Zero-Knowledge to Reconcile Law Enforcement Secrecy and Fair Trial Rights in Criminal Cases., , , and . CSLAW, page 9-22. ACM, (2022)Public Accountability vs. Secret Laws: Can They Coexist?: A Cryptographic Proposal., and . WPES@CCS, page 99-110. ACM, (2017)On the (In)security of the Fiat-Shamir Paradigm., and . Electron. Colloquium Comput. Complex., (2003)On the Limits of Nonapproximability of Lattice Problems., and . J. Comput. Syst. Sci., 60 (3): 540-563 (2000)Delegating Computation: Interactive Proofs for Muggles., , and . J. ACM, 62 (4): 27:1-27:64 (2015)