Sciweavers

110 search results - page 21 / 22
» Patterson-Wiedemann construction revisited
Sort
View
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
14 years 8 months ago
How Efficient Can Memory Checking Be?
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod V...
PKC
2009
Springer
166views Cryptology» more  PKC 2009»
14 years 8 months ago
Security of Blind Signatures under Aborts
We explore the security of blind signatures under aborts where the user or the signer may stop the interactive signature issue protocol prematurely. Several works on blind signatur...
Dominique Schröder, Marc Fischlin
WWW
2010
ACM
14 years 2 months ago
Alhambra: a system for creating, enforcing, and testing browser security policies
Alhambra is a browser-based system designed to enforce and test web browser security policies. At the core of Alhambra is a policyenhanced browser supporting fine-grain security ...
Shuo Tang, Chris Grier, Onur Aciiçmez, Samu...
CCS
2009
ACM
14 years 2 months ago
False data injection attacks against state estimation in electric power grids
A power grid is a complex system connecting electric power generators to consumers through power transmission and distribution networks across a large geographical area. System mo...
Yao Liu, Michael K. Reiter, Peng Ning
WADS
2009
Springer
291views Algorithms» more  WADS 2009»
14 years 2 months ago
On the Power of the Semi-Separated Pair Decomposition
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Mic...