G. R. Blakley - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 30 from 30

2005

All Sail, No Anchor III: Risk Aggregation and Time s ArrowBob Blakley, G. R. Blakley. acisp 2005: 1-16 [doi]

2004

All sail, no anchor II: Acceptable high-end PKIBob Blakley, G. R. Blakley. ijisec, 2(2):66-77, 2004. [doi]

Random coding technique for digital fingerprinting codes: fighting two pirates revisitedG. R. Blakley, Gregory A. Kabatiansky. isit 2004: 203 [doi]

2003

Digital fingerprinting codes: problem statements, constructions, identification of traitorsAlexander Barg, G. R. Blakley, Gregory A. Kabatiansky. TIT, 49(4):852-865, 2003.

2000

All Sail, No Anchor, 1: Cryptography, Risk, and e-CommerceBob Blakley, G. R. Blakley. acisp 2000: 471-476

Construction and Categories of CodesG. R. Blakley, I. Borosh, Andreas Klappenecker. acisp 2000: 266-277

1999

Twenty Years of Cryptography in the Open LiteratureG. R. Blakley. sp 1999: 106-107 [doi]

1997

A General Theory of Codes, II: Paradigms and HomomorphismsG. R. Blakley, I. Borosh. iiswc 1998: 1-31

1995

General Perfect Secret Sharing SchemesG. R. Blakley, Gregory Kabatianskii. crypto 1995: 367-371 [doi]

1993

Linear Algebra Approach to Secret Sharing SchemesG. R. Blakley, Gregory Kabatianskii. eccsp 1994: 33-40

1992

Threshold Schemes with DisenrollmentBob Blakley, G. R. Blakley, Agnes Hui Chan, James L. Massey. crypto 1993: 540-548 [doi]

1987

Cryptosystems Based on an Analog of Heat FlowG. R. Blakley, William Rundell. crypto 1988: 306-329 [doi]

1986

Smallest Possible Message Expansion in Threshold SchemesG. R. Blakley, R. D. Dixon. crypto 1987: 266-274 [doi]

1985

Fingerprinting Long Forgiving MessagesG. R. Blakley, Catherine Meadows, George B. Purdy. crypto 1986: 180-189 [doi]

Information Theory Without the Finiteness Assumption, II: Unfolding the DESG. R. Blakley. crypto 1986: 282-337 [doi]

A Database Encryption Scheme Which Allows the Computation of Statistics Using Encrypted DataG. R. Blakley, Catherine Meadows. sp 1985: 116-122 [doi]

1984

Information Theory Without the Finiteness Assumption, I: Cryptosystems as Group-Theoretic ObjectsG. R. Blakley. crypto 1985: 314-338 [doi]

Security of Ramp SchemesG. R. Blakley, Catherine Meadows. crypto 1985: 242-268 [doi]

Aaas Crypto Sessions Proceedings: ReviewG. R. Blakley. cryptologia, 8(3):266-269, 1984. [doi]

1983

A Computer Algorithm for Calculating the Product A::::B:::: Modulo ::::M::::G. R. Blakley. TC, 32(5):497-500, 1983.

1982

Pooling, Splitting, and Restituting Information to Overcome Total Failure of Some Channels of CommunicationC. A. Asmuth, G. R. Blakley. sp 1982: 156 [doi]

Infinite Structures in Information TheoryG. R. Blakley, Laif Swanson. crypto 1982: 39-50

1981

A necessary and sufficient condition for fundamental periods of cascade machines to be products of the fundamental periods of their constituent finite state machinesG. R. Blakley, George B. Purdy. isci, 24(1):71-91, 1981. [doi]

Key Management from a Security ViewpointG. R. Blakley. crypto 1981: 82

Security Proofs for Information Protection SystemsG. R. Blakley, Laif Swanson. sp 1981: 75-88 [doi]

1980

One Time Pads Are Key Safeguarding Schemes, Not Cryptosystems Fast Key Safeguarding Schemes (Threshold Schemes) ExistG. R. Blakley. sp 1980: 108-113

1979

Security of Number Theoretic Public Key Cryptosystems against Random Attack, IIIBob Blakley, G. R. Blakley. cryptologia, 3(2):105-118, 1979. [doi]

Security of Number Theoretic Public Key Cryptosystems against Random Attack, IIBob Blakley, G. R. Blakley. cryptologia, 3(1):29-42, 1979. [doi]

Safeguarding cryptographic keysG. R. Blakley. mark2 1979: 313-318 [doi]

1978

Security of Number Theoretic Public Key Cryptosystems against Random Attack, IBob Blakley, G. R. Blakley. cryptologia, 2(4):305-321, 1978. [doi]

Sign in or sign up to see more results.

runs on WebDSL