Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Sivaramakrishnan Rajagopalan

dblp:08/936 · DBLP profile ↗
← Back
8ranked-venue papers
0as first author
0since 2021 · last 2000
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4Security and privacy · 3Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
4 papers
Cryptographic protocols and secure computation · 67% Cryptographic primitives and cryptanalysis · 14% Network security · 9%
Theoretical computer science
3 papers
Algorithms and data structures · 43% Coding theory · 43% Computational complexity · 14%

Topics — the 11 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
interactive proofs		 0.012000
Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP · ICALP 2000
Cryptographic protocols and secure computation › proof systems
witness indistinguishability		 0.012000
Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP · ICALP 2000
Cryptographic protocols and secure computation › oblivious transfer
conditional oblivious transfer		 0.011999
Conditional Oblivious Transfer and Timed-Release Encryption · EUROCRYPT 1999
Cryptographic protocols and secure computation
oblivious transfer		 0.011999
Conditional Oblivious Transfer and Timed-Release Encryption · EUROCRYPT 1999
Cryptographic primitives and cryptanalysis › encryption
timed-release encryption		 0.011999
Conditional Oblivious Transfer and Timed-Release Encryption · EUROCRYPT 1999
Network security
firewall		 0.011997
Blocking Java Applets at the Firewall · NDSS 1997
Algorithms and data structures
pseudorandom number generation		 0.011995
Design of Practical and Provably Good Random Number Generators (Extended Abstract) · SODA 1995
Coding theory
source coding		 0.011995
Splay Trees for Data Compression · SODA 1995
Algorithms and data structures › data structure design › search structures › search trees › binary search trees
splay trees		 0.011995
Splay Trees for Data Compression · SODA 1995
Coding theory › source coding › tree coding
tree compression		 0.011995
Splay Trees for Data Compression · SODA 1995
Computational complexity
average-case complexity		 0.011992
Average Case Intractability of Matrix and Diophantine Problems (Extended Abstract) · STOC 1992

Methods — techniques the papers use, named apart from their topics

computational complexity analysis · 0.0packet filtering · 0.0firewall configuration · 0.0
YearPublicationVenuePosition
2000 Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP
William Aiello, Sandeep N. Bhatt, Rafail Ostrovsky, Sivaramakrishnan Rajagopalan
 ICALP4
1999 Conditional Oblivious Transfer and Timed-Release Encryption
Giovanni Di Crescenzo, Rafail Ostrovsky, Sivaramakrishnan Rajagopalan
 EUROCRYPT3
1999 High-Speed Pseudorandom Number Generation with Small Memory
William Aiello, Sivaramakrishnan Rajagopalan, Ramarathnam Venkatesan
 FSE2
1999 Managing Security in Dynamic Networks
Alexander V. Konstantinou, Yechiam Yemini, Sandeep N. Bhatt, Sivaramakrishnan Rajagopalan
 LISA4
1997 Blocking Java Applets at the Firewall
abstract
This paper explores the problem of protecting a site on the Internet against hostile external Java applets while allowing trusted internal applets to run. With careful implementation, a site can be made resistant to current Java security weaknesses as well as those yet to be discovered. In addition, we describe a new attack on certain sophisticated firewalls that is most effectively realized as a Java applet.
David M. Martin Jr., Sivaramakrishnan Rajagopalan, Aviel D. Rubin
 NDSS2
1995 Design of Practical and Provably Good Random Number Generators (Extended Abstract)
William Aiello, Sivaramakrishnan Rajagopalan, Ramarathnam Venkatesan
 SODA2
1995 Splay Trees for Data Compression
Dennis Grinberg, Sivaramakrishnan Rajagopalan, Ramarathnam Venkatesan, Victor K.-W. Wei
 SODA2
1992 Average Case Intractability of Matrix and Diophantine Problems (Extended Abstract)
abstract
Article Free Access Share on Average case intractability of matrix and diophantine problems (extended abstract) Authors: Ramarathnam Venkatesan Bellcore, Room 2M-344, 445 South Street, Morristown, NJ Bellcore, Room 2M-344, 445 South Street, Morristown, NJView Profile , Sivaramakrishnan Rajagopalan Boston University and Computer Science Department, 111 Cummington St, Boston, MA Boston University and Computer Science Department, 111 Cummington St, Boston, MAView Profile Authors Info & Claims STOC '92: Proceedings of the twenty-fourth annual ACM symposium on Theory of ComputingJuly 1992Pages 632–642https://doi.org/10.1145/129712.129774Published:01 July 1992Publication History 4citation298DownloadsMetricsTotal Citations4Total Downloads298Last 12 Months7Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Publisher SiteeReaderPDF
Ramarathnam Venkatesan, Sivaramakrishnan Rajagopalan
 STOC2