( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations.

, , , и . LATINCRYPT, том 6212 из Lecture Notes in Computer Science, стр. 189-204. Springer, (2010)

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.

Dov Gafni

Dov Herskowits

Dov Gafni

Peter Dov

Anatole Zoé Dovonou

 

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

Complete Fairness in Multi-Party Computation Without an Honest Majority., и . IACR Cryptology ePrint Archive, (2008)Differentially Private Access Patterns in Secure Computation., и . IACR Cryptology ePrint Archive, (2017)Fully Secure PSI via MPC-in-the-Head., , и . IACR Cryptol. ePrint Arch., (2022)More Efficient (Reusable) Private Set Union., , , и . IACR Cryptol. ePrint Arch., (2022)Simple and Efficient Two-Server ORAM., , и . ASIACRYPT (3), том 11274 из Lecture Notes in Computer Science, стр. 141-157. Springer, (2018)Complete fairness in secure two-party computation., , , и . STOC, стр. 413-422. ACM, (2008)Complete Fairness in Multi-party Computation without an Honest Majority., и . TCC, том 5444 из Lecture Notes in Computer Science, стр. 19-35. Springer, (2009)On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations., , , и . LATINCRYPT, том 6212 из Lecture Notes in Computer Science, стр. 189-204. Springer, (2010)Multi-Input Functional Encryption., , , , и . IACR Cryptology ePrint Archive, (2013)Two-party Private Set Intersection with an Untrusted Third Party., , и . ACM Conference on Computer and Communications Security, стр. 2403-2420. ACM, (2019)