Jennifer Seberry

According to our database1, Jennifer Seberry authored at least 174 papers between 1975 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
A multistage protocol for aggregated queries in distributed cloud databases with privacy protection.
Future Generation Comp. Syst., 2019

2018
Discrete algorithms and methods for security of statistical databases related to the work of Mirka Miller.
J. Discrete Algorithms, 2018

2017
Combinatorial Algorithms and Methods for Security of Statistical Databases Related to the Work of Mirka Miller.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

A Construction for 0, 1, -1 Orthogonal Matrices Visualized.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

2015
Adaptively Secure Identity-Based Broadcast Encryption With a Constant-Sized Ciphertext.
IEEE Trans. Information Forensics and Security, 2015

2014
Efficient authentication and integrity protection for the border gateway protocol.
IJSN, 2014

2013
Some new constructions of orthogonal designs.
Australasian J. Combinatorics, 2013

Strongly amicable orthogonal designs and amicable Hadamard matrices.
Australasian J. Combinatorics, 2013

Efficient Semi-static Secure Broadcast Encryption Scheme.
Proceedings of the Pairing-Based Cryptography - Pairing 2013, 2013

The Impact of Number Theory and Computer-Aided Mathematics on Solving the Hadamard Matrix Conjecture.
Proceedings of the Number Theory and Related Fields, In Memory of Alf van der Poorten, 2013

2012
New weighing matrices constructed from two circulant submatrices.
Optimization Letters, 2012

Some Constructions of Mutually Orthogonal Latin Squares and Superimposed Codes.
Discrete Math., Alg. and Appl., 2012

On crystal sets.
Australasian J. Combinatorics, 2012

Fault Analysis of the KATAN Family of Block Ciphers.
Proceedings of the Information Security Practice and Experience, 2012

2011
A new generic digital signature algorithm.
Groups Complexity Cryptology, 2011

The amicable-Kronecker construction of quaternion orthogonal designs.
Australasian J. Combinatorics, 2011

Repeated Differential Properties of the AES-128 and AES-256 Key Schedules.
Proceedings of the IEEE 10th International Conference on Trust, 2011

Extended cubes: enhancing the cube attack by extracting low-degree non-linear equations.
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security, 2011

2010
Some remarks on Hadamard matrices.
Cryptography and Communications, 2010

New classes of orthogonal designs constructed from complementary sequences with given spread.
Australasian J. Combinatorics, 2010

On circulant and two-circulant weighing matrices.
Australasian J. Combinatorics, 2010

Differential Fault Analysis of LEX.
Proceedings of the Security and Cryptography for Networks, 7th International Conference, 2010

On the Security of NOEKEON against Side Channel Cube Attacks.
Proceedings of the Information Security, 2010

Inter-Domain Routing Validator Based Spoofing Defence System.
Proceedings of the IEEE International Conference on Intelligence and Security Informatics, 2010

2009
Novel constructions of improved square complex orthogonal designs for eight transmit antennas.
IEEE Trans. Information Theory, 2009

A five-round algebraic property of AES and its application to the ALPHA-MAC.
IJACT, 2009

Construction of amicable orthogonal design.
Australasian J. Combinatorics, 2009

Key Predistribution Schemes Using Block Designs in Wireless Sensor Networks.
Proceedings of the 12th IEEE International Conference on Computational Science and Engineering, 2009

2008
The Theory of Quaternion Orthogonal Designs.
IEEE Trans. Signal Processing, 2008

New orthogonal designs from weighing matrices.
Australasian J. Combinatorics, 2008

A Five-Round Algebraic Property of the Advanced Encryption Standard.
Proceedings of the Information Security, 11th International Conference, 2008

A New Very Fast Stream Cipher : Tpy.
Proceedings of the Sixth Australasian Information Security Conference, 2008

2007
Generalized Bhaskar Rao Designs with Block Size 3 over Finite Abelian Groups.
Graphs and Combinatorics, 2007

Some new results of regular Hadamard matrices and SBIBD II.
Australasian J. Combinatorics, 2007

