Sciweavers

2601 search results - page 269 / 521
» Secure Rewarding Schemes
Sort
View
HPDC
2002
IEEE
15 years 8 months ago
Lightweight Self-Organizing Frameworks for Metacomputing
A novel component-based, service-oriented framework for distributed metacomputing is described. Adopting a provider-centric view of resource sharing, this project emphasizes light...
Vaidy S. Sunderam, Dawid Kurzyniec
148
Voted
IWDW
2009
Springer
15 years 8 months ago
Fast Embedding Technique for Dirty Paper Trellis Watermarking
This paper deals with the improvement of the Dirty Paper Trellis Code (DPTC) watermarking algorithm. This watermarking algorithm is known to be one of the best among the high rate ...
Marc Chaumont
140
Voted
OOPSLA
1995
Springer
15 years 7 months ago
Bidirectional Object Layout for Separate Compilation
Existing schemes for object layout and dispatch in the presence of multiple inheritance and separate compilation waste space and are slower than systems with single inheritance. T...
Andrew C. Myers
FSE
2008
Springer
110views Cryptology» more  FSE 2008»
15 years 5 months ago
How to Encrypt with a Malicious Random Number Generator
Chosen-plaintext attacks on private-key encryption schemes are currently modeled by giving an adversary access to an oracle that encrypts a given message m using random coins that ...
Seny Kamara, Jonathan Katz
AAECC
2006
Springer
77views Algorithms» more  AAECC 2006»
15 years 3 months ago
Protecting against key-exposure: strongly key-insulated encryption with optimal threshold
A new framework for protection against key exposure was recently suggested by Dodis et. al. [16]. We take its realization further towards practice by presenting simple new schemes...
Mihir Bellare, Adriana Palacio