Ramarathnam Venkatesan

International Association for Cryptologic Research

Ramarathnam Venkatesan Search web for home page

Program Committees

1	2010	PKC	pc
2	2008	PKC	pc
3	2003	Crypto	pc

Publications

	year	title	booktitle	pages
1	2010	Founding Cryptography on Tamper-Proof Hardware Tokens	eprint	online
2	2010	Founding Cryptography on Tamper-Proof Hardware Tokens	tcc	308-326
3	2010	Quantifying Trust	eprint	online
4	2008	Bits Security of the Elliptic Curve Diffie-Hellman Secret Keys	crypto	75-92
5	2006	MV3: A new word based stream cipher using rapid mixing and revolving buffers	eprint	online
6	2005	Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?	asiacrypt	online
7	2004	Ramanujan Graphs and the Random Reducibility of Discrete Log on Isogenous Elliptic Curves	eprint	online
8	2003	A Message Authentication Code Based on Unimodular Matrix Groups	crypto	online
9	2001	Constructing elliptic curves with a given number of points over a finite field	eprint	online
10	1999	High-Speed Pseudorandom Number Generation with Small Memory	fse	290-304
11	1998	Security amplification by composition: The case of doubly-iterated, ideal ciphers	eprint	online
12	1998	Speeding up Discrete Log and Factoring Based Schemes via Precomputations	eurocrypt	221-235
13	1998	The Chain & Sum Primitive and Its Applications to MACs and Stream Ciphers	eurocrypt	281-293
14	1998	New Constructions for Secure Hash Functions	fse	150-167
15	1998	Breaking RSA May Not Be Equivalent to Factoring	eurocrypt	59-71
16	1998	Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation	jofc	87-108
17	1998	Security Amplification by Composition: The Case of Doubly-Iterated, Ideal Ciphers	crypto	390-407
18	1996	Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes	crypto	129-142
19	1996	Foiling Birthday Attacks in Length-Doubling Transformations - Benes: A Non-Reversible Alternative to Feistel	eurocrypt	307-320
20	1993	Interactive Hashing Simplifies Zero-Knowledge Protocol Design	eurocrypt	267-273
21	1992	Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract)	crypto	196-214

Ramarathnam Venkatesan Search web for home page

Program Committees

Publications

Coauthors of Ramarathnam Venkatesan