Author of the publication

Pushing the Limits of Valiant's Universal Circuits: Simpler, Tighter and More Compact.

, , , , and . IACR Cryptol. ePrint Arch., (2020)

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

On the Hardness of Learning Parity with Noise over Rings., , and . ProvSec, volume 11192 of Lecture Notes in Computer Science, page 94-108. Springer, (2018)Pushing the Limits of Valiant's Universal Circuits: Simpler, Tighter and More Compact., , , , and . IACR Cryptol. ePrint Arch., (2020)An improved algorithm for learning sparse parities in the presence of noise., , , , and . Theor. Comput. Sci., (2021)PrivPy: Enabling Scalable and General Privacy-Preserving Machine Learning, , , , and . (2018)cite arxiv:1801.10117.Valiant's Universal Circuits Revisited: An Overall Improvement and a Lower Bound., , , and . ASIACRYPT (1), volume 11921 of Lecture Notes in Computer Science, page 401-425. Springer, (2019)Pushing the Limits of Valiant's Universal Circuits: Simpler, Tighter and More Compact., , , , , and . CRYPTO (2), volume 12826 of Lecture Notes in Computer Science, page 365-394. Springer, (2021)