Ramarathnam Venkatesan |
|
|---|---|
Author's Web Page  | |
| 16 papers in database with 571 citations  Editor of 1 conference proceedings book H-number: 11 | |
Conference Proceedings |
|
  | 1. Subhamoy Maitra, C. E. Veni Madhavan, Ramarathnam Venkatesan, editors, Progress in Cryptology - INDOCRYPT 2005, 6th International Conference on Cryptology in India, Bangalore, India, December 10-12, 2005, Proceedings. Springer, 2005. ISBN 3-540-30805-9. [Papers] Find this book on amazon.com  , amazon.co.uk , amazon.ca , amazon.de , amazon.fr , Google Books or Wikipedia. |
Journal Papers |
|
| 1. Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung, Perfect Zero-Knowledge Arguments for , Journal of Cryptology,
Volume 11(2), pp. 87 - 108,
Springer, 1998. [  Cited
80 times
 ] | |
Conference Papers |
|
| 1. Dimitar Jetchev, Ramarathnam Venkatesan, Bits Security of the Elliptic Curve Diffie-Hellman Secret Keys, pp. 75 - 92, CRYPTO 2008. [  Electronic
Edition][Cited
2 times
] | |
| 2. David Jao, Dimitar Jetchev, Ramarathnam Venkatesan, On the Bits of Elliptic Curve Diffie-Hellman Keys, pp. 33 - 47, INDOCRYPT 2007. [ Electronic
Edition][No
citation] | |
| 3. Nathan Keller, Stephen D. Miller, Ilya Mironov, Ramarathnam Venkatesan, MV3: A New Word Based Stream Cipher Using Rapid Mixing and Revolving Buffers, pp. 1 - 19, CT-RSA 2007. [ Electronic
Edition][Cited
4 times
] | |
| 4. David Jao, Stephen D. Miller, Ramarathnam Venkatesan, Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?, pp. 21 - 40, ASIACRYPT 2005. [ Electronic
Edition][ IACR Online
Archive ][Cited
14 times
] | |
| 5. Matthew Cary, Ramarathnam Venkatesan, A Message Authentication Code Based on Unimodular Matrix Groups, pp. 500 - 512, CRYPTO 2003. [ Electronic
Edition][IACR Online
Archive][Cited
4 times
] | |
| 6. William Aiello, Sivaramakrishnan Rajagopalan, Ramarathnam Venkatesan, High-Speed Pseudorandom Number Generation with Small Memory, pp. 290 - 304, FSE 1999. [ Electronic
Edition][Cited
11 times
] | |
| 7. William Aiello, Mihir Bellare, Giovanni Di Crescenzo, Ramarathnam Venkatesan, Security Amplification by Composition: The Case of Doubly-Iterated, Ideal Ciphers, pp. 390 - 407, CRYPTO 1998. [ Electronic
Edition][Cited
26 times
] | |
| 8. Dan Boneh, Ramarathnam Venkatesan, Breaking RSA May Not Be Equivalent to Factoring, pp. 59 - 71, EUROCRYPT 1998. [ Electronic
Edition][Cited
118 times
] | |
| 9. Mariusz H. Jakubowski, Ramarathnam Venkatesan, The Chain & Sum Primitive and Its Applications to MACs and Stream Ciphers, pp. 281 - 293, EUROCRYPT 1998. [ Electronic
Edition][Cited
16 times
] | |
| 10. Victor Boyko, Marcus Peinado, Ramarathnam Venkatesan, Speeding up Discrete Log and Factoring Based Schemes via Precomputations, pp. 221 - 235, EUROCRYPT 1998. [ Electronic
Edition][Cited
27 times
] | |
| 11. William Aiello, Stuart Haber, Ramarathnam Venkatesan, New Constructions for Secure Hash Functions, pp. 150 - 167, FSE 1998. [ Electronic
Edition][Cited
9 times
] | |
| 12. Dan Boneh, Ramarathnam Venkatesan, Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes, pp. 129 - 142, CRYPTO 1996. [ Electronic
Edition][Cited
154 times
] | |
| 13. William Aiello, Ramarathnam Venkatesan, Foiling Birthday Attacks in Length-Doubling Transformations - Benes: A Non-Reversible Alternative to Feistel, pp. 307 - 320, EUROCRYPT 1996. [ Electronic
Edition][Cited
60 times
] | |
| 14. Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung, Interactive Hashing Simplifies Zero-Knowledge Protocol Design, pp. 267 - 273, EUROCRYPT 1993. [ Electronic
Edition][Cited
34 times
] | |
| 15. Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung, Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract), pp. 196 - 214, CRYPTO 1992. [ Electronic
Edition][Cited
12 times
] | |
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals