Sciweavers

204 search results - page 14 / 41
» Provably Secure Metering Scheme
Sort
View
ICICS
2004
Springer
14 years 24 days ago
Factorization-Based Fail-Stop Signatures Revisited
Fail-stop signature (FSS) schemes are important primitives because in a fail-stop signature scheme the signer is protected against unlimited powerful adversaries as follows: Even i...
Katja Schmidt-Samoa
CCS
2010
ACM
14 years 1 months ago
Secure provenance: the essential of bread and butter of data forensics in cloud computing
Secure provenance that records ownership and process history of data objects is vital to the success of data forensics in cloud computing, yet it is still a challenging issue toda...
Rongxing Lu, Xiaodong Lin, Xiaohui Liang, Xuemin (...
PROVSEC
2009
Springer
14 years 1 months ago
Chosen-Ciphertext Secure RSA-Type Cryptosystems
This paper explains how to design fully secure RSA-type cryptosystems from schemes only secure against passive attacks, in the standard model. We rely on instance-independence assu...
Benoît Chevallier-Mames, Marc Joye
ASIACRYPT
2000
Springer
13 years 11 months ago
The Security of Chaffing and Winnowing
This paper takes a closer look at Rivest's chaffing-and-winnowing paradigm for data privacy. We begin with a definition which enables one to clearly determine whether a given ...
Mihir Bellare, Alexandra Boldyreva
IH
2004
Springer
14 years 24 days ago
On the Possibility of Non-invertible Watermarking Schemes
Recently, there are active discussions on the possibility of non-invertible watermarking scheme. A non-invertible scheme prevents an attacker from deriving a valid watermark from a...
Qiming Li, Ee-Chien Chang