Author of the publication

Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations.

, , , and . CRYPTO (1), volume 10401 of Lecture Notes in Computer Science, page 727-757. Springer, (2017)

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

Batch Proofs are Statistically Hiding., , , , and . IACR Cryptol. ePrint Arch., (2023)Tight Verifiable Delay Functions., , , and . IACR Cryptol. ePrint Arch., (2019)XOR Codes and Sparse Learning Parity with Noise., , and . SODA, page 986-1004. SIAM, (2019)Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations., , , and . CRYPTO (1), volume 10401 of Lecture Notes in Computer Science, page 727-757. Springer, (2017)Nearly Optimal Robust Secret Sharing Against Rushing Adversaries., , and . CRYPTO (3), volume 12172 of Lecture Notes in Computer Science, page 156-185. Springer, (2020)Doubly-Efficient Batch Verification in Statistical Zero-Knowledge., , and . Electron. Colloquium Comput. Complex., (2024)Cryptography from Information Loss., , , , , , and . ITCS, volume 151 of LIPIcs, page 81:1-81:27. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Average-case fine-grained hardness., , , and . STOC, page 483-496. ACM, (2017)Leakage Resilient Secret Sharing and Applications., and . CRYPTO (2), volume 11693 of Lecture Notes in Computer Science, page 480-509. Springer, (2019)Batch Verification for Statistical Zero Knowledge Proofs., , , , and . TCC (2), volume 12551 of Lecture Notes in Computer Science, page 139-167. Springer, (2020)