( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Batchman and Robin: Batched and Non-batched Branching for Interactive ZK.

, , , , и . CCS, стр. 1452-1466. ACM, (2023)

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.

Vladimir Milutinovi

Vladimir Spokoiny

Vladimir Borisov

Vladimir Bondarev

Vladimir Dyakonov

 

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

TSAF: Tamper-resistant and scalable mutual authentication framework for plug-in EV charging., , и . SmartGridComm, стр. 444-449. IEEE, (2013)FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR., , и . CRYPTO (2), том 8617 из Lecture Notes in Computer Science, стр. 440-457. Springer, (2014)A Security Enhancement and Proof for Authentication and Key Agreement (AKA).. SCN, том 6280 из Lecture Notes in Computer Science, стр. 235-252. Springer, (2010)Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation.. ASIACRYPT, том 3788 из Lecture Notes in Computer Science, стр. 136-155. Springer, (2005)Strong Conditional Oblivious Transfer and Computing on Intervals., и . ASIACRYPT, том 3329 из Lecture Notes in Computer Science, стр. 515-529. Springer, (2004)Covert Security with Public Verifiability: Faster, Leaner, and Simpler., , , , и . IACR Cryptology ePrint Archive, (2018)Richer Efficiency/Security Trade-offs in 2PC., , , и . TCC (1), том 9014 из Lecture Notes in Computer Science, стр. 229-259. Springer, (2015)Brief announcement: swarming secrets., , , и . PODC, стр. 231-232. ACM, (2010)Public Verifiability in the Covert Model (Almost) for Free., и . ASIACRYPT (2), том 9453 из Lecture Notes in Computer Science, стр. 210-235. Springer, (2015)Tri-State Circuits - A Circuit Model that Captures RAM., , и . CRYPTO (4), том 14084 из Lecture Notes in Computer Science, стр. 128-160. Springer, (2023)