- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c12 |      | Nishanth Chandran, Juan A. Garay, Rafail Ostrovsky: Edge Fault Tolerance on Sparse Networks. ICALP (2) 2012: 452-463 |
| c11 | | Nishanth Chandran, Melissa Chase, Vinod Vaikuntanathan: Functional Re-encryption and Collusion-Resistant Obfuscation. TCC 2012: 404-421 |
| i11 | | Nishanth Chandran, Juan A. Garay, Rafail Ostrovsky: Almost-Everywhere Secure Computation with Edge Corruptions. IACR Cryptology ePrint Archive 2012: 221 (2012) |
| i10 | | Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostrovsky, Leonid Reyzin: Privacy Amplification with Asymptotically Optimal Entropy Loss. IACR Cryptology ePrint Archive 2012: 501 (2012) |
| i9 | | Nishanth Chandran, Sanjam Garg: Hardness Preserving Constructions of Pseudorandom Functions, Revisited. IACR Cryptology ePrint Archive 2012: 616 (2012) |
| 2011 | ||
| c10 | | Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner: Position-Based Quantum Cryptography: Impossibility and Constructions. CRYPTO 2011: 429-446 |
| i8 | | Nishanth Chandran, Melissa Chase, Vinod Vaikuntanathan: Collusion Resistant Obfuscation and Functional Re-encryption. IACR Cryptology ePrint Archive 2011: 337 (2011) |
| 2010 | ||
| c9 | | Nishanth Chandran, Juan A. Garay, Rafail Ostrovsky: Improved Fault Tolerance and Secure Computation on Sparse Networks. ICALP (2) 2010: 249-260 |
| c8 | | Nishanth Chandran, Rafail Ostrovsky, William E. Skeith III: Public-Key Encryption with Efficient Amortized Updates. SCN 2010: 17-35 |
| c7 | | Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostrovsky, Leonid Reyzin: Privacy amplification with asymptotically optimal entropy loss. STOC 2010: 785-794 |
| i7 | | Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner: Position-Based Quantum Cryptography: Impossibility and Constructions. CoRR abs/1009.2490 (2010) |
| i6 | | Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, Christian Schaffner: Position-Based Quantum Cryptography: Impossibility and Constructions. IACR Cryptology ePrint Archive 2010: 275 (2010) |
| 2009 | ||
| c6 | | Nishanth Chandran, Vipul Goyal, Ryan Moriarty, Rafail Ostrovsky: Position Based Cryptography. CRYPTO 2009: 391-407 |
| c5 | | |
| c4 | | Jan Camenisch, Nishanth Chandran, Victor Shoup: A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks. EUROCRYPT 2009: 351-368 |
| i5 | | Nishanth Chandran, Vipul Goyal, Ryan Moriarty, Rafail Ostrovsky: Position Based Cryptography. IACR Cryptology ePrint Archive 2009: 364 (2009) |
| 2008 | ||
| j1 | | Nishanth Chandran, Ryan Moriarty, Rafail Ostrovsky, Omkant Pandey, Mohammad Ali Safari, Amit Sahai: Improved algorithms for optimal embeddings. ACM Transactions on Algorithms 4(4) (2008) |
| c3 | | Nishanth Chandran, Vipul Goyal, Amit Sahai: New Constructions for UC Secure Computation Using Tamper-Proof Hardware. EUROCRYPT 2008: 545-562 |
| i4 | | Jan Camenisch, Nishanth Chandran, Victor Shoup: A public key encryption scheme secure against key dependent chosen plaintext and adaptive chosen ciphertext attacks. IACR Cryptology ePrint Archive 2008: 375 (2008) |
| i3 | | Nishanth Chandran, Rafail Ostrovsky, William E. Skeith III: Public-Key Encryption with Efficient Amortized Updates. IACR Cryptology ePrint Archive 2008: 429 (2008) |
| 2007 | ||
| c2 | | Nishanth Chandran, Vipul Goyal, Rafail Ostrovsky, Amit Sahai: Covert Multi-Party Computation. FOCS 2007: 238-248 |
| c1 | | Nishanth Chandran, Jens Groth, Amit Sahai: Ring Signatures of Sub-linear Size Without Random Oracles. ICALP 2007: 423-434 |
| i2 | | Nishanth Chandran, Vipul Goyal, Amit Sahai: New Constructions for UC Secure Computation using Tamper-proof Hardware. IACR Cryptology ePrint Archive 2007: 334 (2007) |
| 2006 | ||
| i1 | | Nishanth Chandran, Ryan Moriarty, Rafail Ostrovsky, Omkant Pandey, Amit Sahai: Improved Algorithms for Optimal Embeddings. Electronic Colloquium on Computational Complexity (ECCC) 13(110) (2006) |
Data released under the ODC-BY 1.0 license — See also our legal information page