187 search results - page 22 / 38 » On Garbling Schemes With And Without Privacy |
121
click to vote
CRYPTO
2004
Springer
15 years 11 months ago
2004
Springer
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...
166
click to vote
CCS
2010
ACM
15 years 7 months ago
2010
ACM
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...
166
Voted
ACSAC
2010
IEEE
15 years 4 months ago
2010
IEEE
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...
176
Voted
KDD
2005
ACM
15 years 11 months ago
2005
ACM
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...
154
click to vote
CCS
2007
ACM
16 years 9 days ago
2007
ACM
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...