| 2005 |
|---|
| 22 | EE | Bob Blakley,
G. R. Blakley:
All Sail, No Anchor III: Risk Aggregation and Time's Arrow.
ACISP 2005: 1-16 |
| 2004 |
|---|
| 21 | EE | Bob Blakley,
G. R. Blakley:
All sail, no anchor II: Acceptable high-end PKI.
Int. J. Inf. Sec. 2(2): 66-77 (2004) |
| 2003 |
|---|
| 20 | | Alexander Barg,
G. R. Blakley,
Gregory A. Kabatiansky:
Digital fingerprinting codes: problem statements, constructions, identification of traitors.
IEEE Transactions on Information Theory 49(4): 852-865 (2003) |
| 2000 |
|---|
| 19 | | G. R. Blakley,
I. Borosh,
Andreas Klappenecker:
Construction and Categories of Codes.
ACISP 2000: 266-277 |
| 18 | | Bob Blakley,
G. R. Blakley:
All Sail, No Anchor, 1: Cryptography, Risk, and e-Commerce.
ACISP 2000: 471-476 |
| 1999 |
|---|
| 17 | EE | G. R. Blakley:
Twenty Years of Cryptography in the Open Literature.
IEEE Symposium on Security and Privacy 1999: 106-107 |
| 1997 |
|---|
| 16 | | G. R. Blakley,
I. Borosh:
A General Theory of Codes, II: Paradigms and Homomorphisms.
ISW 1997: 1-31 |
| 1995 |
|---|
| 15 | EE | G. R. Blakley,
Gregory Kabatianskii:
General Perfect Secret Sharing Schemes.
CRYPTO 1995: 367-371 |
| 1993 |
|---|
| 14 | | G. R. Blakley,
Gregory Kabatianskii:
Linear Algebra Approach to Secret Sharing Schemes.
Error Control, Cryptology, and Speech Compression 1993: 33-40 |
| 1992 |
|---|
| 13 | EE | Bob Blakley,
G. R. Blakley,
Agnes Hui Chan,
James L. Massey:
Threshold Schemes with Disenrollment.
CRYPTO 1992: 540-548 |
| 1987 |
|---|
| 12 | EE | G. R. Blakley,
William Rundell:
Cryptosystems Based on an Analog of Heat Flow.
CRYPTO 1987: 306-329 |
| 1986 |
|---|
| 11 | EE | G. R. Blakley,
R. D. Dixon:
Smallest Possible Message Expansion in Threshold Schemes.
CRYPTO 1986: 266-274 |
| 1985 |
|---|
| 10 | | G. R. Blakley,
David Chaum:
Advances in Cryptology, Proceedings of CRYPTO '84, Santa Barbara, California, USA, August 19-22, 1984, Proceedings
Springer 1985 |
| 9 | EE | G. R. Blakley,
Catherine Meadows,
George B. Purdy:
Fingerprinting Long Forgiving Messages.
CRYPTO 1985: 180-189 |
| 8 | EE | G. R. Blakley:
Information Theory Without the Finiteness Assumption, II: Unfolding the DES.
CRYPTO 1985: 282-337 |
| 1984 |
|---|
| 7 | EE | G. R. Blakley,
Catherine Meadows:
Security of Ramp Schemes.
CRYPTO 1984: 242-268 |
| 6 | EE | G. R. Blakley:
Information Theory Without the Finiteness Assumption, I: Cryptosystems as Group-Theoretic Objects.
CRYPTO 1984: 314-338 |
| 1983 |
|---|
| 5 | | G. R. Blakley:
A Computer Algorithm for Calculating the Product AB Modulo M.
IEEE Trans. Computers 32(5): 497-500 (1983) |
| 1982 |
|---|
| 4 | | G. R. Blakley,
Laif Swanson:
Infinite Structures in Information Theory.
CRYPTO 1982: 39-50 |
| 1981 |
|---|
| 3 | | G. R. Blakley:
Key Management from a Security Viewpoint.
CRYPTO 1981: 82 |
| 2 | EE | G. R. Blakley,
George B. Purdy:
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. 24(1): 71-91 (1981) |
| 1980 |
|---|
| 1 | | G. R. Blakley:
One Time Pads Are Key Safeguarding Schemes, Not Cryptosystems Fast Key Safeguarding Schemes (Threshold Schemes) Exist.
IEEE Symposium on Security and Privacy 1980: 108-113 |
