The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Covering codes for Hats-on-a-line.”

Codes that attain minimum distance in every possible direction

Gyula Katona, Attila Sali, Klaus-Dieter Schewe (2008)

Open Mathematics

Similarity:

The following problem motivated by investigation of databases is studied. Let 𝒞 be a q-ary code of length n with the properties that 𝒞 has minimum distance at least n − k + 1, and for any set of k − 1 coordinates there exist two codewords that agree exactly there. Let f(q, k)be the maximum n for which such a code exists. f(q, k)is bounded by linear functions of k and q, and the exact values for special k and qare determined.

Guessing secrets.

Chung, Fan, Graham, Ronald, Leighton, Tom (2001)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited

Zhengan Huang, Shengli Liu, Baodong Qin, Kefei Chen (2015)

International Journal of Applied Mathematics and Computer Science

Similarity:

Fehr et al. (2010) proposed the first sender-equivocable encryption scheme secure against chosen-ciphertext attacks (NCCCA) and proved that NC-CCA security implies security against selective opening chosen-ciphertext attacks (SO-CCA). The NC-CCA security proof of the scheme relies on security against substitution attacks of a new primitive, the “crossauthentication code”. However, the security of the cross-authentication code cannot be guaranteed when all the keys used in the code are...