From post

Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security.

, , и . ASIACRYPT (3), том 12493 из Lecture Notes in Computer Science, стр. 277-308. Springer, (2020)

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.

 

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

Bandwidth allocation with preemption., , , , и . STOC, стр. 616-625. ACM, (1995)Fast asynchronous Byzantine agreement with optimal resilience., и . STOC, стр. 42-51. ACM, (1993)Asynchronous secure computation., , и . STOC, стр. 52-61. ACM, (1993)Resettable zero-knowledge (extended abstract)., , , и . STOC, стр. 235-244. ACM, (2000)Efficient and Secure Source Authentication for Multicast, , , и . Network and Distributed System Security Symposium, NDSS 2001, (2001)Fiat-Shamir: from practice to theory., , , , , , и . STOC, стр. 1082-1090. ACM, (2019)Blazing Fast OT for Three-Round UC OT Extension., , и . Public Key Cryptography (2), том 12111 из Lecture Notes in Computer Science, стр. 299-327. Springer, (2020)Towards a Theory of Extractable Functions., и . TCC, том 5444 из Lecture Notes in Computer Science, стр. 595-613. Springer, (2009)Two Protocols for Delegation of Computation., , и . ICITS, том 7412 из Lecture Notes in Computer Science, стр. 37-61. Springer, (2012)The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator., , , , , , и . CRYPTO (2), том 8617 из Lecture Notes in Computer Science, стр. 71-89. Springer, (2014)