Sciweavers

211 search results - page 15 / 43
» PSS Is Secure against Random Fault Attacks
Sort
View
EUROCRYPT
2001
Springer
15 years 6 months ago
A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures
Abstract. Known practical blind signature schemes whose security against adaptive and parallel attacks can be proven in the random oracle model either need five data exchanges bet...
Masayuki Abe
CANS
2006
Springer
129views Cryptology» more  CANS 2006»
15 years 5 months ago
Side Channel Attacks and Countermeasures on Pairing Based Cryptosystems over Binary Fields
Pairings on elliptic curves have been used as cryptographic primitives for the development of new applications such as identity based schemes. For the practical applications, it is...
Tae-Hyun Kim, Tsuyoshi Takagi, Dong-Guk Han, Ho Wo...
STORAGESS
2006
ACM
15 years 7 months ago
Using device diversity to protect data against batch-correlated disk failures
Batch-correlated failures result from the manifestation of a common defect in most, if not all, disk drives belonging to the same production batch. They are much less frequent tha...
Jehan-François Pâris, Darrell D. E. L...
JOC
2007
129views more  JOC 2007»
15 years 1 months ago
Formal Proofs for the Security of Signcryption
Signcryption is a public key or asymmetric cryptographic method that provides simultaneously both message confidentiality and unforgeability at a lower computational and communica...
Joonsang Baek, Ron Steinfeld, Yuliang Zheng
CRYPTO
2001
Springer
155views Cryptology» more  CRYPTO 2001»
15 years 6 months ago
RSA-OAEP Is Secure under the RSA Assumption
Recently Victor Shoup noted that there is a gap in the widely-believed security result of OAEP against adaptive chosen-ciphertext attacks. Moreover, he showed that, presumably, OA...
Eiichiro Fujisaki, Tatsuaki Okamoto, David Pointch...