From post

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

, , , и . CRYPTO (1), том 10401 из Lecture Notes in Computer Science, стр. 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.

 

Другие публикации лиц с тем же именем

XOR Codes and Sparse Learning Parity with Noise., , и . SODA, стр. 986-1004. SIAM, (2019)Nearly Optimal Robust Secret Sharing Against Rushing Adversaries., , и . CRYPTO (3), том 12172 из Lecture Notes in Computer Science, стр. 156-185. Springer, (2020)Batch Proofs are Statistically Hiding., , , , и . IACR Cryptol. ePrint Arch., (2023)Tight Verifiable Delay Functions., , , и . IACR Cryptol. ePrint Arch., (2019)Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations., , , и . CRYPTO (1), том 10401 из Lecture Notes in Computer Science, стр. 727-757. Springer, (2017)Average-case fine-grained hardness., , , и . STOC, стр. 483-496. ACM, (2017)Cryptography from Information Loss., , , , , , и . ITCS, том 151 из LIPIcs, стр. 81:1-81:27. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Multi-Collision Resistant Hash Functions and Their Applications., , , и . EUROCRYPT (2), том 10821 из Lecture Notes in Computer Science, стр. 133-161. Springer, (2018)Control, Confidentiality, and the Right to be Forgotten., , , и . CCS, стр. 3358-3372. ACM, (2023)Fine-grained cryptography.. Massachusetts Institute of Technology, Cambridge, USA, (2018)ndltd.org (oai:dspace.mit.edu:1721.1/120412).