Displaying similar documents to “Codes, languages and MOL schemes”

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...

Decidability of code properties

Henning Fernau, Klaus Reinhardt, Ludwig Staiger (2007)

RAIRO - Theoretical Informatics and Applications

Similarity:

We explore the borderline between decidability and undecidability of the following question: “Let be a class of codes. Given a machine 𝔐 of type , is it decidable whether the language L ( 𝔐 ) lies in or not?” for codes in general, -codes, codes of finite and bounded deciphering delay, prefix, suffix and bi(pre)fix codes, and for finite automata equipped with different versions of push-down stores and counters.

A property of biprefix codes

Martine Leonard (1988)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

On coding morphisms for zigzag codes

Do Long Van, Bertrand Le Saëc, Igor Litovsky (1992)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

On a class of infinitary codes

Nguyen Huong Lâm, Do Long Van (1990)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity: