Sciweavers

26 search results - page 2 / 6
» Forgery of Provable Secure Short Signcryption Scheme
Sort
View
CISC
2009
Springer
199views Cryptology» more  CISC 2009»
13 years 3 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...
PKC
2005
Springer
125views Cryptology» more  PKC 2005»
13 years 11 months 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
AINA
2005
IEEE
13 years 11 months ago
Reducing Security Overhead for Mobile Networks
Security of mobile communications comes with the cost of computational overhead. Reducing the overhead in security computations is critical to ensure the overall performance of a ...
Fangguo Zhang, Yi Mu, Willy Susilo
INFORMATICALT
2007
109views more  INFORMATICALT 2007»
13 years 5 months ago
A Secure YS-Like User Authentication Scheme
Abstract. Recently, there are several articles proposed based on Yang and Shieh’s password authentication schemes (YS for short) with the following features: (1) A user can choos...
Tzungher Chen, Gwoboa Horng, Ke-Chiang Wu
ACNS
2008
Springer
132views Cryptology» more  ACNS 2008»
13 years 12 months ago
Generic Security-Amplifying Methods of Ordinary Digital Signatures
We describe two new paradigms on how to obtain ordinary signatures that are secure against existential forgery under adaptively chosen message attacks (fully-secure, in short), fro...
Jin Li, Kwangjo Kim, Fangguo Zhang, Duncan S. Wong