A Simple Orthogonal Space-Time-Polarization Block Code.
Proceedings of the 66th IEEE Vehicular Technology Conference, 2007

Identity-Based Proxy Signature from Pairings.
Proceedings of the Autonomic and Trusted Computing, 4th International Conference, 2007

2006
Hadamard ideals and Hadamard matrices with two circulant cores.
Eur. J. Comb., 2006

Hadamard matrices constructed by circulant and negacyclic matrices.
Australasian J. Combinatorics, 2006

Jacket matrices constructed from Hadamard matrices and generalized Hadamard matrices.
Australasian J. Combinatorics, 2006

On amicable orthogonal designs of order 8.
Australasian J. Combinatorics, 2006

Amicable orthogonal designs of order 8 for complex space-time block codes.
Australasian J. Combinatorics, 2006

On the Internal Structure of Alpha-MAC.
Proceedings of the Progressin Cryptology, 2006

Combinatorial Structures for Design of Wireless Sensor Networks.
Proceedings of the Applied Cryptography and Network Security, 4th International Conference, 2006

2005
Py (Roo): A Fast and Secure Stream Cipher using Rolling Arrays.
IACR Cryptology ePrint Archive, 2005

A Generalized Algorithm for the Generation of Correlated Rayleigh Fading Envelopes in Wireless Channels.
EURASIP J. Wireless Comm. and Networking, 2005

A New Method for Constructing Williamson Matrices.
Des. Codes Cryptography, 2005

An infinite family of Goethals-Seidel arrays.
Discrete Applied Mathematics, 2005

A new method for constructing T-matrices.
Australasian J. Combinatorics, 2005

An exposure property of block designs.
Australasian J. Combinatorics, 2005

Critical sets in orthogonal arrays with 7 and 9 levels.
Australasian J. Combinatorics, 2005

A Generalized Algorithm for the Generation of Correlated Rayleigh Fading Envelopes.
Proceedings of the 2005 International Conference on a World of Wireless, 2005

Generalized Williamson and Wallis-Whiteman constructions for improved square order-8 CO STBCs.
Proceedings of the IEEE 16th International Symposium on Personal, 2005

A Cryptographic Solution for General Access Control.
Proceedings of the Information Security, 8th International Conference, 2005

A Generalized Algorithm for the Generation of Correlated Rayleigh Fading Envelopes in Radio Channels.
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

Delegatable Access Control for Fine-Grained XML.
Proceedings of the 11th International Conference on Parallel and Distributed Systems, 2005

Access Policy Sheet for Access Control in Fine-Grained XML.
Proceedings of the Embedded and Ubiquitous Computing - EUC 2005 Workshops, 2005

Security Analysis of Michael: The IEEE 802.11i Message Integrity Code.
Proceedings of the Embedded and Ubiquitous Computing - EUC 2005 Workshops, 2005

Counting Techniques Specifying the Existence of Submatrices in Weighing Matrices.
Proceedings of the Computer Algebra in Scientific Computing, 8th International Workshop, 2005

2004
New skew-Hadamard matrices of order 4cdot59 and new D-optimal designs of order 2cdot59.
Discrete Mathematics, 2004

Homogeneous bent functions of degree n in 2n variables do not exist for nge3.
Discrete Applied Mathematics, 2004

Orthogonal Designs of Kharaghani Type: II.
Ars Comb., 2004

Generalized orthogonal designs.
Ars Comb., 2004

Orthogonal designs from negacyclic matrices.
Australasian J. Combinatorics, 2004

A Generalized Policy Support System and Its Hierarchy Semantics.
Proceedings of the Security In Information Systems, 2004

On multi-modulation schemes to increase the rate of space-time block codes.
Proceedings of the 2004 12th European Signal Processing Conference, 2004

Boolean Functions with Good Properties.
Proceedings of the International Conference on Security and Management, 2004

Secure IP Multicast for DMS.
Proceedings of the International Conference on Security and Management, 2004

