221 search results - page 10 / 45 » Secure Public Instant Messaging |
CRYPTO
2011
Springer
12 years 7 months ago
2011
Springer
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security (quantumly) reduces to the worst-case hardness of problems ...
EUROCRYPT
2001
Springer
14 years 5 days ago
2001
Springer
NTRU is a fast public key cryptosystem presented in 1996 by Hoffstein, Pipher and Silverman of Brown University. It operates in the ring of polynomials Z[X]/(XN − 1), where the ...
CRYPTO
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we introduce the notion of a Public-Key Encryption Scheme that is also a Locally-Decodable Error-Correcting Code (PKLDC). In particular, we allow any polynomialtime ...
CCS
2003
ACM
14 years 27 days ago
2003
ACM
We describe a new method for protecting the anonymity of message receivers in an untrusted network. Surprisingly, existing methods fail to provide the required level of anonymity ...
PKC
2012
Springer
11 years 10 months ago
2012
Springer
In this work, we study a new multivariate quadratic (MQ) assumption that can be used to construct public-key encryption schemes. In particular, we research in the following two di...