- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| c6 |      | Adam Groce, Jonathan Katz, Arkady Yerukhimovich: Limits of Computational Differential Privacy in the Client/Server Setting. TCC 2011: 417-431 |
| c5 | | Zvika Brakerski, Jonathan Katz, Gil Segev, Arkady Yerukhimovich: Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions. TCC 2011: 559-578 |
| c4 | | Jonathan Katz, Dominique Schröder, Arkady Yerukhimovich: Impossibility of Blind Signatures from One-Way Permutations. TCC 2011: 615-629 |
| i2 | | Seung Geol Choi, Jonathan Katz, Dominique Schröder, Arkady Yerukhimovich, Hong-Sheng Zhou: (Efficient) Universally Composable Two-Party Computation Using a Minimal Number of Stateless Tokens. IACR Cryptology ePrint Archive 2011: 689 (2011) |
| 2010 | ||
| c3 | | S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yerukhimovich: On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations. LATINCRYPT 2010: 189-204 |
| c2 | | S. Dov Gordon, Jonathan Katz, Ranjit Kumaresan, Arkady Yerukhimovich: Authenticated Broadcast with a Partially Compromised Public-Key Infrastructure. SSS 2010: 144-158 |
| 2009 | ||
| c1 | | Jonathan Katz, Arkady Yerukhimovich: On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations. ASIACRYPT 2009: 197-213 |
| i1 | | S. Dov Gordon, Jonathan Katz, Ranjit Kumaresan, Arkady Yerukhimovich: Authenticated Broadcast with a Partially Compromised Public-Key Infrastructure. IACR Cryptology ePrint Archive 2009: 410 (2009) |
| 2005 | ||
| j1 | | Lee-Ad Gottlieb, John E. Savage, Arkady Yerukhimovich: Efficient Data Storage in Large Nanoarrays. Theory Comput. Syst. 38(4): 503-536 (2005) |
Colors in the list of coauthors
Last update Thu May 23 00:32:49 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page