Code-based cryptography is an interesting alternative to classic number-theory PKC since it is conjectured to be secure against quantum computer attacks. Many families of codes have been proposed for these cryptosystems, one of the main requirements is having high performance t-bounded decoding algorithms which in the case of having an error-correcting pair is achieved. In this article the clas...

Strongly conflict-avoiding codes are used in the asynchronous multiple-access collision channel without feedback. The number of codewords in a strongly conflict-avoiding code is the number of potential users that can be supported in the system. In this paper, an upper bound on the size of strongly conflictavoiding codes is proved. In addition, we provide an improved upper bound if the codes are...

For a recent student conference, the authors developed a day-long design problem and competition suitable for engineering, mathematics, and science undergraduates. The competition included a cryptography problem, for which a workshop was run during the conference. This paper describes the competition, focusing on the cryptography problem and the workshop. Notes from the workshop and code for th...

For the category of group codes, that generalizes the category of linear codes over a finite field, and with the generalized notions of direct sums and indecomposable group codes, we prove that every MDS non trivial code, every perfect non trivial code, and every constant weight nondegenerate group code are indecomposable. We prove that every group code is a direct sum of indecomposable group c...

Digital rights management is an important technique to protect digital contents from abuse. Usually it is confronted with severe challenges because of the untrusted environment its application executed in. This condition is formally described as white-box attack model. White-box cryptography aims at protecting software implementation of cryptographic algorithms from white-box attack, hence can ...

This paper proposed a novel reversible visual secret sharing method. Without any computing, if we stack two transparencies directly, a secret image will appear. Stacking two transparencies after reversing one of transparencies, another secret image will unveil. Different from traditional reversible visual cryptography, the method not only has advantages but also will not have pixel expansion an...

Message authentication codes (MACs) are an essential primitive in cryptography. They are used to ensure the integrity and authenticity of a message, and can also be used as a building block for larger schemes, such as chosenciphertext secure encryption, or identity-based encryption. MACs are often built in two steps: first, the ‘front end’ of the MAC produces a short digest of the long message,...

In a very simple form a Mobile Agent is an independent piece of code that has mobility and autonomy behavior. One of the main advantages of using Mobile Agent in a network is it reduces network traffic load. In an, ad hoc network Mobile Agent can be used to protect the network by using agent based IDS or IPS. Besides, to deploy dynamic software in the network or to retrieve information from net...

The increasing popularity of biometrics and cryptography is driven by the widespread stipulation on information security. Abundant efforts have been made in developing successful methods in these areas in order to accomplish an enhanced level of information security. There are two dominant issues in information security enhancement. One is to defend the user ownership and control the access to ...

Pairing-based Cryptography has enabled a wide range of cryptographic schemes. This work discusses these schemes in the context of wireless sensor networks. To our knowledge, ours is the first work to address this subject.