2003
Williamson-Hadamard spreading sequences for DS-CDMA applications.
Wireless Communications and Mobile Computing, 2003

Values of Minors of an Infinite Family of D-Optimal Designs and Their Application to the Growth Problem: II.
SIAM J. Matrix Analysis Applications, 2003

A Note on the Exposure Property of SBIBD.
Electronic Notes in Discrete Mathematics, 2003

Critical Sets in Orthogonal Arrays.
Electronic Notes in Discrete Mathematics, 2003

Orthogonal Designs of Kharaghani Type: I.
Ars Comb., 2003

Some results on self-orthogonal and self-dual codes.
Ars Comb., 2003

Regular Hadamard matrix, maximum excess and SBIBD.
Australasian J. Combinatorics, 2003

Forensic Computing.
Proceedings of the Progress in Cryptology, 2003

Further Observations on the Structure of the AES Algorithm.
Proceedings of the Fast Software Encryption, 10th International Workshop, 2003

Construction of Highly Non-Linear Cubic Homogeneous Boolean Functions on GF2n+1(2).
Proceedings of the International Conference on Security and Management, 2003

On Using Fast Exponentiation Algorithm in PDAs (or: How Secure is the Discrete Logarithm Problem Assumption in PDAs?).
Proceedings of the International Conference on Security and Management, 2003

Fundamentals of computer security.
Springer, ISBN: 978-3-540-43101-5, 2003

2002
On Full Orthogonal Designs in Order 56.
Ars Comb., 2002

Consistent Differential Patterns of Rijndael.
Proceedings of the Information Security and Cryptology, 2002

The Analysis of Zheng-Seberry Scheme.
Proceedings of the Information Security and Privacy, 7th Australian Conference, 2002

2001
Values of Minors of an Infinite Family of D-Optimal Designs and Their Application to the Growth Problem.
SIAM J. Matrix Analysis Applications, 2001

Values of Minors of (1, -1) Incidence Matrices of SBIBDs and Their Application to the Growth Problem.
Des. Codes Cryptography, 2001

On infinite families of sequences with one and two valued autocorrelation and two valued crosscorrelation function.
Australasian J. Combinatorics, 2001

On ternary complementary pairs.
Australasian J. Combinatorics, 2001

New D-optimal designs of order 110.
Australasian J. Combinatorics, 2001

Application of the discrete Fourier transform to the search for generalised Legendre pairs and Hadamard matrices.
Australasian J. Combinatorics, 2001

On the Complete Pivoting Conjecture for Hadamard Matrices of Small Orders.
Journal of Research and Practice in Information Technology, 2001

Equitability in Retroactive Data Confiscation versus Proactive Key Escrow.
Proceedings of the Public Key Cryptography, 2001

A New Cryptanalytic Method Using the Distribution Characteristics of Substitution Distances.
Proceedings of the Information Security and Cryptology, 2001

2000
Homogeneous bent functions.
Discrete Applied Mathematics, 2000

A New and Efficient Fail-stop Signature Scheme.
Comput. J., 2000

Construction of cubic homogeneous boolean bent functions.
Australasian J. Combinatorics, 2000

On the spectrum of an F-square.
Australasian J. Combinatorics, 2000

Identification of Bad Signatures in Batches.
Proceedings of the Public Key Cryptography, 2000

Codes Identifying Bad Signature in Batches.
Proceedings of the Progress in Cryptology, 2000

1999
New orthogonal designs and sequences with two and three variables in order 28.
Ars Comb., 1999

On F-squares and their critical sets.
Australasian J. Combinatorics, 1999

Back circulant Latin squares and the influence of a set.
Australasian J. Combinatorics, 1999

On the Symmetric Property of Homogeneous Boolean Functions.
Proceedings of the Information Security and Privacy, 4th Australasian Conference, 1999

Companion Viruses and the Macintosh: Threats and Countermeasures.
Proceedings of the Information Security and Privacy, 4th Australasian Conference, 1999

