International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Ramarathnam Venkatesan

Publications

Year
Venue
Title
2010
TCC
Founding Cryptography on Tamper-Proof Hardware Tokens
Vipul Goyal Yuval Ishai Amit Sahai Ramarathnam Venkatesan Akshay Wadia
2008
CRYPTO
Bits Security of the Elliptic Curve Diffie-Hellman Secret Keys
Dimitar Jetchev Ramarathnam Venkatesan
2005
ASIACRYPT
Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?
David Jao Stephen D. Miller Ramarathnam Venkatesan
2003
CRYPTO
A Message Authentication Code Based on Unimodular Matrix Groups
Matthew Cary Ramarathnam Venkatesan
1999
FSE
High-Speed Pseudorandom Number Generation with Small Memory
William Aiello Sivaramakrishnan Rajagopalan Ramarathnam Venkatesan
1998
CRYPTO
Security Amplification by Composition: The Case of Doubly-Iterated, Ideal Ciphers
William Aiello Mihir Bellare Giovanni Di Crescenzo Ramarathnam Venkatesan
1998
EUROCRYPT
Breaking RSA May Not Be Equivalent to Factoring
Dan Boneh Ramarathnam Venkatesan
1998
EUROCRYPT
Speeding up Discrete Log and Factoring Based Schemes via Precomputations
Victor Boyko Marcus Peinado Ramarathnam Venkatesan
1998
EUROCRYPT
The Chain & Sum Primitive and Its Applications to MACs and Stream Ciphers
Mariusz H. Jakubowski Ramarathnam Venkatesan
1998
FSE
New Constructions for Secure Hash Functions
William Aiello Stuart Haber Ramarathnam Venkatesan
1998
JOFC
Perfect Zero-Knowledge Arguments for <i>NP</i> Using Any One-Way Permutation
Moni Naor Rafail Ostrovsky Ramarathnam Venkatesan Moti Yung
1996
CRYPTO
Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
Dan Boneh Ramarathnam Venkatesan
1996
EUROCRYPT
Foiling Birthday Attacks in Length-Doubling Transformations - Benes: A Non-Reversible Alternative to Feistel
William Aiello Ramarathnam Venkatesan
1993
EUROCRYPT
Interactive Hashing Simplifies Zero-Knowledge Protocol Design
Rafail Ostrovsky Ramarathnam Venkatesan Moti Yung
1992
CRYPTO
Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract)
Moni Naor Rafail Ostrovsky Ramarathnam Venkatesan Moti Yung

Program Committees

PKC 2010
PKC 2008
Crypto 2003

Coauthors

William Aiello (4)
Mihir Bellare (1)
Dan Boneh (2)
Victor Boyko (1)
Matthew Cary (1)
Giovanni Di Crescenzo (1)
Vipul Goyal (1)
Stuart Haber (1)
Yuval Ishai (1)
Mariusz H. Jakubowski (1)
David Jao (1)
Dimitar Jetchev (1)
Stephen D. Miller (1)
Moni Naor (2)
Rafail Ostrovsky (3)
Marcus Peinado (1)
Sivaramakrishnan Rajagopalan (1)
Amit Sahai (1)
Akshay Wadia (1)
Moti Yung (3)