1769 search results - page 207 / 354 » Cryptography |
135
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
The paper analyzes CFVZ, a new public key cryptosystem whose security is based on a matrix version of the discrete logarithm problem over an elliptic curve. It is shown that the co...
119
click to vote
DAM
2006
15 years 3 months ago
2006
The characterization of ideal access structures and the search for bounds on the optimal information rate are two important problems in secret sharing. These problems are studied ...
115
click to vote
ECCC
2006
15 years 3 months ago
2006
Abstract. This article points out a gap between two natural formulations of the concept of a proof of knowledge, and shows that in all natural cases (e.g., NP-statements) this gap ...
124
click to vote
IJNSEC
2008
15 years 3 months ago
2008
In 1949, Shannon proved the perfect secrecy of the Vernam cryptographic system (One-Time Pad or OTP). It has generally been believed that the perfectly random and uncompressible O...
153
Voted
IJNSEC
2008
15 years 3 months ago
2008
A new concept of society-oriented designated confirmer signatures (SDCS) is introduced in this paper. SDCS is well suited to applications where the capability of the signer and th...