Experiences In The Development Of A Computer Networking Course

Comunicació presentada a EDULEARN2019, 11th International Conference on Education and New Learning Technologies (July 1-3, 2019, Palma, Mallorca, Spain).The degree in Computational Mathematics Universitat Jaume I (UJI) of Castellón, Spain, is a degree that offers a training that unites mathematics with computer science and focuses on areas where both are very relevant. The graduate in this degree have a mixed profile because it combines a theoretical training, typical of a pure degree in mathematics, with the technical training of a pure degree in computer science. This mixed profile make them very versatile, that is, with the ability to perform different types of tasks and have a high rate of employment. On the other hand, their capacity for analysis and abstraction will allow them to adapt very easily to any change and innovation. This degree is composed by different courses. One of these courses is the introduction to computer networking course. Computer networks allow its users to communicate and share information regardless of the geographic distance between them. Ensuring the optimal operation of computer networks is no easy task, and there is a necessity of highly trained professionals with a solid knowledge of network planning, design, and configuration, as well as the capacity to address the different and complex connectivity and security requirements. The computer networking course provides students with the fundamental concepts of computer networks along with training to acquire the basic skills necessary to solve the various technical problems of the world of computer networks. The aim of this paper is to show the methodology and learning solutions used to train the students to to plan flexible, scalable computer networking systems for a business or organization of virtually any size. Paper shows the course objectives, the target competencies, the course contents, the assessments, and how the technology resources for e-learning are used to teach the subject

The Net Generation enters university: What are the implications for Technology Enhanced Learning?

The term Net generation suggests that the generation of young people born after 1983 are different from any preceding generation because they have been exposed to digital technology in their day-to-day existence, and that this is has a profound impact on their attitudes and approach to learning. Examining the use of the terms Net generation and Digital Natives this paper reports a survey of first year undergraduate students in the UK. This paper, based on research conducted in the spring of 2008 examines whether there is a distinct Net generation amongst first year UK university students and if there are significant differences attributable to age, gender or disciplinary differences. It concludes that whilst there are significant changes taking place amongst first year undergraduate students in the UK they are far more complex than the idea of a single new generation would suggest

Education and outreach activities within the biological weapons convention

No description supplie

How to reuse a one-time pad and other notes on authentication, encryption and protection of quantum information

Quantum information is a valuable resource which can be encrypted in order to protect it. We consider the size of the one-time pad that is needed to protect quantum information in a number of cases. The situation is dramatically different from the classical case: we prove that one can recycle the one-time pad without compromising security. The protocol for recycling relies on detecting whether eavesdropping has occurred, and further relies on the fact that information contained in the encrypted quantum state cannot be fully accessed. We prove the security of recycling rates when authentication of quantum states is accepted, and when it is rejected. We note that recycling schemes respect a general law of cryptography which we prove relating the size of private keys, sent qubits, and encrypted messages. We discuss applications for encryption of quantum information in light of the resources needed for teleportation. Potential uses include the protection of resources such as entanglement and the memory of quantum computers. We also introduce another application: encrypted secret sharing and find that one can even reuse the private key that is used to encrypt a classical message. In a number of cases, one finds that the amount of private key needed for authentication or protection is smaller than in the general case.Comment: 13 pages, improved rate of recycling proved in the case of rejection of authenticatio

ROPocop - Dynamic Mitigation of Code-Reuse Attacks

Control-flow attacks, usually achieved by exploiting a buffer-overflow vulnerability, have been a serious threat to system security for over fifteen years. Researchers have answered the threat with various mitigation techniques, but nevertheless, new exploits that successfully bypass these technologies still appear on a regular basis. In this paper, we propose ROPocop, a novel approach for detecting and preventing the execution of injected code and for mitigating code-reuse attacks such as return-oriented programming (RoP). ROPocop uses dynamic binary instrumentation, requiring neither access to source code nor debug symbols or changes to the operating system. It mitigates attacks by both monitoring the program counter at potentially dangerous points and by detecting suspicious program flows. We have implemented ROPocop for Windows x86 using PIN, a dynamic program instrumentation framework from Intel. Benchmarks using the SPEC CPU2006 suite show an average overhead of 2.4x, which is comparable to similar approaches, which give weaker guarantees. Real-world applications show only an initially noticeable input lag and no stutter. In our evaluation our tool successfully detected all 11 of the latest real-world code-reuse exploits, with no false alarms. Therefore, despite the overhead, it is a viable, temporary solution to secure critical systems against exploits if a vendor patch is not yet available

