Sciweavers

2601 search results - page 123 / 521
» Secure Rewarding Schemes
Sort
View
ACISP
2000
Springer
15 years 7 months ago
Cryptanalysis of the m-Permutation Protection Schemes
Anderson and Kuhn have proposed the EEPROM modification attack to recover the secret key stored in the EEPROM. At ACISP'98, Fung and Gray proposed an −m permutation protecti...
Hongjun Wu, Feng Bao, Dingfeng Ye, Robert H. Deng
IJACT
2008
158views more  IJACT 2008»
15 years 3 months ago
Efficient lattice-based signature scheme
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...
Thomas Plantard, Willy Susilo, Khin Than Win, Qion...
WISTP
2007
Springer
15 years 9 months ago
Linkability of Some Blind Signature Schemes
Unforgeability and blindness are two important properties of blind signature. The latter means that after interacting with various users, the signer is unable to link a valid messa...
Swee-Huay Heng, Wun-She Yap, Khoongming Khoo
ACISP
2005
Springer
15 years 8 months ago
Group Signature Schemes with Membership Revocation for Large Groups
Group signature schemes with membership revocation have been intensively researched. However, signing and/or verification of some existing schemes have computational costs of O(R)...
Toru Nakanishi, Fumiaki Kubooka, Naoto Hamada, Nob...
MOC
2010
14 years 10 months ago
Error bound between monotone difference schemes and their modified equations
It is widely believed that if monotone difference schemes are applied to the linear convection equation with discontinuous initial data, then solutions of the monotone schemes are ...
Zhen-Huan Teng