Generalised Cycling Attacks on RSA and Strong RSA Primes.
Proceedings of the Information Security and Privacy, 4th Australasian Conference, 1999

1998
On circulant weighing matrices.
Australasian J. Combinatorics, 1998

Equitable Key Escrow with Limited Time Span (or, How to Enforce Time Expiration Cryptographically).
Proceedings of the Advances in Cryptology, 1998

Covert Distributed Computing Using Java Through Web Spoofing.
Proceedings of the Information Security and Privacy, Third Australasian Conference, 1998

1996
Beacons for Authentication in Distributed Systems.
Journal of Computer Security, 1996

On sufficient conditions for some orthogonal designs and sequences with zero autocorrelation function.
Australasian J. Combinatorics, 1996

Multiplications of ternary complementary pairs.
Australasian J. Combinatorics, 1996

Secret Sharing Schemes Based on Room Squares.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

Replicating the Kuperee authentication server for increased security and reliability.
Proceedings of the Information Security and Privacy, First Australasian Conference, 1996

1995
Nonlinearity and Propagation Characteristics of Balanced Boolean Functions
Inf. Comput., May, 1995

The Relationship Between Propagation Characteristics and Nonlinearity of Cryptographic Functions.
J. UCS, 1995

Applications of smartcards for anonymous and verifiable databases.
Computers & Security, 1995

On the weighing matrices of order 4n and weight 4n-2 and 2n-1.
Australasian J. Combinatorics, 1995

Information Security in Mobile Databases.
Proceedings of the Sixth Australasian Database Conference, 1995

1994
Comments on 'Generating and counting binary Bent sequences'.
IEEE Trans. Information Theory, 1994

The Strong Kronecker Product.
J. Comb. Theory, Ser. A, 1994

Improving the Strict Avalanche Characteristics of Cryptographic Functions.
Inf. Process. Lett., 1994

On Sequences with Zero Autocorrelation.
Des. Codes Cryptography, 1994

Database authentication revisited.
Computers & Security, 1994

Reusing Shares in Secret Sharing Schemes.
Comput. J., 1994

Cryptographic Boolean functions via group Hadamard matrices.
Australasian J. Combinatorics, 1994

Construction of bent functions from two known bent functions.
Australasian J. Combinatorics, 1994

Multiplication of sequences with zero autocorrelation.
Australasian J. Combinatorics, 1994

Kuperee: An Approach to Authentication using Public Keys.
Proceedings of the Upper Layer Protocols, 1994

Relationships Among Nonlinear Criteria (Extended Abstract).
Proceedings of the Advances in Cryptology, 1994

Beacon Based Authentication.
Proceedings of the Computer Security, 1994

Authentication via Multi-Service Tickets in the Kuperee Server.
Proceedings of the Computer Security, 1994

Pitfalls in Designing Substitution Boxes (Extended Abstract).
Proceedings of the Advances in Cryptology, 1994

Structures of Cryptographic Functions with Strong Avalanche Characteristics (Extended Abstract).
Proceedings of the Advances in Cryptology - ASIACRYPT '94, 4th International Conference on the Theory and Applications of Cryptology, Wollongong, Australia, November 28, 1994

1993
Immunizing Public Key Cryptosystems Against Chosen Ciphertext Attacks.
IEEE Journal on Selected Areas in Communications, 1993

Regular sets of matrices and applications.
Graphs and Combinatorics, 1993

The excess of complex Hadamard matrices.
Graphs and Combinatorics, 1993

Some orthogonal matrices constructed by strong Kronecker multiplication.
Australasian J. Combinatorics, 1993

Some new weighing matrices using sequences with zero autocorrelation function.
Australasian J. Combinatorics, 1993

On Constructions and Nonlinearity of Correlation Immune Functions (Extended Abstract).
Proceedings of the Advances in Cryptology, 1993

Nonlinearly Balanced Boolean Functions and Their Propagation Characteristics (Extended Abstract).
Proceedings of the Advances in Cryptology, 1993

Systematic Generation of Cryptographically Robust S-Boxes.
Proceedings of the CCS '93, 1993

