( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Succinct Computational Secret Sharing.

, , , , , и . STOC, стр. 1553-1566. ACM, (2023)

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.

Benny Hartono

Benny Sebastian

Benny Dobbriner

Benny Bürger

Benny Pock

 

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

Key-Dependent Message Security: Generic Amplification and Completeness.. EUROCRYPT, том 6632 из Lecture Notes in Computer Science, стр. 527-546. Springer, (2011)The Cryptographic Hardness of Random Local Functions - Survey.. IACR Cryptology ePrint Archive, (2015)Conditional Disclosure of Secrets and d-Uniform Secret Sharing with Constant Information Rate., и . IACR Cryptology ePrint Archive, (2018)Cryptography in Constant Parallel Time.. Information Security and Cryptography Springer, (2014)Semantic Security under Related-Key Attacks and Applications., , и . ICS, стр. 45-60. Tsinghua University Press, (2011)On Pseudorandom Generators with Linear Stretch in NC0., , и . Comput. Complex., 17 (1): 38-69 (2008)On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs., и . ITC, том 199 из LIPIcs, стр. 4:1-4:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security - (Extended Abstract)., , и . TCC (2), том 13748 из Lecture Notes in Computer Science, стр. 103-120. Springer, (2022)On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information Rate., и . TCC (1), том 11239 из Lecture Notes in Computer Science, стр. 317-344. Springer, (2018)Secret Sharing, Slice Formulas, and Monotone Real Circuits., , , , и . ITCS, том 215 из LIPIcs, стр. 8:1-8:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)