From post

Impossibility and Feasibility Results for Zero Knowledge with Public Keys.

, , и . CRYPTO, том 3621 из Lecture Notes in Computer Science, стр. 135-151. Springer, (2005)

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.

 

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

Minimal Path Length of Trees with Known Fringe., , и . Theor. Comput. Sci., 143 (1): 175-188 (1995)Answering queries using pairings., , и . CoRR, (2014)Improved OR Composition of Sigma-Protocols., , , , и . IACR Cryptology ePrint Archive, (2015)Untraceable Tags Based on Mild Assumptions., , и . DPM/SETOP, том 5939 из Lecture Notes in Computer Science, стр. 178-192. Springer, (2009)A Distributed Implementation of the Certified Information Access Service., , , , и . ESORICS, том 5283 из Lecture Notes in Computer Science, стр. 396-410. Springer, (2008)Stability and Metastability of the Logit Dynamics of Strategic Games.. FUN, том 7288 из Lecture Notes in Computer Science, стр. 2. Springer, (2012)Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines., , , и . STACS, том 2996 из Lecture Notes in Computer Science, стр. 608-619. Springer, (2004)On the Number of Random Bits in Totally Private Computation., , , и . ICALP, том 944 из Lecture Notes in Computer Science, стр. 171-182. Springer, (1995)The Complexity of Secure RAMs.. CIAC, том 13898 из Lecture Notes in Computer Science, стр. 17-20. Springer, (2023)Distributed Certified Information Access for Mobile Devices., , и . WISTP, том 4462 из Lecture Notes in Computer Science, стр. 67-79. Springer, (2007)