Peter R. Wild

Orcid: 0000-0002-7344-1742

According to our database1, Peter R. Wild authored at least 39 papers between 1983 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Orientable and negative orientable sequences.
CoRR, 2024

2023
A characterisation of Fq-conics of PG(2,<i>q</i><sup>3</sup>).
Discret. Math., April, 2023

2022
Constructing Orientable Sequences.
IEEE Trans. Inf. Theory, 2022

2021
The Bose representation of PG(2, q<sup>3</sup>) in PG(8, q).
Australas. J Comb., 2021

2016
Editorial for the 25th anniversary issue.
Des. Codes Cryptogr., 2016

2014
Towards an optimal swap gate.
Quantum Inf. Process., 2014

2011
On "the Power of Verification Queries" in Unconditionally Secure Message Authentication.
Discret. Math. Algorithms Appl., 2011

2009
Establishing the broadcast efficiency of the Subset Difference Revocation Scheme.
Des. Codes Cryptogr., 2009

2008
Information Theoretic Bounds on Authentication Systems in Query Model.
IEEE Trans. Inf. Theory, 2008

2007
Cryptanalysis of a homomorphic public-key cryptosystem over a finite group.
J. Math. Cryptol., 2007

ID-based cryptography using symmetric primitives.
Des. Codes Cryptogr., 2007

Combinatorial characterizations of authentication codes in verification oracle model.
Proceedings of the 2007 ACM Symposium on Information, Computer and Communications Security, 2007

2006
On Key Assignment for Hierarchical Access Control.
Proceedings of the 19th IEEE Computer Security Foundations Workshop, 2006

2005
Distributing the Encryption and Decryption of a Block Cipher.
Des. Codes Cryptogr., 2005

Bounds on authentication systems in query model.
Proceedings of the IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005

2004
Embeddings of Steiner Quadruple Systems using Extensions of Linear Spaces.
Ars Comb., 2004

2002
Embeddings of Steiner Quadruple Systems.
Ars Comb., 2002

Threshold MACs.
Proceedings of the Information Security and Cryptology, 2002

Size of Broadcast in Threshold Schemes with Disenrollment.
Proceedings of the Information Security and Privacy, 7th Australian Conference, 2002

2001
On k-arcs Covering a Line in Finite Projective Planes.
Ars Comb., 2001

2000
A New Family of Extended Generalized Quadrangles of Order (<i>q</i> + 1, <i>q</i> - 1).
Eur. J. Comb., 2000

1998
Optimal Linear Perfect Hash Families.
J. Comb. Theory A, 1998

Bounds and Characterizations of Authentication/Secrecy Schemes.
Des. Codes Cryptogr., 1998

1997
On GMW Designs and Cyclic Hadamard Designs.
Des. Codes Cryptogr., 1997

Secret Sharing with Reusable Polynomials.
Proceedings of the Information Security and Privacy, Second Australasian Conference, 1997

1996
Authentication Schemes, Perfect Local Randomizers, Perfect Secrecy and Secret Sharing Schemes.
Des. Codes Cryptogr., 1996

Quadrics and difference sets.
Ars Comb., 1996

Efficient Multiplicative Sharing Schemes.
Proceedings of the Advances in Cryptology, 1996

1995
Some families of semibiplanes.
Discret. Math., 1995

1994
The Combinatorics of Perfect Authentication Schemes.
SIAM J. Discret. Math., 1994

A Weak Cipher that Generates the Symmetric Group.
J. Cryptol., 1994

Perfect binary arrays and difference sets.
Discret. Math., 1994

1992
Incidence structures applied to cryptography.
Discret. Math., 1992

Relations between Two Perfect Ternary Sequence Constructions.
Des. Codes Cryptogr., 1992

1991
Non-embedding of non prime- power unitals with point-regular group.
Discret. Math., 1991

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

1989
One-stage one-sided rearrangeable switching networks.
IEEE Trans. Commun., 1989

1987
Difference basis systems.
Discret. Math., 1987

1983
Incidence graphs and subdesigns of semisymmetric designs.
Discret. Math., 1983


  Loading...