( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Asynchronous Secure Communication Tolerating Mixed Adversaries.

, , и . ASIACRYPT, том 2501 из Lecture Notes in Computer Science, стр. 224-242. Springer, (2002)

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.

Sigrid Pandurevi

Milan Pandurovi

Venkatasubbaiah Panduranga

Mila Pandurovi

Wassil Pandursky

 

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

Efficient, Pairing-Free, Authenticated Identity Based Key Agreement in a Single Round., , , и . ProvSec, том 8209 из Lecture Notes in Computer Science, стр. 38-58. Springer, (2013)Communication and Round Efficient Information Checking Protocol, и . CoRR, (2010)Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation., , и . J. Cryptol., 28 (1): 49-109 (2015)An Optimal Algorithm for Reconstructing a Binary Tree., и . Inf. Process. Lett., 42 (2): 113-115 (1992)Algorithms for Weighted Graph Problems on The Modified Cellular Graph Automaton., , и . RAIRO Theor. Informatics Appl., 23 (3): 251-279 (1989)Approximation algorithms for the Traveling Salesman Problem with range condition., и . RAIRO Theor. Informatics Appl., 34 (3): 173-182 (2000)Distributed consensus in the presence of sectional faults., , , , и . PODC, стр. 202-210. ACM, (2003)Perfectly Secure Message Transmission Tolerating Mixed Adversary., , , , и . IACR Cryptology ePrint Archive, (2008)Stronger Public Key Encryption Schemes Withstanding RAM Scraper Like Attacks., , и . IACR Cryptology ePrint Archive, (2012)On Provably Secure Code-Based Signature and Signcryption Scheme., , и . IACR Cryptology ePrint Archive, (2012)