Author of the publication

Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications.

, , , and . ACNS, volume 6715 of Lecture Notes in Computer Science, page 130-146. (2011)

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

Breaking RSA Generically is Equivalent to Factoring, with Preprocessing., , , and . IACR Cryptol. ePrint Arch., (2022)New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions and Interaction., , and . IACR Cryptol. ePrint Arch., (2019)Approximate resilience, monotonicity, and the complexity of agnostic learning., , , , and . SODA, page 498-511. SIAM, (2015)Towards a Ring Analogue of the Leftover Hash Lemma., , , and . J. Math. Cryptol., 15 (1): 87-110 (2021)Extracting Randomness from Samplable Distributions, Revisited., , , and . FOCS, page 1505-1514. IEEE, (2023)Upper and Lower Bounds for Continuous Non-Malleable Codes., and . Public Key Cryptography (1), volume 11442 of Lecture Notes in Computer Science, page 519-548. Springer, (2019)How to 0wn the NAS in Your Spare Time., , , , and . ICLR, OpenReview.net, (2020)Leakage-Resilient Circuits Revisited - Optimal Number of Computing Components without Leak-free Hardware., , and . IACR Cryptology ePrint Archive, (2014)On the Leakage Resilience of Ideal-Lattice Based Public Key Encryption., , , and . IACR Cryptology ePrint Archive, (2017)Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes., , and . Inf. Comput., (2019)