Sciweavers

53 search results - page 10 / 11
» Minimal Complete Primitives for Secure Multi-party Computati...
Sort
View
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
15 years 10 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
80
Voted
COMPSAC
2009
IEEE
15 years 4 months ago
The Design and Implementation of a Bare PC Email Server
— This paper presents the architecture, design and implementation of an email server that runs on a bare PC without an operating system or hard-disk. In addition to providing sta...
George H. Ford Jr., Ramesh K. Karne, Alexander L. ...
PODC
2009
ACM
15 years 10 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
RAID
1999
Springer
15 years 1 months ago
Defending against a Denial-of-Service Attack on TCP
In this paper we propose a real-time anomaly detection method for detecting TCP SYN-flooding attacks. This method is based on the intensities of SYN segments which are measured on...
Pars Mutaf
HPCC
2007
Springer
15 years 3 months ago
Dynamic System-Wide Reconfiguration of Grid Deployments in Response to Intrusion Detections
As Grids become increasingly relied upon as critical infrastructure, it is imperative to ensure the highly-available and secure day-to-day operation of the Grid infrastructure. The...
Jonathan C. Rowanhill, Glenn S. Wasson, Zach Hill,...