1064 search results - page 90 / 213 » Cryptography from Anonymity |
172
click to vote
PKC
2007
Springer
15 years 10 months ago
2007
Springer
At PKC 2003 Paeng, Jung, and Ha proposed a lattice based public key cryptosystem(PJH). It is originated from GGH, and designed as a hybrid of GGH and NTRUEncrypt in order to reduce...
120
click to vote
PKC
2005
Springer
15 years 9 months ago
2005
Springer
To sign with RSA, one usually encodes the message m as µ(m) and then raises the result to the private exponent modulo N. In Asiacrypt 2000, Coron et al. showed how to build a secu...
128
click to vote
CHES
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. A novel technique for computing a 2n-bit modular multiplication using n-bit arithmetic was introduced at CHES 2002 by Fischer and Seifert. Their technique makes use of an...
157
click to vote
DICTA
2007
15 years 5 months ago
2007
Existing asymmetric encryption algorithms require the storage of the secret private key. Stored keys are often protected by poorly selected user passwords that can either be guess...
144
click to vote
EUROCRYPT
2009
Springer
16 years 4 months ago
2009
Springer
We consider information-theoretic key agreement between two parties sharing somewhat different versions of a secret w that has relatively little entropy. Such key agreement, also ...