2237 search results - page 123 / 448 » On the Security of Random Sources |
148
click to vote
TCC
2010
Springer
16 years 2 months ago
2010
Springer
Abstract. We propose a semantically-secure public-key encryption scheme whose security is polynomialtime equivalent to the hardness of solving random instances of the subset sum pr...
130
click to vote
CRYPTO
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. The Full Domain Hash (FDH) scheme is a RSA-based signature scheme in which the message is hashed onto the full domain of the RSA function. The FDH scheme is provably secu...
181
click to vote
SAFECOMP
2009
Springer
15 years 10 months ago
2009
Springer
We present patterns for expressing dependability requirements, such as confidentiality, integrity, availability, and reliability. The paper considers random faults as well as cert...
180
click to vote
CRYPTO
2001
Springer
15 years 10 months ago
2001
Springer
The OAEP encryption scheme was introduced by Bellare and Rogaway at Eurocrypt ’94. It converts any trapdoor permutation scheme into a public-key encryption scheme. OAEP is widel...
133
click to vote
ICASSP
2008
IEEE
16 years 15 days ago
2008
IEEE
Compressive Sensing (CS) is an emerging area which uses a relatively small number of non-traditional samples in the form of randomized projections to reconstruct sparse or compres...