Codes, Cryptology, and Information Security

The laws of quantum physics allow the design of cryptographic protocols for which the security is based on physical principles. The main cryptographic quantum protocols are key distribution schemes, in which two parties generate a shared random secret string. The privacy of the key can be checked using Bell inequalities. However, the Bell inequalities initial purpose was a fundamental one, as they showed how quantum rules are incompatible with our intuition of reality. This paper begins with an introduction about quantum information theory, Bell inequalities, quantum cryptography. Then it presents the use of qudits for Bell inequalities and cryptography. Securing the Web of Things with Role-Based Access Control Ezedine Barka, Sujith Samuel Mathew, and Yacine Atif College of IT, UAE University, Al Ain, UAE ebarka@uaeu.ac.ae Abstract. Real-world things are increasingly becoming fully qualified members of the Web. From, pacemakers and medical records to children’s toys and sneakers, things are connected over the Web and publish information that is available for the whole world to see. It is crucial that there is secure access to this Web of Things (WoT) and to the related information published by things on the Web. In this paper, we introduce an architecture that encompasses Web-enabled things in a secure and scalable manner. Our architecture utilizes the features of the wellknown role-based access control (RBAC) to specify the access control policies to the WoT, and we use cryptographic keys to enforce such policies. This approach enables prescribers to WoT services to control who can access what things and how access can continue or should terminate, thereby enabling privacy and security of large amount of data that these things are poised to flood the future Web with. Real-world things are increasingly becoming fully qualified members of the Web. From, pacemakers and medical records to children’s toys and sneakers, things are connected over the Web and publish information that is available for the whole world to see. It is crucial that there is secure access to this Web of Things (WoT) and to the related information published by things on the Web. In this paper, we introduce an architecture that encompasses Web-enabled things in a secure and scalable manner. Our architecture utilizes the features of the wellknown role-based access control (RBAC) to specify the access control policies to the WoT, and we use cryptographic keys to enforce such policies. This approach enables prescribers to WoT services to control who can access what things and how access can continue or should terminate, thereby enabling privacy and security of large amount of data that these things are poised to flood the future Web with. On the Security of Long-Lived Archiving Systems Based on the Evidence Record Syntax Matthias Geihs, Denise Demirel, and Johannes Buchmann Technische Universität Darmstadt, University in Darmstadt, Germany mgeihs@cdc.informatik.tu-darmstadt.de Abstract. The amount of security critical data that is only available in digital form is increasing constantly. The Evidence Record Syntax Specification (ERS) achieves very efficiently important security goals: integrity, authenticity, datedness, and non-repudiation. This paper supports the trustworthiness of ERS by proving ERS secure. This is done in a model presented by Canetti et al. that these authors used to establish the long-term security of the Content Integrity Service (CIS). CIS achieves the same goals as ERS but is much less efficient. We also discuss the model of Canetti et al. and propose new directions of research. The amount of security critical data that is only available in digital form is increasing constantly. The Evidence Record Syntax Specification (ERS) achieves very efficiently important security goals: integrity, authenticity, datedness, and non-repudiation. This paper supports the trustworthiness of ERS by proving ERS secure. This is done in a model presented by Canetti et al. that these authors used to establish the long-term security of the Content Integrity Service (CIS). CIS achieves the same goals as ERS but is much less efficient. We also discuss the model of Canetti et al. and propose new directions of research. Differential Attacks Against SPN: A Thorough Analysis Anne Canteaut and Joëlle Roué Inria, project-team SECRET, Rocquencourt, France {Anne.Canteaut,Joelle.Roue}@inria.fr Abstract. This work aims at determining when the two-round maximum expected differential probability in an SPN with an MDS diffusion layer is achieved by a differential having the fewest possible active Sboxes. This question arises from the fact that minimum-weight differentials include the best differentials for the AES and several variants. However, we exhibit some SPN for which the tworound MEDP is achieved by some differentials involving a number of active Sboxes which exceeds the branch number of the linear layer. On the other hand, we also prove that, for some particular families of Sboxes, the two-round MEDP is always achieved for minimum-weight differentials. This work aims at determining when the two-round maximum expected differential probability in an SPN with an MDS diffusion layer is achieved by a differential having the fewest possible active Sboxes. This question arises from the fact that minimum-weight differentials include the best differentials for the AES and several variants. However, we exhibit some SPN for which the tworound MEDP is achieved by some differentials involving a number of active Sboxes which exceeds the branch number of the linear layer. On the other hand, we also prove that, for some particular families of Sboxes, the two-round MEDP is always achieved for minimum-weight differentials. On the Properties of Vectorial Functions with Plateaued Components and Their Consequences on APN Functions