Sciweavers

204 search results - page 13 / 41
» Provably Secure Metering Scheme
Sort
View
INDOCRYPT
2003
Springer
14 years 18 days ago
Stronger Security Bounds for OMAC, TMAC, and XCBC
OMAC, TMAC and XCBC are CBC-type MAC schemes which are provably secure for arbitrary message length. In this paper, we present a more tight upper bound on Advmac for each scheme, w...
Tetsu Iwata, Kaoru Kurosawa
CISC
2009
Springer
199views Cryptology» more  CISC 2009»
13 years 5 months ago
Cryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction without Pairing
Abstract. Certificateless cryptography introduced by Al-Riyami and Paterson eliminates the key escrow problem inherent in identity based cryptosystems. Even though building practic...
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Ra...
IACR
2011
120views more  IACR 2011»
12 years 7 months ago
McOE: A Foolproof On-Line Authenticated Encryption Scheme
On-Line Authenticated Encryption (OAE) combines confidentiality with data integrity and is on-line computable. Most block cipher-based schemes for Authenticated Encryption can be ...
Ewan Fleischmann, Christian Forler, Stefan Lucks
ASIACRYPT
2006
Springer
13 years 11 months ago
New Approach for Selectively Convertible Undeniable Signature Schemes
In this paper, we propose a new approach for constructing selectively convertible undeniable signature schemes, and present two efficient schemes based on RSA. Our approach allows ...
Kaoru Kurosawa, Tsuyoshi Takagi
PKC
2005
Springer
125views Cryptology» more  PKC 2005»
14 years 27 days ago
A Generic Scheme Based on Trapdoor One-Way Permutations with Signatures as Short as Possible
We answer the open question of the possibility of building a digital signature scheme with proven security based on the one-wayness of a trapdoor permutation and with signatures as...
Louis Granboulan