Author of the publication

Cryptographic applications of capacity theory: On the optimality of Coppersmith's method for univariate polynomials.

, , , and . IACR Cryptology ePrint Archive, (2016)

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

Non-committing Encryption from Φ-hiding., , and . TCC (1), volume 9014 of Lecture Notes in Computer Science, page 591-608. Springer, (2015)MetaDORAM: Breaking the Log-Overhead Information Theoretic Barrier., , and . Electron. Colloquium Comput. Complex., (2024)Local List Recovery of High-Rate Tensor Codes and Applications., , and . SIAM J. Comput., (2020)Local List Recovery of High-rate Tensor Codes and Applications., , and . CoRR, (2017)Reusable low-error compressive sampling schemes through privacy., , , , and . SSP, page 536-539. IEEE, (2012)Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith's Method for Univariate Polynomials., , , and . ASIACRYPT (1), volume 10031 of Lecture Notes in Computer Science, page 759-788. (2016)Linear-Time List Recovery of High-Rate Expander Codes., and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 701-712. Springer, (2015)Local List Recovery of High-Rate Tensor Codes & Applications., , and . FOCS, page 204-215. IEEE Computer Society, (2017)Sensitivity and computational complexity in financial networks., and . Algorithmic Finance, 5 (3-4): 95-110 (2016)Linear-time list recovery of high-rate expander codes., and . Inf. Comput., (2018)