221 search results - page 7 / 45 » Secure Public Instant Messaging |
APPROX
2011
Springer
12 years 7 months ago
2011
Springer
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
AMC
2005
13 years 7 months ago
2005
A convertible authenticated encryption scheme allows a designated receiver to recover and verify a message simultaneously, during which the recipient can prove the dishonesty of t...
CISC
2007
Springer
13 years 11 months ago
2007
Springer
Public key encryption with keyword search (PEKS) enables user Alice to send a secret key TW to a server that will enable the server to locate all encrypted messages containing the...
CCS
2006
ACM
13 years 11 months ago
2006
ACM
We propose an integrated process for component-based system development and security risk analysis. The integrated process is evaluated in a case study involving an instant messag...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptogra...