184
click to vote
CRYPTO
15 years 10 months ago
2005 Springer 
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
143
click to vote
CRYPTO
15 years 10 months ago
2005 Springer 
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...
132
click to vote
CRYPTO
15 years 10 months ago
2005 Springer
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
149
click to vote
CRYPTO
15 years 10 months ago
2005 Springer
Forgery and counterfeiting are emerging as serious security risks in low-cost pervasive computing devices. These devices lack the computational, storage, power, and communication r...
135
Voted
CRYPTO
15 years 10 months ago
2005 Springer 
We investigate several previously suggested scenarios of instantiating random oracles (ROs) with “realizable” primitives in cryptographic schemes. As candidates for such “in...
|
Cryptology