The SCEAS System
| |||||||

## Search the dblp DataBase
G. R. Blakley:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Bob Blakley, G. R. Blakley
**All Sail, No Anchor, 1: Cryptography, Risk, and e-Commerce.**[Citation Graph (0, 0)][DBLP] ACISP, 2000, pp:471-476 [Conf] - Bob Blakley, G. R. Blakley
**All Sail, No Anchor III: Risk Aggregation and Time's Arrow.**[Citation Graph (0, 0)][DBLP] ACISP, 2005, pp:1-16 [Conf] - G. R. Blakley, I. Borosh, Andreas Klappenecker
**Construction and Categories of Codes.**[Citation Graph (0, 0)][DBLP] ACISP, 2000, pp:266-277 [Conf] - G. R. Blakley
**Key Management from a Security Viewpoint.**[Citation Graph (0, 0)][DBLP] CRYPTO, 1981, pp:82- [Conf] - G. R. Blakley
**Information Theory Without the Finiteness Assumption, I: Cryptosystems as Group-Theoretic Objects.**[Citation Graph (0, 0)][DBLP] CRYPTO, 1984, pp:314-338 [Conf] - G. R. Blakley
**Information Theory Without the Finiteness Assumption, II: Unfolding the DES.**[Citation Graph (0, 0)][DBLP] CRYPTO, 1985, pp:282-337 [Conf] - Bob Blakley, G. R. Blakley, Agnes Hui Chan, James L. Massey
**Threshold Schemes with Disenrollment.**[Citation Graph (0, 0)][DBLP] CRYPTO, 1992, pp:540-548 [Conf] - G. R. Blakley, R. D. Dixon
**Smallest Possible Message Expansion in Threshold Schemes.**[Citation Graph (0, 0)][DBLP] CRYPTO, 1986, pp:266-274 [Conf] - G. R. Blakley, Gregory Kabatianskii
**General Perfect Secret Sharing Schemes.**[Citation Graph (0, 0)][DBLP] CRYPTO, 1995, pp:367-371 [Conf] - G. R. Blakley, Catherine Meadows
**Security of Ramp Schemes.**[Citation Graph (0, 0)][DBLP] CRYPTO, 1984, pp:242-268 [Conf] - G. R. Blakley, Catherine Meadows, George B. Purdy
**Fingerprinting Long Forgiving Messages.**[Citation Graph (0, 0)][DBLP] CRYPTO, 1985, pp:180-189 [Conf] - G. R. Blakley, William Rundell
**Cryptosystems Based on an Analog of Heat Flow.**[Citation Graph (0, 0)][DBLP] CRYPTO, 1987, pp:306-329 [Conf] - G. R. Blakley, Laif Swanson
**Infinite Structures in Information Theory.**[Citation Graph (0, 0)][DBLP] CRYPTO, 1982, pp:39-50 [Conf] - G. R. Blakley, Gregory Kabatianskii
**Linear Algebra Approach to Secret Sharing Schemes.**[Citation Graph (0, 0)][DBLP] Error Control, Cryptology, and Speech Compression, 1993, pp:33-40 [Conf] - G. R. Blakley, I. Borosh
**A General Theory of Codes, II: Paradigms and Homomorphisms.**[Citation Graph (0, 0)][DBLP] ISW, 1997, pp:1-31 [Conf] - G. R. Blakley
**One Time Pads Are Key Safeguarding Schemes, Not Cryptosystems Fast Key Safeguarding Schemes (Threshold Schemes) Exist.**[Citation Graph (0, 0)][DBLP] IEEE Symposium on Security and Privacy, 1980, pp:108-113 [Conf] - G. R. Blakley
**Twenty Years of Cryptography in the Open Literature.**[Citation Graph (0, 0)][DBLP] IEEE Symposium on Security and Privacy, 1999, pp:106-107 [Conf] - Bob Blakley, G. R. Blakley
**All sail, no anchor II: Acceptable high-end PKI.**[Citation Graph (0, 0)][DBLP] Int. J. Inf. Sec., 2004, v:2, n:2, pp:66-77 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Inf. Sci., 1981, v:24, n:1, pp:71-91 [Journal] - G. R. Blakley
**A Computer Algorithm for Calculating the Product A**[Citation Graph (0, 0)][DBLP]*B*Modulo*M*. IEEE Trans. Computers, 1983, v:32, n:5, pp:497-500 [Journal] - Alexander Barg, G. R. Blakley, Gregory A. Kabatiansky
**Digital fingerprinting codes: problem statements, constructions, identification of traitors.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2003, v:49, n:4, pp:852-865 [Journal]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |