51 search results - page 6 / 11 » asiacrypt 2000 |
ASIACRYPT
2000
Springer
14 years 1 months ago
2000
Springer
In 1980 Hellman introduced a general technique for breaking arbitrary block ciphers with N possible keys in time T and memory M related by the tradeoff curve TM2 = N2 for 1 T N. ...
ASIACRYPT
2000
Springer
14 years 1 months ago
2000
Springer
This paper takes a closer look at Rivest's chaffing-and-winnowing paradigm for data privacy. We begin with a definition which enables one to clearly determine whether a given ...
ASIACRYPT
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. We introduce weaker models for non-interactive zero knowledge, in which the dealer is not restricted to deal a truly random string and may also have access to the input t...
ASIACRYPT
2000
Springer
14 years 2 months ago
2000
Springer
A MIX net takes a list of ciphertexts (c1, · · · , cN ) and outputs a permuted list of the plaintexts (m1, · · · , mN ) without revealing the relationship between (c1, · · ...
ASIACRYPT
2000
Springer
14 years 2 months ago
2000
Springer
A common practice for signing with RSA is to first apply a hash function or a redundancy function to the message, add some padding and exponentiate the resulting padded message us...