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.
Ramarathnam Venkatesan
2010 – today
- 2013
[c66]Arvind Arasu, Spyros Blanas, Ken Eguro, Raghav Kaushik, Donald Kossmann, Ravishankar Ramamurthy, Ramarathnam Venkatesan: Orthogonal Security with Cipherbase. CIDR 2013
[i14]Srivatsan Laxman, Sushil Mittal, Ramarathnam Venkatesan: Error Correction in Learning using SVMs. CoRR abs/1301.2012 (2013)- 2012
[j8]Arvind Arasu, Spyros Blanas, Ken Eguro, Manas Joglekar, Raghav Kaushik, Donald Kossmann, Ravishankar Ramamurthy, Prasang Upadhyaya, Ramarathnam Venkatesan: Engineering Security and Performance with Cipherbase. IEEE Data Eng. Bull. 35(4): 65-72 (2012)
[c65]- 2011
[c64]Sandeep Karanth, Srivatsan Laxman, Prasad Naldurg, Ramarathnam Venkatesan, John Lambert, Jinwook Shin: ZDVUE: prioritization of javascript attacks to discover new vulnerabilities. AISec 2011: 31-42
[c63]Sumit Gulwani, Susmit Jha, Ashish Tiwari, Ramarathnam Venkatesan: Synthesis of loop-free programs. PLDI 2011: 62-73- 2010
[c62]Swarun Kumar, Shivank Agrawal, Ramarathnam Venkatesan, Satyanarayana V. Lokam, C. Pandu Rangan: Forcing Out a Confession - Threshold Discernible Ring Signatures. SECRYPT 2010: 379-388
[c61]Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam Venkatesan, Akshay Wadia: Founding Cryptography on Tamper-Proof Hardware Tokens. TCC 2010: 308-326
[i13]Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam Venkatesan, Akshay Wadia: Founding Cryptography on Tamper-Proof Hardware Tokens. IACR Cryptology ePrint Archive 2010: 153 (2010)
[i12]Mariusz H. Jakubowski, Ramarathnam Venkatesan, Yacov Yacobi: Quantifying Trust. IACR Cryptology ePrint Archive 2010: 246 (2010)
2000 – 2009
- 2009
[c60]Srivatsan Narayanan, Ananth Raghunathan, Ramarathnam Venkatesan: Obfuscating straight line arithmetic programs. Digital Rights Management Workshop 2009: 47-58
[c59]Mariusz H. Jakubowski, Chit Wei Saw, Ramarathnam Venkatesan: Tamper-Tolerant Software: Modeling and Implementation. IWSEC 2009: 125-139
[c58]Mariusz H. Jakubowski, Chit Wei Saw, Ramarathnam Venkatesan: Iterated Transformations and Quantitative Metrics for Software Protection. SECRYPT 2009: 359-368
[c57]Bertrand Anckaert, Mariusz H. Jakubowski, Ramarathnam Venkatesan, Chit Wei Saw: Runtime Protection via Dataflow Flattening. SECURWARE 2009: 242-248
[c56]Sumit Gulwani, Saurabh Srivastava, Ramarathnam Venkatesan: Constraint-Based Invariant Inference over Predicate Abstraction. VMCAI 2009: 120-135
[i11]Mariusz H. Jakubowski, Ramarathnam Venkatesan, Yacov Yacobi: Quantifying Trust. IACR Cryptology ePrint Archive 2009: 558 (2009)- 2008
[j7]Raghav Bhaskar, K. Chandrasekaran, Satyanarayana V. Lokam, P. L. Montgomery, Ramarathnam Venkatesan, Yacov Yacobi: Vulnerabilities in Anonymous Credential Systems. Electr. Notes Theor. Comput. Sci. 197(2): 141-148 (2008)
[c55]Dimitar Jetchev, Ramarathnam Venkatesan: Bits Security of the Elliptic Curve Diffie-Hellman Secret Keys. CRYPTO 2008: 75-92
[c54]Matthias Jacob, Mariusz H. Jakubowski, Prasad Naldurg, Chit Wei Saw, Ramarathnam Venkatesan: The Superdiversifier: Peephole Individualization for Software Protection. IWSEC 2008: 100-120
[c53]Matthew Cary, Matthias Jacob, Mariusz H. Jakubowski, Ramarathnam Venkatesan: The Long-Short-Key Primitive and Its Applications to Key Security. IWSEC 2008: 279-297
[c52]Sumit Gulwani, Saurabh Srivastava, Ramarathnam Venkatesan: Program analysis as constraint solving. PLDI 2008: 281-292
[i10]Stephen D. Miller, Ramarathnam Venkatesan: Non-degeneracy of Pollard Rho Collisions. CoRR abs/0808.0469 (2008)
[i9]Raghav Bhaskar, K. Chandrasekaran, Satyanarayana V. Lokam, P. L. Montgomery, Ramarathnam Venkatesan, Yacov Yacobi: On The Diffie-Hellman Assumption. IACR Cryptology ePrint Archive 2008: 525 (2008)- 2007
[c51]Nathan Keller, Stephen D. Miller, Ilya Mironov, Ramarathnam Venkatesan: MV3: A New Word Based Stream Cipher Using Rapid Mixing and Revolving Buffers. CT-RSA 2007: 1-19
[c50]Avinash V. Varadarajan, Ramarathnam Venkatesan, C. Pandu Rangan: Data structures for limited oblivious execution of programs while preserving locality of reference. Digital Rights Management Workshop 2007: 63-69
[c49]Mariusz H. Jakubowski, Ramarathnam Venkatesan: Randomized radon transforms for biometric authentication via fingerprint hashing. Digital Rights Management Workshop 2007: 90-94
[c48]Srivatsan Laxman, Prasad Naldurg, Raja Sripada, Ramarathnam Venkatesan: Connections between Mining Frequent Itemsets and Learning Generative Models. ICDM 2007: 571-576
[c47]Nenad Dedic, Mariusz H. Jakubowski, Ramarathnam Venkatesan: A Graph Game Model for Software Tamper Protection. Information Hiding 2007: 80-95
[c46]Mariusz H. Jakubowski, Prasad Naldurg, Vijay Patankar, Ramarathnam Venkatesan: Software Integrity Checking Expressions (ICEs) for Robust Tamper Detection. Information Hiding 2007: 96-111
[c45]David Jao, Dimitar Jetchev, Ramarathnam Venkatesan: On the Bits of Elliptic Curve Diffie-Hellman Keys. INDOCRYPT 2007: 33-47
[c44]Bertrand Anckaert, Mariusz H. Jakubowski, Ramarathnam Venkatesan, Koen De Bosschere: Run-Time Randomization to Mitigate Tampering. IWSEC 2007: 153-168
[c43]Matthias Jacob, Mariusz H. Jakubowski, Ramarathnam Venkatesan: Towards integral binary execution: implementing oblivious hashing using overlapped instruction encodings. MM&Sec 2007: 129-140
[c42]David Jao, S. Ramesh Raju, Ramarathnam Venkatesan: Digit Set Randomization in Elliptic Curve Cryptography. SAGA 2007: 105-117
[c41]Debapratim De, Abishek Kumarasubramanian, Ramarathnam Venkatesan: Inversion Attacks on Secure Hash Functions Using satSolvers. SAT 2007: 377-382- 2006
[c40]Stephen D. Miller, Ramarathnam Venkatesan: Spectral Analysis of Pollard Rho Collisions. ANTS 2006: 573-581
[c39]Bertrand Anckaert, Mariusz H. Jakubowski, Ramarathnam Venkatesan: Proteus: virtualization for diversified tamper-resistance. Digital Rights Management Workshop 2006: 47-58
[i8]Nathan Keller, Stephen D. Miller, Ilya Mironov, Ramarathnam Venkatesan: MV3: A new word based stream cipher using rapid mixing and revolving buffers. CoRR abs/cs/0610048 (2006)
[i7]Stephen D. Miller, Ramarathnam Venkatesan: Spectral Analysis of Pollard Rho Collisions. CoRR abs/math/0603727 (2006)
[i6]Nathan Keller, Stephen D. Miller, Ilya Mironov, Ramarathnam Venkatesan: MV3: A new word based stream cipher using rapid mixing and revolving buffers. IACR Cryptology ePrint Archive 2006: 341 (2006)- 2005
[j6]Mustafa Kesal, Mehmet Kivanç Mihçak, Ramarathnam Venkatesan: An improved attack analysis on a public-key spread spectrum watermarking. Multimedia Syst. 11(2): 133-142 (2005)
[j5]Mehmet Kivanç Mihçak, Ramarathnam Venkatesan, Tie Liu: Watermarking via optimization algorithms for quantizing randomized semi-global image statistics. Multimedia Syst. 11(2): 185-200 (2005)
[c38]Michael Malkin, Ramarathnam Venkatesan: Comparison of Texts Streams in the Presence of Mild Adversaries. ACSW Frontiers 2005: 179-186
[c37]David Jao, Stephen D. Miller, Ramarathnam Venkatesan: Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log? ASIACRYPT 2005: 21-40
[c36]Mehmet Kucukgoz, Oztan Harmanci, Mehmet Kivanç Mihçak, Ramarathnam Venkatesan: Robust video watermarking via optimization algorithm for quantization of pseudo-random semi-global statistics. Security, Steganography, and Watermarking of Multimedia Contents 2005: 363-369
[e1]Subhamoy Maitra, C. E. Veni Madhavan, Ramarathnam Venkatesan (Eds.): Progress in Cryptology - INDOCRYPT 2005, 6th International Conference on Cryptology in India, Bangalore, India, December 10-12, 2005, Proceedings. Lecture Notes in Computer Science 3797, Springer 2005, ISBN 3-540-30805-9- 2004
[c35]Suleyman Serdar Kozat, Ramarathnam Venkatesan, Mehmet Kivanç Mihçak: Robust perceptual image hashing via matrix invariants. ICIP 2004: 3443-3446
[c34]Mustafa Kesal, Mehmet Kivanç Mihçak, Ramarathnam Venkatesan: An improved attack analysis on a public-key spread spectrum watermarking. MM&Sec 2004: 41-45
[c33]Tie Liu, Ramarathnam Venkatesan, Mehmet Kivanç Mihçak: Scale-invariant image watermarking via optimization algorithms for quantizing randomized statistics. MM&Sec 2004: 124-132
[i5]David Jao, Stephen D. Miller, Ramarathnam Venkatesan: Ramanujan Graphs and the Random Reducibility of Discrete Log on Isogenous Elliptic Curves. CoRR math.NT/0411378 (2004)
[i4]David Jao, Stephen D. Miller, Ramarathnam Venkatesan: Ramanujan Graphs and the Random Reducibility of Discrete Log on Isogenous Elliptic Curves. IACR Cryptology ePrint Archive 2004: 312 (2004)- 2003
[c32]Matthew Cary, Ramarathnam Venkatesan: A Message Authentication Code Based on Unimodular Matrix Groups. CRYPTO 2003: 500-512- 2002
[j4]Myung M. Bae, Ramarathnam Venkatesan, Bella Bose: Data Rearrangement between Radix-k and Lee Distance Gray Codes in k-ary n-cubes. J. Parallel Distrib. Comput. 62(1): 19-37 (2002)
[c31]Jeremy Horwitz, Ramarathnam Venkatesan: Random Cayley Digraphs and the Discrete Logarithm. ANTS 2002: 416-430
[c30]Mehmet Kivanç Mihçak, Ramarathnam Venkatesan: Blind image watermarking via derivation and quantization of robust semi-global statistics. ICASSP 2002: 3453-3456
[c29]Mehmet Kivanç Mihçak, Ramarathnam Venkatesan, Mustafa Kesal: Cryptanalysis of Discrete-Sequence Spread Spectrum Watermarks. Information Hiding 2002: 226-246
[c28]Yuqun Chen, Ramarathnam Venkatesan, Matthew Cary, Ruoming Pang, Saurabh Sinha, Mariusz H. Jakubowski: Oblivious Hashing: A Stealthy Software Integrity Verification Primitive. Information Hiding 2002: 400-414- 2001
[c27]Mehmet Kivanç Mihçak, Ramarathnam Venkatesan: New Iterative Geometric Methods for Robust Perceptual Image Hashing. Digital Rights Management Workshop 2001: 13-21
[c26]Mehmet Kivanç Mihçak, Ramarathnam Venkatesan: A Perceptual Audio Hashing Algorithm: A Tool for Robust Audio Identification and Information Hiding. Information Hiding 2001: 51-65
[c25]Ramarathnam Venkatesan, Vijay V. Vazirani, Saurabh Sinha: A Graph Theoretic Approach to Software Watermarking. Information Hiding 2001: 157-168
[i3]Leonid A. Levin, Ramarathnam Venkatesan: An Average Case NP-complete Graph Problem. CoRR cs.CC/0112001 (2001)
[i2]Amod Agashe, Kristin Lauter, Ramarathnam Venkatesan: Constructing elliptic curves with a given number of points over a finite field. IACR Cryptology ePrint Archive 2001: 96 (2001)- 2000
[c24]Ramarathnam Venkatesan, Mariusz H. Jakubowski: Image Watermarking with Better Resilience. ICIP 2000: 403-406
[c23]Ramarathnam Venkatesan, S.-M. Koon, Mariusz H. Jakubowski, Pierre Moulin: Robust Image Hashing. ICIP 2000: 664-666
1990 – 1999
- 1999
[c22]William Aiello, Sivaramakrishnan Rajagopalan, Ramarathnam Venkatesan: High-Speed Pseudorandom Number Generation with Small Memory. FSE 1999: 290-304- 1998
[j3]William Aiello, Sivaramakrishnan Rajagopalan, Ramarathnam Venkatesan: Design of Practical and Provably Good Random Number Generators. J. Algorithms 29(2): 358-389 (1998)
[j2]Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung: Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation. J. Cryptology 11(2): 87-108 (1998)
[c21]William Aiello, Mihir Bellare, Giovanni Di Crescenzo, Ramarathnam Venkatesan: Security Amplification by Composition: The Case of Doubly-Iterated, Ideal Ciphers. CRYPTO 1998: 390-407
[c20]Dan Boneh, Ramarathnam Venkatesan: Breaking RSA May Not Be Equivalent to Factoring. EUROCRYPT 1998: 59-71
[c19]Victor Boyko, Marcus Peinado, Ramarathnam Venkatesan: Speeding up Discrete Log and Factoring Based Schemes via Precomputations. EUROCRYPT 1998: 221-235
[c18]Mariusz H. Jakubowski, Ramarathnam Venkatesan: The Chain & Sum Primitive and Its Applications to MACs and Stream Ciphers. EUROCRYPT 1998: 281-293
[c17]William Aiello, Stuart Haber, Ramarathnam Venkatesan: New Constructions for Secure Hash Functions. FSE 1998: 150-167
[i1]William Aiello, Mihir Bellare, Giovanni Di Crescenzo, Ramarathnam Venkatesan: Security amplification by composition: The case of doubly-iterated ideal ciphers. CoRR cs.CR/9809031 (1998)- 1997
[j1]Sulaiman Al-Bassam, Ramarathnam Venkatesan, Sultan Al-Muhammadi: New single asymmetric error-correcting codes. IEEE Transactions on Information Theory 43(5): 1619-1623 (1997)
[c16]Marcus Peinado, Ramarathnam Venkatesan: Highly Parallel Cryptographic Attacks. PVM/MPI 1997: 367-374
[c15]- 1996
[c14]Dan Boneh, Ramarathnam Venkatesan: Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes. CRYPTO 1996: 129-142
[c13]William Aiello, Ramarathnam Venkatesan: Foiling Birthday Attacks in Length-Doubling Transformations - Benes: A Non-Reversible Alternative to Feistel. EUROCRYPT 1996: 307-320- 1995
[c12]William Aiello, Sivaramakrishnan Rajagopalan, Ramarathnam Venkatesan: Design of Practical and Provably Good Random Number Generators (Extended Abstract). SODA 1995: 1-9
[c11]Dennis Grinberg, Sivaramakrishnan Rajagopalan, Ramarathnam Venkatesan, Victor K. Wei: Splay Trees for Data Compression. SODA 1995: 522-530
[c10]William Aiello, Mihir Bellare, Ramarathnam Venkatesan: Knowledge on the average-perfect, statistical and logarithmic. STOC 1995: 469-478- 1994
[c9]William Aiello, Ramarathnam Venkatesan, Moti Yung: Coins, Weights and Contention in Balancing Networks. PODC 1994: 193-205- 1993
[c8]Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung: Interactive Hashing Simplifies Zero-Knowledge Protocol Design. EUROCRYPT 1993: 267-273- 1992
[c7]Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung: Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract). CRYPTO 1992: 196-214
[c6]Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung: Secure Commitment Against A Powerful Adversary. STACS 1992: 439-448
[c5]Ramarathnam Venkatesan, Sivaramakrishnan Rajagopalan: Average Case Intractability of Matrix and Diophantine Problems (Extended Abstract). STOC 1992: 632-642- 1991
[c4]Sulaiman Al-Bassam, Bella Bose, Ramarathnam Venkatesan: Burst and Unidirectional Error Detecting Codes. FTCS 1991: 378-384- 1990
[c3]Oded Goldreich, Russell Impagliazzo, Leonid A. Levin, Ramarathnam Venkatesan, David Zuckerman: Security Preserving Amplification of Hardness. FOCS 1990: 318-326
1980 – 1989
- 1988
[c2]Ramarathnam Venkatesan, Leonid A. Levin: Random Instances of a Graph Coloring Problem Are Hard. STOC 1988: 217-222- 1986
[c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-16 22:09 CEST by the dblp team



