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

Abhishek Prateek

dblp:17/7564 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none

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

Security and privacy · 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
1 paper
Web and mobile security · 50% Systems and software security · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 50% Hardware reliability and fault tolerance · 50%

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

TopicWeightPapersLastEvidence papers
Systems and software security
replicated execution
0.112009
Ripley: automatically securing web 2.0 applications through replicated execution · CCS 2009
Web and mobile security
web application security
0.112009
Ripley: automatically securing web 2.0 applications through replicated execution · CCS 2009
Distributed systems
fault tolerance
0.112009
Ripley: automatically securing web 2.0 applications through replicated execution · CCS 2009
Hardware reliability and fault tolerance › redundancy
replicated execution
0.112009
Ripley: automatically securing web 2.0 applications through replicated execution · CCS 2009

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

replicated execution · 0.2discrepancy detection · 0.2
YearPublicationVenuePosition
2009 Ripley: automatically securing web 2.0 applications through replicated execution
abstract
Rich Internet applications are becoming increasingly distributed, as demonstrated by the popularity of AJAX or Web 2.0 applications such as Facebook, Google Maps, Hotmail and many others. A typical multi-tier AJAX application consists, at least, of a server-side component implemented in Java J2EE, PHP or ASP.NET and a client-side component running JavaScript. The resulting application is more responsive because computation has moved closer to the client, avoiding unnecessary network round trips for frequent user actions.However, once a portion of the code has moved to the client, a malicious user can subvert the client side of the computation, jeopardizing the integrity of the server-side state. In this paper we propose Ripley, a system that uses replicated execution to automatically preserve the integrity of a distributed computation. Ripley replicates a copy of the client-side computation on the trusted server tier. Every client-side event is transferred to the replica of the client for execution. Ripley observes results of the computation, both as computed on the client-side and on the server side using the replica of the client-side code. Any discrepancy is flagged as a potential violation of computational integrity.We built Ripley on top of Volta, a distributing compiler that translates .NET applications into JavaScript, effectively providing a measure of security by construction for Volta applications. We have evaluated the Ripley approach on 5 representative AJAX applications built in Volta and also Hotmail, a large widely-used AJAX application. Our results so far suggest that Ripley provides a promising strategy for building secure distributed web applications, which places minimal burden on the application developer at the cost of a low performance overhead.
K. Vikram, Abhishek Prateek, Benjamin Livshits
CCS2