Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 13 of 13
Full-Text Articles in Physical Sciences and Mathematics
Construction Of Universal Designated-Verifier Signatures And Identity-Based Signatures From Standard Signatures, Siamak Fayyaz Shahandashti, Reihaneh Safavi-Naini
Construction Of Universal Designated-Verifier Signatures And Identity-Based Signatures From Standard Signatures, Siamak Fayyaz Shahandashti, Reihaneh Safavi-Naini
Faculty of Informatics - Papers (Archive)
We give a generic construction for universal designated-verifier signature schemes from a large class, C, of signature schemes. The resulting schemes are efficient and have two important properties. Firstly, they are provably DV-unforgeable, non-transferable and also non-delegatable. Secondly, the signer and the designated verifier can independently choose their cryptographic settings. We also propose a generic construction for identity-based signature schemes from any signature scheme in C and prove that the construction is secure against adaptive chosen message and identity attacks. We discuss possible extensions of our constructions to universal multi-designated-verifier signatures, hierarchical identity-based signatures, identity-based universal designated verifier signatures, and …
Becoming Multiliterate: Digital Video News Construction Within A Technology-Supported Learning Environment, Lori Lockyer, Ian M. Brown, David Blackall, Barry M. Harper, Phillip J. Mckerrow
Becoming Multiliterate: Digital Video News Construction Within A Technology-Supported Learning Environment, Lori Lockyer, Ian M. Brown, David Blackall, Barry M. Harper, Phillip J. Mckerrow
Faculty of Informatics - Papers (Archive)
Twenty-first century literacies imply multiliteracies – going beyond language literacy and numeracy to, among others, information, visual, media and technological literacies. An education that develops capabilities across a range of literacies equips young people with the skills necessary to participate in a complex, globalized workplace and community. A key step toward realizing such national and state education agendas is specific curriculum interventions that are translated to the classroom level. This paper reports on a case study that explored both the process and outcomes of the implementation of an education program which was designed to incorporate multiliteracies.
Generic Construction Of (Identity-Based) Perfect Concurrent Signatures, Sherman S. M. Chow, Willy Susilo
Generic Construction Of (Identity-Based) Perfect Concurrent Signatures, Sherman S. M. Chow, Willy Susilo
Faculty of Informatics - Papers (Archive)
The notion of concurrent signatures was recently introduced by Chen, Kudla and Paterson. In concurrent signature schemes, two entities can produce two signatures that are not binding, until one of the parties releases an extra piece of information (namely the keystone). Subsequently, it was noted that the concurrent signature scheme proposed in the seminal paper cannot provide perfect ambiguity. Then, the notion of perfect concurrent signatures was introduced. In this paper, we define the notion of identity-based (or ID-based) perfect concurrent signature schemes. We provide the first generic construction of (ID-based) perfect concurrent signature schemes from ring signature schemes. …
Generalized Orthogonal Designs, S. Georgiou, C. Koukouvinos, Jennifer Seberry
Generalized Orthogonal Designs, S. Georgiou, C. Koukouvinos, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
Orthogonal designs and their special cases such as weighing matrices and Hadamard matrices have many applications in combinatorics, statistics, and coding theory as well as in signal processing. In this paper we generalize the definition of orthogonal designs, we give many constructions for these designs and we prove some multiplication theorems that, most of them, can also be applied in the special case of orthogonal designs. Some necessary conditions for the existence of generalized orthogonal designs are also given.
Some Results On Self-Orthogonal And Self-Dual Codes, S. Georgiou, C. Koukouvinos, Jennifer Seberry
Some Results On Self-Orthogonal And Self-Dual Codes, S. Georgiou, C. Koukouvinos, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
We use generator matrices G satisfying GGT = aI+bJ over Zk to obtain linear self-orthogonal and self-dual codes. We give a new family of linear self-orthogonal codes over GF(3) and Z4 and a new family of linear self-dual codes over GF(3).
On Full Orthogonal Designs In Order 72, S. Georgiou, C. Koukouvinos, Jennifer Seberry
On Full Orthogonal Designs In Order 72, S. Georgiou, C. Koukouvinos, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
We find new full orthogonal designs in order 72 and show that of 2700 possible OD(72; s1, s2, s3, 72—s1—s2—s3) 335 are known, of 432 possible OD(72; s1, s2, 72—si—s2) 308 are known. All possible OD(72; s1, 72 — s1) are known.
Necessary And Sufficient Conditions For Three And Four Variable Orthogonal Designs In Order 36, S. Georgiou, C. Koukouvinos, M. Mitrouli, Jennifer Seberry
Necessary And Sufficient Conditions For Three And Four Variable Orthogonal Designs In Order 36, S. Georgiou, C. Koukouvinos, M. Mitrouli, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
We use a new algorithm to find new sets of sequences with entries from {0, ±a, ±b, ±c, ±d}, on the commuting variables a, b, c, d, with zero autocorrelation function. Then we use these sequences to construct a series of new three and four variable orthogonal designs in order 36. We show that the necessary conditions plus (.s1, s2, s3, s4) not equal to 12816 18 816 221313 26721 36 816 4889 12825 191313 23 424 289 9 381015 8899 14425 22 916 are sufficient for the existence of an OD(36; s1, s2 s3, s4) constructed using four circulant …
On Amicable Sequences And Orthogonal Designs, S. Georgiou, C. Koukouvinos, Jennifer Seberry
On Amicable Sequences And Orthogonal Designs, S. Georgiou, C. Koukouvinos, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
In this paper we give a general theorem which can be used to multiply the length of amicable sequences keeping the amicability property and the type of the sequences. As a consequence we have that if there exist two, four or eight amicable sequences of length m and type (al, a2), (al, a2, a3, a4) or (al, a2, ... , a8) then there exist amicable sequences of length ℓ ≡ 0 (mod m) and of the same type. We also present a theorem that produces a set of 2v amicable sequences from a set of v (not necessary amicable) sequences …
Necessary And Sufficient Conditions For Two Variable Orthogonal Designs In Order 44: Addendum, S. Georgiou, C. Koukouvinos, M. Mitrouli, Jennifer Seberry
Necessary And Sufficient Conditions For Two Variable Orthogonal Designs In Order 44: Addendum, S. Georgiou, C. Koukouvinos, M. Mitrouli, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
In our recent paper Necessary and sufficient conditions for some two variable orthogonal designs in order 44, Koukouvinos, Mitrouli and Seberry leave 7 cases unresolved. Using a new algorithm given in our paper A new algorithm for computer searches for orthogonal designs by the present four authors we are able to finally resolve all these cases. This note records that the necessary conditions for the existence of two variable designs constructed using four circulant matrices are sufficient. In particular of 484 potential cases 404 cases have been found, 68 cases do not exist and 12 cases cannot be constructed using …
New Orthogonal Designs And Sequences With Two And Three Variables In Order 28, C. Koukouvinos, Jennifer Seberry
New Orthogonal Designs And Sequences With Two And Three Variables In Order 28, C. Koukouvinos, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
We give new sets of sequences with entries from {0, ±a, ±b, ±c} on the commuting variables a, b, c and zero autocorrelation function. Then we use these sequences to construct some new orthogonal de-signs. We show the necessary conditions for the existence of an OD(28; s1, s2, s3) plus the condition that (s1, s2, s3) ≠ (1,5,20) are sufficient conditions for the existence of an OD(28; s1, s2, s3). We also show the necessary conditions for the existence of an OD(28; s1, s2, s3) constructed using four circulant matrices are sufficient conditions for the existence of 4 — NPAF(s1, …
When The Necessary Conditions Are Not Sufficient: Sequences With Zero Autocorrelation Function, J. Horton, Jennifer Seberry
When The Necessary Conditions Are Not Sufficient: Sequences With Zero Autocorrelation Function, J. Horton, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
Recently K. T. Arasu (personal communication) and Yoseph Strassler, in his PhD thesis, The Classification of Circulant Weighing Matrices of Weight 9, Bar-Ilan University, Ramat-Gan, 1997, have intensively studied circulant weighing matrices, or single sequences, with weight 9. They show many cases are non-existent. Here we give details of a search for two sequences with zero periodic autocorrelation and types (1,9), (1,16) and (4,9). We find some new cases but also many cases where the known necessary conditions are not sufficient. We instance a number of occasions when the known necessary conditions are not sufficient for the existence of weighing …
New Weighing Matrices And Orthogonal Designs Constructed Using Two Sequences With Zero Autocorrelation Function - A Review, C. Koukouvinos, Jennifer Seberry
New Weighing Matrices And Orthogonal Designs Constructed Using Two Sequences With Zero Autocorrelation Function - A Review, C. Koukouvinos, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
The book, Orthogonal Designs: Quadratic Forms and Hadamard Matrices, Marcel Dekker, New York-Basel, 1979, by A. V. Geramita and Jennifer Seberry, has now been out of print for almost two decades. Many of the results on weighing matrices presented therein have been greatly improved. Here we review the theory, restate some results which are no longer available and expand on the existence of many new weighing matrices and orthogonal designs of order 2n where n is odd. We give a number of new constructions for orthogonal designs. Then using number theory, linear algebra and computer searches we find new weighing …
Necessary And Sufficient Conditions For Some Two Variable Orthogonal Designs In Order 44, C. Koukouvinos, M. Mitrouli, Jennifer Seberry
Necessary And Sufficient Conditions For Some Two Variable Orthogonal Designs In Order 44, C. Koukouvinos, M. Mitrouli, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
We give a new algorithm which allows us to construct new sets of sequences with entries from the commuting variables 0, ± a, ± b, ± c, ± d with zero autocorrelation function. We show that for twelve cases if the designs exist they cannot be constracted using four circulant matrices in the Goethals-Seidel array. Further we show that the necessary conditions for the existence of an OD(44; s1, s2) are sufficient except possibly for the following 7 cases: (7, 32) (8, 31), (9, 30) (9, 33) (11,30) (13, 29) (15, 26) which could not be found because of the …