( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness.

, , и . TCC, том 7785 из Lecture Notes in Computer Science, стр. 243-262. Springer, (2013)

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.

Yehuda Avniel

 

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

On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation., , , и . CRYPTO, том 4117 из Lecture Notes in Computer Science, стр. 483-500. Springer, (2006)Attribute-based Key Exchange with General Policies., , , , и . ACM Conference on Computer and Communications Security, стр. 1451-1463. ACM, (2016)Constructions of truly practical secure protocols using standard smartcards., и . ACM Conference on Computer and Communications Security, стр. 491-500. ACM, (2008)An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants., , , и . ACM Conference on Computer and Communications Security, стр. 695-712. ACM, (2018)Fair and Efficient Secure Multiparty Computation with Reputation Systems., , и . ASIACRYPT (2), том 8270 из Lecture Notes in Computer Science, стр. 201-220. Springer, (2013)Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries., и . J. Cryptol., 23 (3): 422-456 (2010)A Proof of Security of Yao's Protocol for Two-Party Computation., и . J. Cryptol., 22 (2): 161-188 (2009)1/p-Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds., , , и . J. Cryptol., 33 (4): 1659-1731 (2020)An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries., и . IACR Cryptology ePrint Archive, (2008)Complete fairness in secure two-party computation., , , и . STOC, стр. 413-422. ACM, (2008)