Sciweavers

1424 search results - page 186 / 285
» Improving on Version Stamps
Sort
View
SPAA
2005
ACM
16 years 19 hour ago
Parallelizing time with polynomial circuits
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
Ryan Williams
ACNS
2005
Springer
116views Cryptology» more  ACNS 2005»
16 years 14 hour ago
Two-Server Password-Only Authenticated Key Exchange
Typical protocols for password-based authentication assume a single server which stores all the information (e.g., the password) necessary to authenticate a user. Unfortunately, a...
Jonathan Katz, Philip D. MacKenzie, Gelareh Taban,...
APPROX
2005
Springer
150views Algorithms» more  APPROX 2005»
16 years 12 hour ago
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
Julián Mestre
CRYPTO
2005
Springer
149views Cryptology» more  CRYPTO 2005»
16 years 4 hour ago
Authenticating Pervasive Devices with Human Protocols
Forgery and counterfeiting are emerging as serious security risks in low-cost pervasive computing devices. These devices lack the computational, storage, power, and communication r...
Ari Juels, Stephen A. Weis
DRMTICS
2005
Springer
16 years 1 hour ago
Algorithms to Watermark Software Through Register Allocation
Software security is a significant issue in the Internet age. In order to prevent software from piracy and unauthorized modification, many techniques have been developed. Softwar...
William Zhu, Clark D. Thomborson