Sciweavers

2601 search results - page 179 / 521
» Secure Rewarding Schemes
Sort
View
ACSAC
2000
IEEE
15 years 7 months ago
Personal Security Environment on Palm PDA
Digital signature schemes are based on the assumption that the signing key is kept in secret. Ensuring that this assumption holds is one of the most crucial problems for all curre...
Margus Freudenthal, S. Heiberg, Jan Willemson
ASIACRYPT
2000
Springer
15 years 7 months ago
Security of Signed ElGamal Encryption
Assuming a cryptographically strong cyclic group G of prime order q and a random hash function H, we show that ElGamal encryption with an added Schnorr signature is secure against ...
Claus-Peter Schnorr, Markus Jakobsson
IJNSEC
2006
132views more  IJNSEC 2006»
15 years 3 months ago
A Fast Semantically Secure Public Key Cryptosystem Based on Factoring
The cryptosystem proposed by Koyama is not semantically secure. Also, it is not secure against partial known plaintext attack, linearly related plaintext attack and low exponent a...
Sahadeo Padhye, Birendra Kumar Sharma
IJNSEC
2008
107views more  IJNSEC 2008»
15 years 3 months ago
Short Designated Verifier Signature Scheme and Its Identity-based Variant
The notion of strong designated verifier signature was put forth by Jakobsson, Sako and Impagliazzo in 1996, but the formal definition was defined recently by Saeednia, Kremer and...
Xinyi Huang, Willy Susilo, Yi Mu, Futai Zhang
IJNSEC
2006
113views more  IJNSEC 2006»
15 years 3 months ago
An Identity-based Mediated Signature Scheme from Bilinear Pairing
It has always been a critical issue to find efficient methods for fast revocation of a user's identity in identity (ID)based cryptosystems. Unfortunately, none of the previou...
Xiangguo Cheng, Lifeng Guo, Xinmei Wang