( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Constant-Round Perfect Zero-Knowledge Computationally Convincing Protocols.

, , и . Theor. Comput. Sci., 84 (1): 23-52 (1991)

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.

René Motika

Lew Motiloff

Boris Motik

Mahesh Motiramani

Lothar Motitschke

 

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

Anonymity 2.0 - X.509 Extensions Supporting Privacy-Friendly Authentication., , , и . Cryptology and Network Security, том 4856 из Lecture Notes in Computer Science, стр. 265-281. Springer, (2007)Friendly Observers Ease Off-Line E-Cash., , и . CARDIS, том 180 из IFIP Conference Proceedings, стр. 3-18. Kluwer, (2000)The TrustedFlow (TM) Protocol-Idiosyncratic Signatures for Authenticated Execution., , и . IAW, стр. 288-291. IEEE, (2003)Fast Algorithms for Edge-Coloring Planar Graphs., и . J. Algorithms, 10 (1): 35-51 (1989)Robust Verifiable non-Interactive Zero-Sharing - A Plug-in Utility for Enhanced Voters' Privacy., и . Secure Electronic Voting, том 7 из Advances in Information Security, Springer, (2003)"Metaproofs" (and their Cryptographic Applications)., и . IACR Cryptology ePrint Archive, (2012)Distributing the Power of a Government to Enhance the Privacy of Voters (Extended Abstract)., и . PODC, стр. 52-62. ACM, (1986)Coins, Weights and Contention in Balancing Networks., , и . PODC, стр. 193-205. ACM, (1994)Witness-Based Cryptographic Program Checking and Applications (an Announcement)., , и . PODC, стр. 211. ACM, (1996)Adaptive Concurrent Non-Malleability with Bare Public-Keys., , и . IACR Cryptology ePrint Archive, (2010)