Search the dblp DataBase

Publications of Author

1. Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan
   Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One. [Citation Graph (0, 0)][DBLP]
   CRYPTO, 2006, pp:271-289 [Conf]
   
2. Shafi Goldwasser, Elan Pavlov, Vinod Vaikuntanathan
   Fault-Tolerant Distributed Computing in Full-Information Networks. [Citation Graph (0, 0)][DBLP]
   FOCS, 2006, pp:15-26 [Conf]
   
3. Charles W. O'Donnell, Vinod Vaikuntanathan
   Information Leak in the Chord Lookup Protocol. [Citation Graph (0, 0)][DBLP]
   Peer-to-Peer Computing, 2004, pp:28-35 [Conf]
   
4. Vinod Vaikuntanathan
   Brief announcement: broadcast in radio networks in the presence of byzantine adversaries. [Citation Graph (0, 0)][DBLP]
   PODC, 2005, pp:167- [Conf]
   
5. Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan
   Byzantine agreement in the full-information model in O(log n) rounds. [Citation Graph (0, 0)][DBLP]
   STOC, 2006, pp:179-186 [Conf]
   
6. Susan Hohenberger, Guy N. Rothblum, Abhi Shelat, Vinod Vaikuntanathan
   Securely Obfuscating Re-encryption. [Citation Graph (0, 0)][DBLP]
   TCC, 2007, pp:233-252 [Conf]
   
7. Shafi Goldwasser, Madhu Sudan, Vinod Vaikuntanathan
   Distributed Computing with Imperfect Randomness. [Citation Graph (0, 0)][DBLP]
   DISC, 2005, pp:288-302 [Conf]
   
8. Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan
   Relations Among Notions of Non-malleability for Encryption. [Citation Graph (0, 0)][DBLP]
   ASIACRYPT, 2007, pp:519-535 [Conf]
   
9. Ronald Cramer, Goichiro Hanaoka, Dennis Hofheinz, Hideki Imai, Eike Kiltz, Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan
   Bounded CCA2-Secure Encryption. [Citation Graph (0, 0)][DBLP]
   ASIACRYPT, 2007, pp:502-518 [Conf]
   
10. Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert de Haan, Vinod Vaikuntanathan
    Secure Computation from Random Error Correcting Codes. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2007, pp:291-310 [Conf]
    
11. 
    Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices. [Citation Graph (, )][DBLP]
    
    
12. 
    Signature Schemes with Bounded Leakage Resilience. [Citation Graph (, )][DBLP]
    
    
13. 
    A Framework for Efficient and Composable Oblivious Transfer. [Citation Graph (, )][DBLP]
    
    
14. 
    Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems. [Citation Graph (, )][DBLP]
    
    
15. 
    Adaptive One-Way Functions and Applications. [Citation Graph (, )][DBLP]
    
    
16. 
    i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits. [Citation Graph (, )][DBLP]
    
    
17. 
    A Simple BGN-Type Cryptosystem from LWE. [Citation Graph (, )][DBLP]
    
    
18. 
    Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases. [Citation Graph (, )][DBLP]
    
    
19. 
    Fully Homomorphic Encryption over the Integers. [Citation Graph (, )][DBLP]
    
    
20. 
    Trapdoors for hard lattices and new cryptographic constructions. [Citation Graph (, )][DBLP]
    
    
21. 
    How Efficient Can Memory Checking Be?. [Citation Graph (, )][DBLP]
    
    
22. 
    Simultaneous Hardcore Bits and Cryptography against Memory Attacks. [Citation Graph (, )][DBLP]
    
    
23. 
    Weak Verifiable Random Functions. [Citation Graph (, )][DBLP]
    
    
24. 
    Public-Key Encryption Schemes with Auxiliary Inputs. [Citation Graph (, )][DBLP]
    
    
25. 
    Robustness of the Learning with Errors Assumption. [Citation Graph (, )][DBLP]
    
    
26. 
    Trapdoors for Hard Lattices and New Cryptographic Constructions. [Citation Graph (, )][DBLP]