Method of establishing secure, digitally signed communications u

Details Method of establishing secure, digitally signed communications u Method of establishing secure, digitally signed communications u

1997-08-29

2000-06-13

Hayes, Gail O.

Cryptography

Communication system using cryptography

380259, 380268, H04K 100, H04L 900

Patent

active

060758643

ABSTRACT:
The encryption key based on a blocking set cryptosystem includes knowledge of the blocking set, and ciphers (usually independent) on the blocking set and its complement. In order to decipher, a legitimate receiver needs to know only the blocking set and the cipher used on it. Thus it is not necessary for the sender to transmit to anyone the cipher on the complement of the blocking set. The fact that part of the encryption key need not be transmitted is the fundamental difference between the proposed cryptosystem and the so-called private key system, where both the sender and receiver know, but keep secret, the encryption and decryption keys. Particularly useful applications of this scheme are two situations where a central person, institution or computer send out confidential information to several parties, but where none of the parties has the authority to transmit information to the group. This might apply to the main branch of a company, or to a certification authority in a cryptographic protocol. It can also be used to establish an access hierarchy in a computer or security network.

REFERENCES:
patent: 4306308 (1981-12-01), Nossen
patent: 4733401 (1988-03-01), Longstaff
patent: 5465299 (1995-11-01), Matsumoto et al.
patent: 5867578 (1999-02-01), Brickell et al.
patent: 5903721 (1999-04-01), Sixtus
S. Ball, "On the Size of a Triple Blocking Set" in PG(2,q), European Journal of Combinatorics, 17, (1996), 427-435 (8 pages).
S. Ball, "Multiple Blocking Sets and Arcs in Finite Planes" preprint (18 pages).
S. Ball and A. Blokhuis, "On the Size of a Double Blocking Set" in PG(2,q), preprint (15 pages).
L.M. Batten, "Combinatorics of Finite Geometrics", Cambridge University Press, 1986 (3 pages) BOOK.
L.M. Batten, "Blocking Sets in Designs", Congressus Numerantium, 99 (1994), 139-154 (17 pages).
L. Berardi & F. Eugeni, "Blocking Sets in Affine Planes", J. Geom., 22 (1984), 167-177 (11 pages).
A.E. Brouwer and A. Schrijver, "The Blocking Number of an Affine Space", J. Comb. Theory, 24 (1978), 251-253 (2 pages).
A.A. Bruen and R. Silverman, "Arcs and Blocking Sets II", Europ. J. Comb., 8 (1987), 351-356( 6 pages).
H.m. Gustafson, A.N. Pettitt E.P. Dawson and L.J. O'Connor, "Linear Dependencies in Product Ciphers", Austral. J. Comb., 10 (1994), 115-129 (8 pages).
R.E. Jamison, "Covering Finite Fields with Cosets of Subspaces", J. Comb. Theory (A), 22(1977), 253-266 (8 pages).
R.S. Rees and D.R. Stinson, "Combinatorial Characterizations of Authentication Codes II, Designs, Codes and Cryptography", 7 (1996), 239-259 (11 pages).
G.J. Simmons, "A Cartesian Product Construction for Unconditionally Secure Authentication Codes that Permit Arbitration", J. Cryptology, 2 (1990), 77-104 (15 pages).
D.R. Stinson, "Some Constructions and Bounds for Authentication Codes", J. Cryptology 1 (1988) 37-51 (8 pages).
D.R. Stinson, "A Construction for Authentication/Secrecy Codes from certain Combinatorial Designs", J. Cryptology, 1 (1988), 119-127 (5 pages).
D. R. Stinson, "The Combinatorics of Authentication and Secrecy Codes", J. Cryptology, 2 (1990), 23-49 (14 pages).
D. R. Stinson, "Combinatoial Characterizations of Authenication Codes", J. Cryptology 2, (1990), 175-187 (7 pages).
T. van Trung, "On the Construction of Authentication and Secrecy Codes, Designs, Codes and Cryptology", 5 (1995), 169-280 (7 pages).
M. de Brades and V. Rodl, (1984), "Steiner Triple Systems with Small Maximal Independent Sets" Arc Comb. 17 (1987) 15-19.
A. Bruen "Baer Subplanes and Blocking Sets", Bull. Amer. Math. Soc. 76 (1970), 342-344 (2 pages).
G. B. Dantizig and A.J. Hoffman, "Dilworths Theorem on Partially Ordered Sets' in Linear Inequalities and Related System", Annals of Math Studies No. 38, (Ed. Kuhn and Tucker) (1956), 207-214 (8 pages).
R.P. Dilworth, "A Decomposition Theorem for Partially Ordered Sets" Ann. Math. 51 (1950), 161-165 (4 pages).
E. Sperner, "Ein Satz Uber Untermengen Einer Endlichen Menge", Math. Z. 27 (1928), 544-548 (3 pages).
T. Verhoeff "An Updated Table of Minimum-Distance Bounds for Binary Linear Codes" IEEE Transactions on Information Theory, vol. IT-33 No.: 5 Sep. 1987 (16 pages).
A.A. Bruen and J.A. Thas "Blocking Sets" Geometriae Dedicta 6 (1977) 193-203--(6 pages).
A.A. Bruen, J.A. Thas and A. Blokhuis "On M.D.S. Codes, Arcs in PG(n,q) with q even, and a Solution of Three Fundamental Problems of B. Segre" (Inventiones Mathematicase 92,441-459 (1988)--(10 pages).
S. Innamorath and A. Maturo "The Spectrum of Minimal Blocking Sets" (11 pages).

Affiliated with

Also associated with

Rating

Method of establishing secure, digitally signed communications u does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method of establishing secure, digitally signed communications u, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of establishing secure, digitally signed communications u will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2075841