Sciweavers

1190 search results - page 186 / 238
» Secure off-the-record messaging
Sort
View
ENTCS
2006
103views more  ENTCS 2006»
13 years 11 months ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström
IJNSEC
2008
143views more  IJNSEC 2008»
13 years 11 months ago
New Cryptanalysis Paradigm on a Nonce-based Mutual Authentication Scheme
In 2005, Lee, Kim, and Yoo proposed a nonce-based mutual authentication scheme using smart cards. However, this paper demonstrates that Lee-Kim-Yoo's scheme is vulnerable to ...
Da-Zhi Sun, Zhen-Fu Cao
IJNSEC
2006
107views more  IJNSEC 2006»
13 years 11 months ago
ID-based Signcryption Scheme with (t, n) Shared Unsigncryption
An identity-based signcryption scheme with (t, n) shared unsigncryption is proposed, which is the integration of the signcryption scheme, the (t, n) threshold scheme and zero know...
Fagen Li, Xiangjun Xin, Yupu Hu
IJNSEC
2006
67views more  IJNSEC 2006»
13 years 11 months ago
A Time-stamping Proxy Signature Scheme Using Time-stamping Service
In current proxy signature schemes, an original signer delegates her signing capability to a proxy signer, and then the proxy signer can sign messages on behalf of the original si...
Eric Jui-Lin Lu, Cheng-Jian Huang
IJSN
2006
96views more  IJSN 2006»
13 years 11 months ago
A new signature scheme without random oracles
In this paper, we propose a new signature scheme that is existentially unforgeable under a chosen message attack without random oracle. The security of our scheme depends on a new ...
Chik How Tan