| 2009 |
|---|
| 67 | EE | Sumit Gulwani,
Saurabh Srivastava,
Ramarathnam Venkatesan:
Constraint-Based Invariant Inference over Predicate Abstraction.
VMCAI 2009: 120-135 |
| 2008 |
|---|
| 66 | EE | Dimitar Jetchev,
Ramarathnam Venkatesan:
Bits Security of the Elliptic Curve Diffie-Hellman Secret Keys.
CRYPTO 2008: 75-92 |
| 65 | EE | Matthias Jacob,
Mariusz H. Jakubowski,
Prasad Naldurg,
Chit Wei Saw,
Ramarathnam Venkatesan:
The Superdiversifier: Peephole Individualization for Software Protection.
IWSEC 2008: 100-120 |
| 64 | EE | Matthew Cary,
Matthias Jacob,
Mariusz H. Jakubowski,
Ramarathnam Venkatesan:
The Long-Short-Key Primitive and Its Applications to Key Security.
IWSEC 2008: 279-297 |
| 63 | EE | Sumit Gulwani,
Saurabh Srivastava,
Ramarathnam Venkatesan:
Program analysis as constraint solving.
PLDI 2008: 281-292 |
| 62 | EE | Stephen D. Miller,
Ramarathnam Venkatesan:
Non-degeneracy of Pollard Rho Collisions
CoRR abs/0808.0469: (2008) |
| 2007 |
|---|
| 61 | EE | 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 |
| 60 | EE | 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 |
| 59 | EE | Mariusz H. Jakubowski,
Ramarathnam Venkatesan:
Randomized radon transforms for biometric authentication via fingerprint hashing.
Digital Rights Management Workshop 2007: 90-94 |
| 58 | EE | Srivatsan Laxman,
Prasad Naldurg,
Raja Sripada,
Ramarathnam Venkatesan:
Connections between Mining Frequent Itemsets and Learning Generative Models.
ICDM 2007: 571-576 |
| 57 | EE | David Jao,
Dimitar Jetchev,
Ramarathnam Venkatesan:
On the Bits of Elliptic Curve Diffie-Hellman Keys.
INDOCRYPT 2007: 33-47 |
| 56 | EE | Bertrand Anckaert,
Mariusz H. Jakubowski,
Ramarathnam Venkatesan,
Koen De Bosschere:
Run-Time Randomization to Mitigate Tampering.
IWSEC 2007: 153-168 |
| 55 | EE | Nenad Dedic,
Mariusz H. Jakubowski,
Ramarathnam Venkatesan:
A Graph Game Model for Software Tamper Protection.
Information Hiding 2007: 80-95 |
| 54 | EE | Mariusz H. Jakubowski,
Prasad Naldurg,
Vijay Patankar,
Ramarathnam Venkatesan:
Software Integrity Checking Expressions (ICEs) for Robust Tamper Detection.
Information Hiding 2007: 96-111 |
| 53 | EE | Matthias Jacob,
Mariusz H. Jakubowski,
Ramarathnam Venkatesan:
Towards integral binary execution: implementing oblivious hashing using overlapped instruction encodings.
MM&Sec 2007: 129-140 |
| 52 | EE | David Jao,
S. Ramesh Raju,
Ramarathnam Venkatesan:
Digit Set Randomization in Elliptic Curve Cryptography.
SAGA 2007: 105-117 |
| 51 | EE | Debapratim De,
Abishek Kumarasubramanian,
Ramarathnam Venkatesan:
Inversion Attacks on Secure Hash Functions Using satSolvers.
SAT 2007: 377-382 |
| 2006 |
|---|
| 50 | EE | Stephen D. Miller,
Ramarathnam Venkatesan:
Spectral Analysis of Pollard Rho Collisions.
ANTS 2006: 573-581 |
| 49 | EE | Bertrand Anckaert,
Mariusz H. Jakubowski,
Ramarathnam Venkatesan:
Proteus: virtualization for diversified tamper-resistance.
Digital Rights Management Workshop 2006: 47-58 |
| 48 | EE | 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) |
| 47 | EE | Stephen D. Miller,
Ramarathnam Venkatesan:
Spectral Analysis of Pollard Rho Collisions
CoRR abs/math/0603727: (2006) |
| 2005 |
|---|
| 46 | | Subhamoy Maitra,
C. E. Veni Madhavan,
Ramarathnam Venkatesan:
Progress in Cryptology - INDOCRYPT 2005, 6th International Conference on Cryptology in India, Bangalore, India, December 10-12, 2005, Proceedings
Springer 2005 |
| 45 | EE | Michael Malkin,
Ramarathnam Venkatesan:
Comparison of Texts Streams in the Presence of Mild Adversaries.
ACSW Frontiers 2005: 179-186 |
| 44 | EE | 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 |
| 43 | | 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 |
| 42 | EE | 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) |
| 41 | EE | 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) |
| 2004 |
|---|
| 40 | | Suleyman Serdar Kozat,
Ramarathnam Venkatesan,
Mehmet Kivanç Mihçak:
Robust perceptual image hashing via matrix invariants.
ICIP 2004: 3443-3446 |
| 39 | EE | Tie Liu,
Ramarathnam Venkatesan,
Mehmet Kivanç Mihçak:
Scale-invariant image watermarking via optimization algorithms for quantizing randomized statistics.
MM&Sec 2004: 124-132 |
| 38 | EE | Mustafa Kesal,
Mehmet Kivanç Mihçak,
Ramarathnam Venkatesan:
An improved attack analysis on a public-key spread spectrum watermarking.
MM&Sec 2004: 41-45 |
| 37 | EE | 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) |
| 2003 |
|---|
| 36 | EE | Matthew Cary,
Ramarathnam Venkatesan:
A Message Authentication Code Based on Unimodular Matrix Groups.
CRYPTO 2003: 500-512 |
| 2002 |
|---|
| 35 | EE | Jeremy Horwitz,
Ramarathnam Venkatesan:
Random Cayley Digraphs and the Discrete Logarithm.
ANTS 2002: 416-430 |
| 34 | EE | Mehmet Kivanç Mihçak,
Ramarathnam Venkatesan,
Mustafa Kesal:
Cryptanalysis of Discrete-Sequence Spread Spectrum Watermarks.
Information Hiding 2002: 226-246 |
| 33 | EE | 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 |
| 32 | EE | 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) |
| 2001 |
|---|
| 31 | EE | Mehmet Kivanç Mihçak,
Ramarathnam Venkatesan:
New Iterative Geometric Methods for Robust Perceptual Image Hashing.
Digital Rights Management Workshop 2001: 13-21 |
| 30 | EE | Ramarathnam Venkatesan,
Vijay V. Vazirani,
Saurabh Sinha:
A Graph Theoretic Approach to Software Watermarking.
Information Hiding 2001: 157-168 |
| 29 | EE | 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 |
| 28 | EE | Leonid A. Levin,
Ramarathnam Venkatesan:
An Average Case NP-complete Graph Problem
CoRR cs.CC/0112001: (2001) |
| 2000 |
|---|
| 27 | | Ramarathnam Venkatesan,
Mariusz H. Jakubowski:
Image Watermarking with Better Resilience.
ICIP 2000 |
| 26 | | Ramarathnam Venkatesan,
S.-M. Koon,
Mariusz H. Jakubowski,
Pierre Moulin:
Robust Image Hashing.
ICIP 2000 |
| 1999 |
|---|
| 25 | EE | William Aiello,
Sivaramakrishnan Rajagopalan,
Ramarathnam Venkatesan:
High-Speed Pseudorandom Number Generation with Small Memory.
FSE 1999: 290-304 |
| 1998 |
|---|
| 24 | EE | William Aiello,
Mihir Bellare,
Giovanni Di Crescenzo,
Ramarathnam Venkatesan:
Security Amplification by Composition: The Case of Doubly-Iterated, Ideal Ciphers.
CRYPTO 1998: 390-407 |
| 23 | EE | Victor Boyko,
Marcus Peinado,
Ramarathnam Venkatesan:
Speeding up Discrete Log and Factoring Based Schemes via Precomputations.
EUROCRYPT 1998: 221-235 |
| 22 | EE | Mariusz H. Jakubowski,
Ramarathnam Venkatesan:
The Chain & Sum Primitive and Its Applications to MACs and Stream Ciphers.
EUROCRYPT 1998: 281-293 |
| 21 | EE | Dan Boneh,
Ramarathnam Venkatesan:
Breaking RSA May Not Be Equivalent to Factoring.
EUROCRYPT 1998: 59-71 |
| 20 | EE | William Aiello,
Stuart Haber,
Ramarathnam Venkatesan:
New Constructions for Secure Hash Functions.
FSE 1998: 150-167 |
| 19 | EE | 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) |
| 18 | | William Aiello,
Sivaramakrishnan Rajagopalan,
Ramarathnam Venkatesan:
Design of Practical and Provably Good Random Number Generators.
J. Algorithms 29(2): 358-389 (1998) |
| 17 | EE | 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) |
| 1997 |
|---|
| 16 | | Marcus Peinado,
Ramarathnam Venkatesan:
Highly Parallel Cryptographic Attacks.
PVM/MPI 1997: 367-374 |
| 15 | | Dan Boneh,
Ramarathnam Venkatesan:
Rounding in Lattices and its Cryptographic Applications.
SODA 1997: 675-681 |
| 14 | | Sulaiman Al-Bassam,
Ramarathnam Venkatesan,
Sultan Al-Muhammadi:
New single asymmetric error-correcting codes.
IEEE Transactions on Information Theory 43(5): 1619-1623 (1997) |
| 1996 |
|---|
| 13 | EE | Dan Boneh,
Ramarathnam Venkatesan:
Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes.
CRYPTO 1996: 129-142 |
| 12 | EE | William Aiello,
Ramarathnam Venkatesan:
Foiling Birthday Attacks in Length-Doubling Transformations - Benes: A Non-Reversible Alternative to Feistel.
EUROCRYPT 1996: 307-320 |
| 1995 |
|---|
| 11 | | William Aiello,
Sivaramakrishnan Rajagopalan,
Ramarathnam Venkatesan:
Design of Practical and Provably Good Random Number Generators (Extended Abstract).
SODA 1995: 1-9 |
| 10 | | Dennis Grinberg,
Sivaramakrishnan Rajagopalan,
Ramarathnam Venkatesan,
Victor K. Wei:
Splay Trees for Data Compression.
SODA 1995: 522-530 |
| 9 | EE | William Aiello,
Mihir Bellare,
Ramarathnam Venkatesan:
Knowledge on the average-perfect, statistical and logarithmic.
STOC 1995: 469-478 |
| 1994 |
|---|
| 8 | | William Aiello,
Ramarathnam Venkatesan,
Moti Yung:
Coins, Weights and Contention in Balancing Networks.
PODC 1994: 193-205 |
| 1993 |
|---|
| 7 | EE | Rafail Ostrovsky,
Ramarathnam Venkatesan,
Moti Yung:
Interactive Hashing Simplifies Zero-Knowledge Protocol Design.
EUROCRYPT 1993: 267-273 |
| 1992 |
|---|
| 6 | EE | 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 |
| 5 | | Rafail Ostrovsky,
Ramarathnam Venkatesan,
Moti Yung:
Secure Commitment Against A Powerful Adversary.
STACS 1992: 439-448 |
| 4 | | Ramarathnam Venkatesan,
Sivaramakrishnan Rajagopalan:
Average Case Intractability of Matrix and Diophantine Problems (Extended Abstract)
STOC 1992: 632-642 |
| 1991 |
|---|
| 3 | | Sulaiman Al-Bassam,
Bella Bose,
Ramarathnam Venkatesan:
Burst and Unidirectional Error Detecting Codes.
FTCS 1991: 378-384 |
| 1990 |
|---|
| 2 | | Oded Goldreich,
Russell Impagliazzo,
Leonid A. Levin,
Ramarathnam Venkatesan,
David Zuckerman:
Security Preserving Amplification of Hardness
FOCS 1990: 318-326 |
| 1988 |
|---|
| 1 | | Ramarathnam Venkatesan,
Leonid A. Levin:
Random Instances of a Graph Coloring Problem Are Hard
STOC 1988: 217-222 |
