G. R. Blakley

Publication Activity (10 Years)

Years Active: 1978-2014
Publications (10 Years): 0

Top Topics

Highly Connected

Security Protocols

Graph Structures

Top Venues

Publications

Bob Blakley, G. R. Blakley, Sean M. Blakley
How to Draw Graphs: Seeing and Redrafting Large Networks in Security and Biology. CoRR (2014)
Bob Blakley, G. R. Blakley
All Sail, No Anchor III: Risk Aggregation and Time's Arrow. ACISP (2005)
Bob Blakley, G. R. Blakley
All sail, no anchor II: Acceptable high-end PKI. Int. J. Inf. Sec. 2 (2) (2004)
G. R. Blakley, Gregory A. Kabatiansky
Random coding technique for digital fingerprinting codes: fighting two pirates revisited. ISIT (2004)
Alexander Barg, G. R. Blakley, Gregory A. Kabatiansky
Digital fingerprinting codes: problem statements, constructions, identification of traitors. IEEE Trans. Inf. Theory 49 (4) (2003)
G. R. Blakley, I. Borosh, Andreas Klappenecker
Construction and Categories of Codes. ACISP (2000)
Bob Blakley, G. R. Blakley
All Sail, No Anchor, 1: Cryptography, Risk, and e-Commerce. ACISP (2000)
G. R. Blakley
Twenty Years of Cryptography in the Open Literature. IEEE Symposium on Security and Privacy (1999)
G. R. Blakley, I. Borosh
A General Theory of Codes, II: Paradigms and Homomorphisms. ISW (1997)
G. R. Blakley, Gregory Kabatianskii
General Perfect Secret Sharing Schemes. CRYPTO (1995)
G. R. Blakley, Gregory Kabatianskii
Linear Algebra Approach to Secret Sharing Schemes. Error Control, Cryptology, and Speech Compression (1993)
Bob Blakley, G. R. Blakley, Agnes Hui Chan, James L. Massey
Threshold Schemes with Disenrollment. CRYPTO (1992)
G. R. Blakley, William Rundell
Cryptosystems Based on an Analog of Heat Flow. CRYPTO (1987)
G. R. Blakley, R. D. Dixon
Smallest Possible Message Expansion in Threshold Schemes. CRYPTO (1986)
G. R. Blakley, Catherine A. Meadows, George B. Purdy
Fingerprinting Long Forgiving Messages. CRYPTO (1985)
G. R. Blakley, Catherine A. Meadows
A Database Encryption Scheme Which Allows the Computation of Statistics Using Encrypted Data. IEEE Symposium on Security and Privacy (1985)
G. R. Blakley
Information Theory Without the Finiteness Assumption, II: Unfolding the DES. CRYPTO (1985)
G. R. Blakley, Catherine A. Meadows
Security of Ramp Schemes. CRYPTO (1984)
G. R. Blakley
Aaas Crypto Sessions Proceedings: Review. Cryptologia 8 (3) (1984)
G. R. Blakley
Information Theory Without the Finiteness Assumption, I: Cryptosystems as Group-Theoretic Objects. CRYPTO (1984)
G. R. Blakley
. IEEE Trans. Computers 32 (5) (1983)
C. A. Asmuth, G. R. Blakley
Pooling, Splitting, and Restituting Information to Overcome Total Failure of Some Channels of Communication. IEEE Symposium on Security and Privacy (1982)
G. R. Blakley, Laif Swanson
Infinite Structures in Information Theory. CRYPTO (1982)
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) (1981)
G. R. Blakley, Laif Swanson
Security Proofs for Information Protection Systems. IEEE Symposium on Security and Privacy (1981)
G. R. Blakley
Key Management from a Security Viewpoint. CRYPTO (1981)
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)
G. R. Blakley
Safeguarding cryptographic keys. MARK (1979)
Bob Blakley, G. R. Blakley
Security of Number Theoretic Public Key Cryptosystems against Random Attack, II. Cryptologia 3 (1) (1979)
Bob Blakley, G. R. Blakley
Security of Number Theoretic Public Key Cryptosystems against Random Attack, III. Cryptologia 3 (2) (1979)
Bob Blakley, G. R. Blakley
Security of Number Theoretic Public Key Cryptosystems against Random Attack, I. Cryptologia 2 (4) (1978)