Author of the publication

Impossibility of Blind Signatures from One-Way Permutations.

, , and . TCC, volume 6597 of Lecture Notes in Computer Science, page 615-629. Springer, (2011)

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. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Yerukhimovich, Arkady
add a person with the name Yerukhimovich, Arkady
 

Other publications of authors with the same name

Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions., , , and . TCC, volume 6597 of Lecture Notes in Computer Science, page 559-578. Springer, (2011)(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens., , , , and . IACR Cryptology ePrint Archive, (2013)Authenticated Broadcast with a Partially Compromised Public-Key Infrastructure., , , and . IACR Cryptology ePrint Archive, (2009)CompGC: Efficient Offline/Online Semi-honest Two-party Computation., , , and . IACR Cryptology ePrint Archive, (2016)SoK: Privacy on Mobile Devices - It's Complicated., , , , , , and . PoPETs, 2016 (3): 96-116 (2016)Location Leakage from Network Access Patterns., , , , and . CNS, page 214-222. IEEE, (2019)Stormy: Statistics in Tor by Measuring Securely., , , , and . CCS, page 615-632. ACM, (2019)(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens., , , , and . J. Cryptology, 32 (2): 459-497 (2019)Authenticated broadcast with a partially compromised public-key infrastructure., , , and . Inf. Comput., (2014)Limits of Computational Differential Privacy in the Client/Server Setting., , and . TCC, volume 6597 of Lecture Notes in Computer Science, page 417-431. Springer, (2011)