Sciweavers

1518 search results - page 152 / 304
» Cryptographic Test Correction
Sort
View
ASPLOS
2011
ACM
14 years 7 months ago
ConSeq: detecting concurrency bugs through sequential errors
Concurrency bugs are caused by non-deterministic interleavings between shared memory accesses. Their effects propagate through data and control dependences until they cause softwa...
Wei Zhang, Junghee Lim, Ramya Olichandran, Joel Sc...
ECCC
2011
204views ECommerce» more  ECCC 2011»
14 years 7 months ago
Dense locally testable codes cannot have constant rate and distance
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...
Irit Dinur, Tali Kaufman
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
16 years 4 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans
137
Voted
EDBT
2008
ACM
147views Database» more  EDBT 2008»
16 years 3 months ago
iDataGuard: middleware providing a secure network drive interface to untrusted internet data storage
In this demonstration, we present the design and features of iDataGuard. iDataGuard is an interoperable security middleware that allows users to outsource their file systems to he...
Ravi Chandra Jammalamadaka, Roberto Gamboni, Shara...
TMA
2010
Springer
166views Management» more  TMA 2010»
15 years 10 months ago
Understanding and Preparing for DNS Evolution
The Domain Name System (DNS) is a crucial component of today’s Internet. The top layer of the DNS hierarchy (the root nameservers) is facing dramatic changes: cryptographically s...
Sebastian Castro, Min Zhang, Wolfgang John, Duane ...