Sciweavers

187 search results - page 22 / 38
» On Garbling Schemes With And Without Privacy
Sort
View
CRYPTO
2004
Springer
91views Cryptology» more  CRYPTO 2004»
15 years 3 months ago
Non-interactive Timestamping in the Bounded Storage Model
A timestamping scheme is non-interactive if a stamper can stamp a document without communicating with any other player. The only communication done is at validation time. Non-Inte...
Tal Moran, Ronen Shaltiel, Amnon Ta-Shma
88
Voted
CCS
2010
ACM
14 years 10 months ago
Securing wireless sensor networks against large-scale node capture attacks
Securing wireless sensor networks against node capture is a challenging task. All well-known random key pre-distribution systems, including the Eschenauer and Gligor's pionee...
Tuan Manh Vu, Reihaneh Safavi-Naini, Carey William...
79
Voted
ACSAC
2010
IEEE
14 years 7 months ago
Defending DSSS-based broadcast communication against insider jammers via delayed seed-disclosure
Spread spectrum techniques such as Direct Sequence Spread Spectrum (DSSS) and Frequency Hopping (FH) have been commonly used for anti-jamming wireless communication. However, trad...
An Liu, Peng Ning, Huaiyu Dai, Yao Liu, Cliff Wang
KDD
2005
ACM
149views Data Mining» more  KDD 2005»
15 years 3 months ago
A distributed learning framework for heterogeneous data sources
We present a probabilistic model-based framework for distributed learning that takes into account privacy restrictions and is applicable to scenarios where the different sites ha...
Srujana Merugu, Joydeep Ghosh
CCS
2007
ACM
15 years 3 months ago
Pors: proofs of retrievability for large files
In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier...
Ari Juels, Burton S. Kaliski Jr.