Sciweavers

769 search results - page 124 / 154
» Simple Composition of Nets
Sort
View
ICALP
2005
Springer
14 years 1 months ago
Single-Database Private Information Retrieval with Constant Communication Rate
We present a single-database private information retrieval (PIR) scheme with communication complexity O(k+d), where k ≥ log n is a security parameter that depends on the database...
Craig Gentry, Zulfikar Ramzan
CC
2005
Springer
153views System Software» more  CC 2005»
14 years 1 months ago
Completeness Analysis for Incomplete Object-Oriented Programs
We introduce a new approach, called completeness analysis, to computing points-to sets for incomplete Java programs such as library modules or applications in the presence of dynam...
Jingling Xue, Phung Hua Nguyen
IMC
2004
ACM
14 years 1 months ago
A framework for malicious workload generation
Malicious traffic from self-propagating worms and denialof-service attacks constantly threatens the everyday operation of Internet systems. Defending networks from these threats d...
Joel Sommers, Vinod Yegneswaran, Paul Barford
ECOWS
2004
Springer
14 years 1 months ago
Managers Don't Code: Making Web Services Middleware Applicable for End-Users
Today’s web-pages are primarily designed for occasional usage. Professional users therefore use special applications that use Web Services increasingly. As the number of internet...
Alexander Hilliger von Thile, Ingo Melzer, Hans-Pe...
FOSSACS
2004
Springer
14 years 1 months ago
Bisimulation on Speed: Lower Time Bounds
More than a decade ago, Moller and Tofts published their seminal work on relating processes that are annotated with lower time bounds, with respect to speed. Their paper has left o...
Gerald Lüttgen, Walter Vogler