default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDG. R. Blakley
Person information
- affiliation: Texas A&M University, College Station, TX, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[i1]Bob Blakley, G. R. Blakley, Sean M. Blakley:
How to Draw Graphs: Seeing and Redrafting Large Networks in Security and Biology. CoRR abs/1405.5523 (2014)- 2011
- [r8]G. R. Blakley, Gregory A. Kabatiansky:
Secret Sharing Schemes. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1095-1097 - [r7]G. R. Blakley, Gregory A. Kabatiansky:
Shamir's Threshold Scheme. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1193-1194 - [r6]G. R. Blakley, Gregory A. Kabatiansky:
Share. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1195-1196 - [r5]G. R. Blakley, Gregory A. Kabatiansky:
Visual Secret Sharing Schemes. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1363-1364 - 2010
- [c23]Alexander Barg, G. Robert Blakley, Grigory Kabatiansky, Cédric Tavernier:
Robust parent-identifying codes. ITW 2010: 1-4
2000 – 2009
- 2005
- [c22]Bob Blakley, G. R. Blakley:
All Sail, No Anchor III: Risk Aggregation and Time's Arrow. ACISP 2005: 1-16 - [r4]Robert Blakley, Gregory A. Kabatiansky:
Secret Sharing Schemes. Encyclopedia of Cryptography and Security 2005 - [r3]Robert Blakley, Gregory A. Kabatiansky:
Shamir's Threshold Scheme. Encyclopedia of Cryptography and Security 2005 - [r2]Robert Blakley, Gregory A. Kabatiansky:
Share. Encyclopedia of Cryptography and Security 2005 - [r1]Robert Blakley, Gregory A. Kabatiansky:
Visual Secret Sharing Schemes. Encyclopedia of Cryptography and Security 2005 - 2004
- [j8]Bob Blakley, G. R. Blakley:
All sail, no anchor II: Acceptable high-end PKI. Int. J. Inf. Sec. 2(2): 66-77 (2004) - [c21]G. R. Blakley, Gregory A. Kabatiansky:
Random coding technique for digital fingerprinting codes: fighting two pirates revisited. ISIT 2004: 203 - 2003
- [j7]Alexander Barg, G. R. Blakley, Gregory A. Kabatiansky:
Digital fingerprinting codes: problem statements, constructions, identification of traitors. IEEE Trans. Inf. Theory 49(4): 852-865 (2003) - 2000
- [c20]G. R. Blakley, I. Borosh, Andreas Klappenecker:
Construction and Categories of Codes. ACISP 2000: 266-277 - [c19]Bob Blakley, G. R. Blakley:
All Sail, No Anchor, 1: Cryptography, Risk, and e-Commerce. ACISP 2000: 471-476
1990 – 1999
- 1999
- [c18]G. R. Blakley:
Twenty Years of Cryptography in the Open Literature. S&P 1999: 106-107 - 1997
- [c17]G. R. Blakley, I. Borosh:
A General Theory of Codes, II: Paradigms and Homomorphisms. ISW 1997: 1-31 - 1995
- [c16]G. R. Blakley, Gregory Kabatianskii:
General Perfect Secret Sharing Schemes. CRYPTO 1995: 367-371 - 1993
- [c15]G. R. Blakley, Gregory Kabatianskii:
Linear Algebra Approach to Secret Sharing Schemes. Error Control, Cryptology, and Speech Compression 1993: 33-40 - 1992
- [c14]Bob Blakley, G. R. Blakley, Agnes Hui Chan, James L. Massey:
Threshold Schemes with Disenrollment. CRYPTO 1992: 540-548
1980 – 1989
- 1987
- [c13]G. R. Blakley, William Rundell:
Cryptosystems Based on an Analog of Heat Flow. CRYPTO 1987: 306-329 - 1986
- [c12]G. R. Blakley, R. D. Dixon:
Smallest Possible Message Expansion in Threshold Schemes. CRYPTO 1986: 266-274 - 1985
- [c11]G. R. Blakley, Catherine Meadows, George B. Purdy:
Fingerprinting Long Forgiving Messages. CRYPTO 1985: 180-189 - [c10]G. R. Blakley:
Information Theory Without the Finiteness Assumption, II: Unfolding the DES. CRYPTO 1985: 282-337 - [c9]G. R. Blakley, Catherine Meadows:
A Database Encryption Scheme Which Allows the Computation of Statistics Using Encrypted Data. S&P 1985: 116-122 - [e1]G. R. Blakley, David Chaum:
Advances in Cryptology, Proceedings of CRYPTO '84, Santa Barbara, California, USA, August 19-22, 1984, Proceedings. Lecture Notes in Computer Science 196, Springer 1985, ISBN 3-540-15658-5 [contents] - 1984
- [j6]G. R. Blakley:
Aaas Crypto Sessions Proceedings: Review. Cryptologia 8(3): 266-269 (1984) - [c8]G. R. Blakley, Catherine Meadows:
Security of Ramp Schemes. CRYPTO 1984: 242-268 - [c7]G. R. Blakley:
Information Theory Without the Finiteness Assumption, I: Cryptosystems as Group-Theoretic Objects. CRYPTO 1984: 314-338 - 1983
- [j5]G. R. Blakley:
A Computer Algorithm for Calculating the Product AB Modulo M. IEEE Trans. Computers 32(5): 497-500 (1983) - 1982
- [c6]G. R. Blakley, Laif Swanson:
Infinite Structures in Information Theory. CRYPTO 1982: 39-50 - [c5]C. A. Asmuth, G. R. Blakley:
Pooling, Splitting, and Restituting Information to Overcome Total Failure of Some Channels of Communication. S&P 1982: 156- - 1981
- [j4]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) - [c4]G. R. Blakley:
Key Management from a Security Viewpoint. CRYPTO 1981: 82 - [c3]G. R. Blakley, Laif Swanson:
Security Proofs for Information Protection Systems. S&P 1981: 75-88 - 1980
- [c2]G. R. Blakley:
One Time Pads Are Key Safeguarding Schemes, Not Cryptosystems Fast Key Safeguarding Schemes (Threshold Schemes) Exist. S&P 1980: 108-113
1970 – 1979
- 1979
- [j3]Bob Blakley, G. R. Blakley:
Security of Number Theoretic Public Key Cryptosystems against Random Attack, II. Cryptologia 3(1): 29-42 (1979) - [j2]Bob Blakley, G. R. Blakley:
Security of Number Theoretic Public Key Cryptosystems against Random Attack, III. Cryptologia 3(2): 105-118 (1979) - [c1]G. R. Blakley:
Safeguarding cryptographic keys. MARK 1979: 313-318 - 1978
- [j1]Bob Blakley, G. R. Blakley:
Security of Number Theoretic Public Key Cryptosystems against Random Attack, I. Cryptologia 2(4): 305-321 (1978)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
