292 search results - page 14 / 59 » Communication and Round Efficient Information Checking Proto... |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
ICWN
2009
13 years 5 months ago
2009
Abstract-- The reliable delivery of services in service oriented architectures often entails the underlying basis of having well structured system and communication network models....
CN
2004
13 years 7 months ago
2004
In secure group communications, a key server can deliver a "grouporiented" rekey message [22] to a large number of users efficiently using multicast. For reliable delive...
CRYPTO
1994
Springer
13 years 11 months ago
1994
Springer
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S...
CTRSA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Camellia and MISTY1 are Feistel block ciphers. In this paper, we observe that, when conducting impossible differential cryptanalysis on Camellia and MISTY1, their round s...