Certainty and Uncertainty in Quantum Information Processing

This survey, aimed at information processing researchers, highlights intriguing but lesser known results, corrects misconceptions, and suggests research areas. Themes include: certainty in quantum algorithms; the "fewer worlds" theory of quantum mechanics; quantum learning; probability theory versus quantum mechanics.Comment: Invited paper accompanying invited talk to AAAI Spring Symposium 2007. Comments, corrections, and suggestions would be most welcom

A Prisoners\u27 Island: Teaching Australian Incarcerated Students in the Digital Age

While incarcerated students have always faced many obstacles to full and effective participation in university study, the global shift toward paperless e-learning environments has created new challenges for prisoners without direct internet access. Based on prison focus groups with Australian incarcerated students and direct participant observation while tutoring tertiary students within four Queensland correctional centres, this paper explores the obstacles and constraints faced by incarcerated students in light of the increasing digitisation of materials and methods in higher education. This paper also reviews the outcomes, limitations and challenges of recent Australian projects trialling new internet-independent technologies developed to improve access for incarcerated tertiary students. This paper argues that technology-centred approaches alone will not adequately address the challenges of access for incarcerated students unless such interventions are also informed by an understanding of the sociocultural nature of learning and teaching within correctional centres

Conditionals in Homomorphic Encryption and Machine Learning Applications

Homomorphic encryption aims at allowing computations on encrypted data without decryption other than that of the final result. This could provide an elegant solution to the issue of privacy preservation in data-based applications, such as those using machine learning, but several open issues hamper this plan. In this work we assess the possibility for homomorphic encryption to fully implement its program without relying on other techniques, such as multiparty computation (SMPC), which may be impossible in many use cases (for instance due to the high level of communication required). We proceed in two steps: i) on the basis of the structured program theorem (Bohm-Jacopini theorem) we identify the relevant minimal set of operations homomorphic encryption must be able to perform to implement any algorithm; and ii) we analyse the possibility to solve -- and propose an implementation for -- the most fundamentally relevant issue as it emerges from our analysis, that is, the implementation of conditionals (requiring comparison and selection/jump operations). We show how this issue clashes with the fundamental requirements of homomorphic encryption and could represent a drawback for its use as a complete solution for privacy preservation in data-based applications, in particular machine learning ones. Our approach for comparisons is novel and entirely embedded in homomorphic encryption, while previous studies relied on other techniques, such as SMPC, demanding high level of communication among parties, and decryption of intermediate results from data-owners. Our protocol is also provably safe (sharing the same safety as the homomorphic encryption schemes), differently from other techniques such as Order-Preserving/Revealing-Encryption (OPE/ORE).Comment: 14 pages, 1 figure, corrected typos, added introductory pedagogical section on polynomial approximatio

Anglo-Dutch premium auctions in eighteenth-century Amsterdam

An Anglo-Dutch premium auction consists of an English auction followed by a Dutch auction, with a cash premium paid to the winner of the first round. We study such auctions used in the secondary debt market in eighteenth-century Amsterdam. This was among the first uses of auctions, or any structured market-clearing mechanism, in a financial market. We find that this market presented two distinct challenges - generating competition and aggregating information. We argue that the Anglo-Dutch premium auction is particularly well-suited to do both. Modeling equilibrium play theoretically, we predict a positive relationship between the uncertainty in a security's value and the likelihood of a second-round bid. Analyzing data on 16,854 securities sold in the late 1700s, we find empirical support for this prediction. This suggests that bidding behavior may have been consistent with (non-cooperative) equilibrium play, and therefore that these auctions were successful at generating competition. We also find evidence suggesting that these auctions succeeded at aggregating information. Thus, the Anglo-Dutch premium auction appears to have been an effective solution to a complex early market design problem