G. R. Blakley

According to our database1, G. R. Blakley authored at least 39 papers between 1978 and 2014.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2014
How to Draw Graphs: Seeing and Redrafting Large Networks in Security and Biology.
CoRR, 2014

2011
Visual Secret Sharing Schemes.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Share.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Shamir's Threshold Scheme.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Secret Sharing Schemes.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

2010
Robust parent-identifying codes.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

2005
Visual Secret Sharing Schemes.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Share.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Shamir's Threshold Scheme.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Secret Sharing Schemes.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

All Sail, No Anchor III: Risk Aggregation and Time's Arrow.
Proceedings of the Information Security and Privacy, 10th Australasian Conference, 2005

2004
All sail, no anchor II: Acceptable high-end PKI.
Int. J. Inf. Sec., 2004

Random coding technique for digital fingerprinting codes: fighting two pirates revisited.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
Digital fingerprinting codes: problem statements, constructions, identification of traitors.
IEEE Trans. Information Theory, 2003

2000
Construction and Categories of Codes.
Proceedings of the Information Security and Privacy, 5th Australasian Conference, 2000

All Sail, No Anchor, 1: Cryptography, Risk, and e-Commerce.
Proceedings of the Information Security and Privacy, 5th Australasian Conference, 2000

1999
Twenty Years of Cryptography in the Open Literature.
Proceedings of the 1999 IEEE Symposium on Security and Privacy, 1999

1997
A General Theory of Codes, II: Paradigms and Homomorphisms.
Proceedings of the Information Security, First International Workshop, 1997

1995
General Perfect Secret Sharing Schemes.
Proceedings of the Advances in Cryptology, 1995

1993
Linear Algebra Approach to Secret Sharing Schemes.
Proceedings of the Error Control, Cryptology, and Speech Compression, 1993

1992
Threshold Schemes with Disenrollment.
Proceedings of the Advances in Cryptology, 1992

1987
Cryptosystems Based on an Analog of Heat Flow.
Proceedings of the Advances in Cryptology, 1987

1986
Smallest Possible Message Expansion in Threshold Schemes.
Proceedings of the Advances in Cryptology, 1986

1985
A Database Encryption Scheme Which Allows the Computation of Statistics Using Encrypted Data.
Proceedings of the 1985 IEEE Symposium on Security and Privacy, 1985

Fingerprinting Long Forgiving Messages.
Proceedings of the Advances in Cryptology, 1985

Information Theory Without the Finiteness Assumption, II: Unfolding the DES.
Proceedings of the Advances in Cryptology, 1985

1984
Aaas Crypto Sessions Proceedings: Review.
Cryptologia, 1984

Security of Ramp Schemes.
Proceedings of the Advances in Cryptology, 1984

Information Theory Without the Finiteness Assumption, I: Cryptosystems as Group-Theoretic Objects.
Proceedings of the Advances in Cryptology, 1984

1983
A Computer Algorithm for Calculating the Product AB Modulo M.
IEEE Trans. Computers, 1983

1982
Pooling, Splitting, and Restituting Information to Overcome Total Failure of Some Channels of Communication.
Proceedings of the 1982 IEEE Symposium on Security and Privacy, 1982

Infinite Structures in Information Theory.
Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

1981
A necessary and sufficient condition for fundamental periods of cascade machines to be products of the fundamental periods of their constituent finite state machines.
Inf. Sci., 1981

Security Proofs for Information Protection Systems.
Proceedings of the 1981 IEEE Symposium on Security and Privacy, 1981

Key Management from a Security Viewpoint.
Proceedings of the Advances in Cryptology: A Report on CRYPTO 81, 1981

1980
One Time Pads Are Key Safeguarding Schemes, Not Cryptosystems Fast Key Safeguarding Schemes (Threshold Schemes) Exist.
Proceedings of the 1980 IEEE Symposium on Security and Privacy, 1980

1979
Security of Number Theoretic Public Key Cryptosystems against Random Attack, III.
Cryptologia, 1979

Security of Number Theoretic Public Key Cryptosystems against Random Attack, II.
Cryptologia, 1979

1978
Security of Number Theoretic Public Key Cryptosystems against Random Attack, I.
Cryptologia, 1978


  Loading...