Integrating engineering model eliciting activities in elementary school curricula

This paper argues for a future-oriented, inclusion of Engineering Model Eliciting Activities (EngMEAs) in elementary mathematics curricula. In EngMEAs students work with meaningful engineering problems that capitalise on and extend their existing mathematics and science learning, to develop, revise and document powerful models, while working in groups. The models developed by six groups of 12-year students in solving the Natural Gas activity are presented. Results showed that student models adequately solved the problem, although student models did not take into account all the data provided. Student solutions varied to the extent students employed the engineering context in their models and to their understanding of the mathematical concepts involved in the problem. Finally, recommendations for implementing EngMEAs and for further research are discussed.

Complex Modelling in the Primary and Middle School Years : An Interdisciplinary Approach

The world’s increasing complexity, competitiveness, interconnectivity, and dependence on technology generate new challenges for nations and individuals that cannot be met by continuing education as usual. With the proliferation of complex systems have come new technologies for communication, collaboration, and conceptualisation. These technologies have led to signifi cant changes in the forms of mathematical and scientifi c thinking required beyond the classroom. Modelling, in its various forms, can develop and broaden students’ mathematical and scientific thinking beyond the standard curriculum. This chapter first considers future competencies in the mathematical sciences within an increasingly complex world. Consideration is then given to interdisciplinary problem solving and models and modelling, as one means of addressing these competencies. Illustrative case studies involving complex, interdisciplinary modelling activities in Years 1 and 7 are presented.

On the hardness of the sum of K mins problem

The sum of k mins protocol was proposed by Hopper and Blum as a protocol for secure human identification. The goal of the protocol is to let an unaided human securely authenticate to a remote server. The main ingredient of the protocol is the sum of k mins problem. The difficulty of solving this problem determines the security of the protocol. In this paper, we show that the sum of k mins problem is NP-Complete and W[1]-Hard. This latter notion relates to fixed parameter intractability. We also discuss the use of the sum of k mins protocol in resource-constrained devices.

Double-authentication-preventing signatures

Digital signatures are often used by trusted authorities to make unique bindings between a subject and a digital object; for example, certificate authorities certify a public key belongs to a domain name, and time-stamping authorities certify that a certain piece of information existed at a certain time. Traditional digital signature schemes however impose no uniqueness conditions, so a trusted authority could make multiple certifications for the same subject but different objects, be it intentionally, by accident, or following a (legal or illegal) coercion. We propose the notion of a double-authentication-preventing signature, in which a value to be signed is split into two parts: a subject and a message. If a signer ever signs two different messages for the same subject, enough information is revealed to allow anyone to compute valid signatures on behalf of the signer. This double-signature forgeability property discourages signers from misbehaving---a form of self-enforcement---and would give binding authorities like CAs some cryptographic arguments to resist legal coercion. We give a generic construction using a new type of trapdoor functions with extractability properties, which we show can be instantiated using the group of sign-agnostic quadratic residues modulo a Blum integer.

Double-authentication-preventing signatures

Digital signatures are often used by trusted authorities to make unique bindings between a subject and a digital object; for example, certificate authorities certify a public key belongs to a domain name, and time-stamping authorities certify that a certain piece of information existed at a certain time. Traditional digital signature schemes however impose no uniqueness conditions, so a trusted authority could make multiple certifications for the same subject but different objects, be it intentionally, by accident, or following a (legal or illegal) coercion. We propose the notion of a double-authentication-preventing signature, in which a value to be signed is split into two parts: a subject and a message. If a signer ever signs two different messages for the same subject, enough information is revealed to allow anyone to compute valid signatures on behalf of the signer. This double-signature forgeability property discourages signers from misbehaving—a form of self-enforcement—and would give binding authorities like CAs some cryptographic arguments to resist legal coercion. We give a generic construction using a new type of trapdoor functions with extractability properties, which we show can be instantiated using the group of sign-agnostic quadratic residues modulo a Blum integer; we show an additional application of these new extractable trapdoor functions to standard digital signatures.