227 search results - page 33 / 46 » On the Reachability Problem in Cryptographic Protocols |
ASIACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Secure multi-party computation has been considered by the cryptographic community for a number of years. Until recently it has been a purely theoretical area, with few im...
CNSR
2010
IEEE
13 years 11 months ago
2010
IEEE
We address security solutions to protect the communication of the wireless components of a home health care system. We analyze especially the problem of exchanging secrets to sati...
ISCI
2008
13 years 7 months ago
2008
In this paper, we present the first certificateless undeniable signature scheme. The scheme does not suffer from the key escrow problem, which is inherent in identity based crypto...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Let G1 be a cyclic multiplicative group of order n. It is known that the Diffie-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if (n) is known....
JOC
2000
13 years 7 months ago
2000
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...