Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Aniket Kate
2010 – today
- 2013
[j3]Maxwell Young, Aniket Kate, Ian Goldberg, Martin Karsten: Towards Practical Communication in Byzantine-Resistant DHTs. IEEE/ACM Trans. Netw. 21(1): 190-203 (2013)- [c15]Michael Backes, Amit Datta, Aniket Kate: Asynchronous Computational VSS with Reduced Communication Complexity. CT-RSA 2013: 259-276
- 2012
- [c14]Michael Backes, Ian Goldberg, Aniket Kate, Tomas Toft: Adding query privacy to robust DHTs. ASIACCS 2012: 30-31
- [c13]Michael Backes, Ian Goldberg, Aniket Kate, Esfandiar Mohammadi: Provably Secure and Practical Onion Routing. CSF 2012: 369-385
- [c12]Michael Backes, Fabian Bendun, Aniket Kate: Brief announcement: distributed cryptography using trinc. PODC 2012: 91-92
- [c11]Allen Clement, Flavio Junqueira, Aniket Kate, Rodrigo Rodrigues: On the (limited) power of non-equivocation. PODC 2012: 301-308
- [c10]Michael Backes, Aniket Kate, Matteo Maffei, Kim Pecina: ObliviAd: Provably Secure and Practical Online Behavioral Advertising. IEEE Symposium on Security and Privacy 2012: 257-271
- [c9]Michael Backes, Aniket Kate, Esfandiar Mohammadi: Ace: an efficient key-exchange protocol for onion routing. WPES 2012: 55-64
- [i8]Aniket Kate, Yizhou Huang, Ian Goldberg: Distributed Key Generation in the Wild. IACR Cryptology ePrint Archive 2012: 377 (2012)
- [i7]Michael Backes, Amit Datta, Aniket Kate: Asynchronous Computational VSS with Reduced Communication Complexity. IACR Cryptology ePrint Archive 2012: 619 (2012)
- 2011
- [j2]Aniket Kate, Ian Goldberg: Generalizing cryptosystems based on the subset sum problem. Int. J. Inf. Sec. 10(3): 189-199 (2011)
- [c8]Michael Backes, Aniket Kate, Arpita Patra: Computational Verifiable Secret Sharing Revisited. ASIACRYPT 2011: 590-609
- [i6]Michael Backes, Ian Goldberg, Aniket Kate, Tomas Toft: Adding Query Privacy to Robust DHTs. CoRR abs/1107.1072 (2011)
- [i5]Michael Backes, Aniket Kate, Arpita Patra: Computational Verifiable Secret Sharing Revisited. IACR Cryptology ePrint Archive 2011: 281 (2011)
- [i4]Michael Backes, Ian Goldberg, Aniket Kate, Esfandiar Mohammadi: Provably Secure and Practical Onion Routing. IACR Cryptology ePrint Archive 2011: 308 (2011)
- 2010
- [j1]Aniket Kate, Gregory M. Zaverucha, Ian Goldberg: Pairing-Based Onion Routing with Improved Forward Secrecy. ACM Trans. Inf. Syst. Secur. 13(4): 29 (2010)
- [c7]Aniket Kate, Gregory M. Zaverucha, Ian Goldberg: Constant-Size Commitments to Polynomials and Their Applications. ASIACRYPT 2010: 177-194
- [c6]Aniket Kate, Ian Goldberg: Using Sphinx to Improve Onion Routing Circuit Construction. Financial Cryptography 2010: 359-366
- [c5]Maxwell Young, Aniket Kate, Ian Goldberg, Martin Karsten: Practical Robust Communication in DHTs Tolerating a Byzantine Adversary. ICDCS 2010: 263-272
- [c4]Aniket Kate, Ian Goldberg: Distributed Private-Key Generators for Identity-Based Cryptography. SCN 2010: 436-453
2000 – 2009
- 2009
- [c3]
- [i3]Aniket Kate, Ian Goldberg: Asynchronous Distributed Private-Key Generators for Identity-Based Cryptography. IACR Cryptology ePrint Archive 2009: 355 (2009)
- [i2]Aniket Kate, Ian Goldberg: Using Sphinx to Improve Onion Routing Circuit Construction. IACR Cryptology ePrint Archive 2009: 628 (2009)
- 2008
- [i1]Aniket Kate, Gregory M. Zaverucha, Ian Goldberg: Pairing-Based Onion Routing with Improved Forward Secrecy. IACR Cryptology ePrint Archive 2008: 80 (2008)
- 2007
- [c2]Aniket Kate, Gregory M. Zaverucha, Ian Goldberg: Pairing-Based Onion Routing. Privacy Enhancing Technologies 2007: 95-112
- [c1]Aniket Kate, Gregory M. Zaverucha, Urs Hengartner: Anonymity and security in delay tolerant networks. SecureComm 2007: 504-513
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-20 21:57 CET by the dblp team