2237 search results - page 101 / 448 » On the Security of Random Sources |
151
click to vote
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
Privacy and security are essential requirements in practical biometric systems. In order to prevent the theft of biometric patterns, it is desired to modify them through revocable...
137
Voted
CRYPTO
2005
Springer
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...
135
click to vote
ASIACRYPT
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. We give a careful, fixed-size parameter analysis of a standard [1,4] way to form a pseudorandom generator by iterating a one-way function and then pseudo-random function...
144
click to vote
CRYPTO
2006
Springer
15 years 8 months ago
2006
Springer
We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the...
129
Voted
PROVSEC
2009
Springer
15 years 11 months ago
2009
Springer
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...