Sciweavers

27 search results - page 3 / 6
» Adaptively Secure Puncturable Pseudorandom Functions in the ...
Sort
View
ASIACRYPT
2008
Springer
13 years 8 months ago
Compact Proofs of Retrievability
In a proof-of-retrievability system, a data storage center must prove to a verifier that he is actually storing all of a client's data. The central challenge is to build syst...
Hovav Shacham, Brent Waters
CRYPTO
2005
Springer
164views Cryptology» more  CRYPTO 2005»
13 years 11 months ago
Composition Does Not Imply Adaptive Security
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
Krzysztof Pietrzak
ASIACRYPT
2003
Springer
13 years 11 months ago
Incremental Multiset Hash Functions and Their Application to Memory Integrity Checking
We introduce a new cryptographic tool: multiset hash functions. Unlike standard hash functions which take strings as input, multiset hash functions operate on multisets (or sets). ...
Dwaine E. Clarke, Srinivas Devadas, Marten van Dij...
SCN
2008
Springer
13 years 6 months ago
Two Generic Constructions of Probabilistic Cryptosystems and Their Applications
In this paper, we build, in a generic way, two asymmetric cryptosystems with a careful study of their security. We present first an additively homomorphic scheme which generalizes,...
Guilhem Castagnos
SASN
2005
ACM
13 years 11 months ago
On the security of group communication schemes based on symmetric key cryptosystems
Many emerging applications in both wired and wireless networks, such as information dissemination and distributed collaboration in an adversarial environment, need support of secu...
Shouhuai Xu