1992
A Cubic RSA Code Equivalent to Factorization.
J. Cryptology, 1992

Product of Four Hadamard Matrices.
J. Comb. Theory, Ser. A, 1992

Constructing Hadamard matrices from orthogonal designs.
Australasian J. Combinatorics, 1992

Practical Approaches to Attaining Security Against Adaptively Chosen Ciphertext Attacks (Extended Abstract).
Proceedings of the Advances in Cryptology, 1992

HAVAL - A One-Way Hashing Algorithm with Variable Length of Output.
Proceedings of the Advances in Cryptology, 1992

Highly Nonlinear 0-1 Balanced Boolean Functions Satisfying Strict Avalanche Criterion.
Proceedings of the Advances in Cryptology, 1992

Practical Proven Secure Authentication with Arbitration.
Proceedings of the Advances in Cryptology, 1992

1991
Error-correcting codes for authentication and subliminal channels.
IEEE Trans. Information Theory, 1991

Ralph Gordon Stanton.
Discrete Mathematics, 1991

Hadamard matrices of order =8 (mod 16) with maximal excess.
Discrete Mathematics, 1991

Supplementary difference sets and optimal designs.
Discrete Mathematics, 1991

Some orthogonal designs and complex Hadamard matrices by using two Hadamard matrices.
Australasian J. Combinatorics, 1991

Existence of SBIBD(4k2, 2k2±k, k2±k) and Hadamard matrices with maximal excess.
Australasian J. Combinatorics, 1991

Latin squares and critical sets of minimal size.
Australasian J. Combinatorics, 1991

Generalised Bhaskar Rao designs with elements from cyclic groups of even order.
Australasian J. Combinatorics, 1991

Improving Resistance to Differential Cryptanalysis and the Redesign of LOKI.
Proceedings of the Advances in Cryptology, 1991

Cryptography - an introduction to computer security.
Advances in computer science series, Prentice Hall, ISBN: 978-0-13-194986-7, 1991

1990
Search Key Substitution in the Encipherment of B-Trees.
Proceedings of the 16th International Conference on Very Large Data Bases, 1990

Key Scheduling In Des Type Cryptosystems.
Proceedings of the Advances in Cryptology, 1990

LOKI - A Cryptographic Primitive for Authentication and Secrecy Applications.
Proceedings of the Advances in Cryptology, 1990

Some Remarks on Authentication Systems.
Proceedings of the Advances in Cryptology, 1990

1989
SBIBD(4k2, 2k2 +k, k2 +k) and Hadamard matrices of order 4k2 with maximal excess are equivalent.
Graphs and Combinatorics, 1989

Relative Compromise of Statistical Databases.
Australian Computer Journal, 1989

On the Design of Permutation P in DES Type Cryptosystems.
Proceedings of the Advances in Cryptology, 1989

1988
New Hadamard matrices and conference matrices obtained via Mathon's construction.
Graphs and Combinatorics, 1988

1986
A new construction for Williamson-type matrices.
Graphs and Combinatorics, 1986

Encryption Exponent 3 and the Security of RSA.
EUROCRYPT, 1986

Electronic Funds Transfer Point of Sale in Australia.
Proceedings of the Advances in Cryptology, 1986

1984
The directed packing numbers DD (t, v, v), t>=;4.
Combinatorica, 1984

1981
Higher dimensional orthogonal designs and applications.
IEEE Trans. Information Theory, 1981

1980
All Directed BIBDs with k = 3 Exist.
J. Comb. Theory, Ser. A, 1980

1979
Ordered Partitions and Codes Generated by Circulant Matrices.
J. Comb. Theory, Ser. A, 1979

1976
On the Existence of Hadamard Matrices.
J. Comb. Theory, Ser. A, 1976

1975
On Hadamard Matrices.
J. Comb. Theory, Ser. A, 1975

Orthogonal Designs IV: Existence Questions.
J. Comb. Theory, Ser. A, 1975


  Loading...