| 2010 | ||
|---|---|---|
| c12 | Hui Yang, Anton Mityagin, Krysta Marie Svore, Sergey Markov: Collecting high quality overlapping labels at low cost. SIGIR 2010: 459-466 | |
| 2009 | ||
| c11 | Edith Law, Anton Mityagin, David Maxwell Chickering: Intentions: a game for classifying search query intent. CHI Extended Abstracts 2009: 3805-3810 | |
| c10 | Paul N. Bennett, David Maxwell Chickering, Anton Mityagin: Picture this: preferences for image search. KDD Workshop on Human Computation 2009: 25-26 | |
| c9 | Paul N. Bennett, David Maxwell Chickering, Anton Mityagin: Learning consensus opinion: mining data from a labeling game. WWW 2009: 121-130 | |
| e1 | Paul N. Bennett, Raman Chandrasekar, Max Chickering, Panagiotis G. Ipeirotis, Edith Law, Anton Mityagin, Foster J. Provost, Luis von Ahn (Eds.): Proceedings of the ACM SIGKDD Workshop on Human Computation, Paris, France, June 28, 2009. ACM 2009, isbn 978-1-60558-672-4 | |
| 2007 | ||
| j2 | Barath Raghavan, Saurabh Panjwani, Anton Mityagin: Analysis of the SPV secure routing protocol: weaknesses and lessons. Computer Communication Review 37(2): 29-38 (2007) | |
| c8 | Brian A. LaMacchia, Kristin Lauter, Anton Mityagin: Stronger Security of Authenticated Key Exchange. ProvSec 2007: 1-16 | |
| c7 | Kumar Chellapilla, Anton Mityagin, Denis Xavier Charles: GigaHash: scalable minimal perfect hashing for billions of urls. WWW 2007: 1165-1166 | |
| 2006 | ||
| c6 | Ilya Mironov, Anton Mityagin, Kobbi Nissim: Hard Instances of the Constrained Discrete Logarithm Problem. ANTS 2006: 582-598 | |
| c5 | Kristin Lauter, Anton Mityagin: Security Analysis of KEA Authenticated Key Exchange Protocol. Public Key Cryptography 2006: 378-394 | |
| i7 | Ilya Mironov, Anton Mityagin, Kobbi Nissim: Hard Instances of the Constrained Discrete Logarithm Problem. CoRR abs/math/0606771 (2006) | |
| i6 | Brian A. LaMacchia, Kristin Lauter, Anton Mityagin: Stronger Security of Authenticated Key Exchange. IACR Cryptology ePrint Archive 2006: 73 (2006) | |
| i5 | Barath Raghavan, Saurabh Panjwani, Anton Mityagin: Analysis of the SPV Secure Routing Protocol: Weaknesses and Lessons. IACR Cryptology ePrint Archive 2006: 87 (2006) | |
| i4 | Ilya Mironov, Anton Mityagin, Kobbi Nissim: Hard Instances of the Constrained Discrete Logarithm Problem. IACR Cryptology ePrint Archive 2006: 253 (2006) | |
| 2005 | ||
| c4 | Eike Kiltz, Anton Mityagin, Saurabh Panjwani, Barath Raghavan: Append-Only Signatures. ICALP 2005: 434-445 | |
| c3 | Jan Camenisch, Anton Mityagin: Mix-Network with Stronger Security. Privacy Enhancing Technologies 2005: 128-146 | |
| i3 | Eike Kiltz, Anton Mityagin, Saurabh Panjwani, Barath Raghavan: Append-Only Signatures. IACR Cryptology ePrint Archive 2005: 124 (2005) | |
| i2 | Kristin Lauter, Anton Mityagin: Security Analysis of KEA Authenticated Key Exchange Protocol. IACR Cryptology ePrint Archive 2005: 265 (2005) | |
| 2004 | ||
| j1 | Anton Mityagin: On the complexity of finding a local maximum of functions on discrete planar subsets. Theor. Comput. Sci. 310(1-3): 355-363 (2004) | |
| i1 | Mihir Bellare, Oded Goldreich, Anton Mityagin: The Power of Verification Queries in Message Authentication and Authenticated Encryption. IACR Cryptology ePrint Archive 2004: 309 (2004) | |
| 2003 | ||
| c2 | Anton Mityagin: On the Complexity of Finding a Local Maximum of Functions on Discrete Planar Subsets. STACS 2003: 203-211 | |
| 2002 | ||
| c1 | Alexander Klimov, Anton Mityagin, Adi Shamir: Analysis of Neural Cryptography. ASIACRYPT 2002: 288-298 | |
Colors in the list of coauthors
Last update Fri May 24 22:27:18 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page