Sciweavers

405 search results - page 46 / 81
» Practice-Oriented Provable Security
Sort
View
ISPEC
2010
Springer
13 years 9 months ago
Certificateless KEM and Hybrid Signcryption Schemes Revisited
Often authentication and confidentiality are required as simultaneous key requirements in many cryptographic applications. The cryptographic primitive called signcryption effective...
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Ra...
SP
2009
IEEE
122views Security Privacy» more  SP 2009»
14 years 2 months ago
Plaintext Recovery Attacks against SSH
This paper presents a variety of plaintext-recovering attacks against SSH. We implemented a proof of concept of our attacks against OpenSSH, where we can veriļ¬ably recover 14 bi...
Martin R. Albrecht, Kenneth G. Paterson, Gaven J. ...
ASIACRYPT
2004
Springer
14 years 1 months ago
Generic Homomorphic Undeniable Signatures
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diļ¬...
Jean Monnerat, Serge Vaudenay
CRYPTO
2004
Springer
130views Cryptology» more  CRYPTO 2004»
14 years 1 months ago
Signature Schemes and Anonymous Credentials from Bilinear Maps
Abstract. We propose a new and eļ¬ƒcient signature scheme that is provably secure in the plain model. The security of our scheme is based on a discrete-logarithm-based assumption p...
Jan Camenisch, Anna Lysyanskaya
FSE
2003
Springer
115views Cryptology» more  FSE 2003»
14 years 25 days ago
OMAC: One-Key CBC MAC
In this paper, we present One-key CBC MAC (OMAC) and prove its security for arbitrary length messages. OMAC takes only one key, K (k bits) of a block cipher E. Previously, XCBC req...
Tetsu Iwata, Kaoru Kurosawa