Efficient revocation of receivers

Details Efficient revocation of receivers Efficient revocation of receivers

2008-03-04

2008-03-04

Revak, Christopher (Department: 2131)

Electrical computers and digital processing systems: support

Multiple computer communication using cryptography

Having particular address related cryptography

C380S045000, C380S278000

Reexamination Certificate

active

10292210

ABSTRACT:
Methods and apparatus for efficient revocation of receivers. In one implementation, a method of broadcast encryption includes: assigning a respective master key to each of a plurality of receivers, where each master key can be used to derive two or more of a plurality of sub keys; revoking one or more receivers, leaving one or more unrevoked receivers; for each master key of an unrevoked receiver, selecting the sub key that can be derived by that master key and derived by the most other master keys but not derived by a master key of any of the one or more revoked receivers; for each selected sub key, encrypting one ciphertext using that selected sub key; and sending the encrypted ciphertexts to the plurality of receivers.

REFERENCES:
patent: 5592552 (1997-01-01), Fiat
patent: 5663896 (1997-09-01), Aucsmith
patent: 5712800 (1998-01-01), Aucsmith
patent: 5796839 (1998-08-01), Ishiguro
patent: 5930805 (1999-07-01), Marquis
patent: 6049878 (2000-04-01), Caronni et al.
patent: 6131160 (2000-10-01), Dillon et al.
patent: 6222923 (2001-04-01), Schwenk
patent: 6295361 (2001-09-01), Kadansky et al.
patent: 6347145 (2002-02-01), Kato et al.
patent: 6389136 (2002-05-01), Young et al.
patent: 6397329 (2002-05-01), Aiello et al.
patent: 6735313 (2004-05-01), Bleichenbacher et al.
patent: 6850914 (2005-02-01), Harada et al.
patent: 6911974 (2005-06-01), Asano et al.
patent: 7007162 (2006-02-01), Lotspiech
patent: 7043024 (2006-05-01), Dinsmore et al.
patent: 7093128 (2006-08-01), Asano et al.
patent: 7143289 (2006-11-01), Denning et al.
patent: 7167564 (2007-01-01), Asano et al.
patent: 2001/0053222 (2001-12-01), Wakao et al.
patent: 2002/0111925 (2002-08-01), Kambayashi
patent: 2002/0147906 (2002-10-01), Lotspiech et al.
patent: 2002/0150250 (2002-10-01), Kitaya et al.
patent: 2002/0154782 (2002-10-01), Chow et al.
patent: 2003/0016827 (2003-01-01), Asano et al.
patent: 2003/0076958 (2003-04-01), Ishiguro et al.
patent: 2003/0185396 (2003-10-01), Asano et al.
patent: 2005/0228809 (2005-10-01), Asano et al.
patent: 2007/0098177 (2007-05-01), Asano et al.
patent: 11-187013 (1999-07-01), None
patent: WO 01/03364 (2001-01-01), None
patent: WO 01/03365 (2001-01-01), None
S.G. Akl and P.D. Taylor, “Cryptographic Solution to a Problem of Access Control in a Hierarchy,” ACM Transactions on Computer Systems, vol. 1, No. 3, 1983, pp. 239-248.
J. Anzai, N. Matsuxaki and T. Matsumoto, A Quick Group Key Distibution Scheme with Entity Revocation,: Advances in Cryptology—Asiacrypt '99, Lecture Notes in Compute Science 1716, Springer, 1999, pp. 333-347.
S. Berkovits, “How to Broadcast a Secret,” Advances in Cryptology—Eurocrypt '91, Lecture Notes in Computer Science 547, Springer, 1991, pp. 535-541.
R. Canetti, T. Malkin and K. Nissim, “Efficient Communication-Storage Tradeoffs for Multicast Encryption,” Advances in Cryptology—Eurocrypt '99, Lecture Notes in Computer Science 1592, Springer, 1999, pp. 459-474.
G.C. Chick and S.E. Tavares, “Flexible Access Control with Master Keys,” Advances in Cryptology—Crypto '89, Lecture Notes in Computer Science 435, Springer, 1990, pp. 316-322.
“Content Protection for Pre-recorded Media Specification,” available from http://www.4centity.com/tech/cprm/.
“Content Protection for Recordable Media Specification,” available from http://www.4centity.com/tech/cprm/.
W. Diffie and M. Hellman, “New Directions in Cryptography,” IEEE Transactions on Information Theory, IT-22 (6), 1976.
A. Fiat and M. Naor, “Broadcast Encryption,” Advances in Cryptology—Crypto '93, Lecture Notes in computer Science 773, Springer, 1994, pp. 480-491.
D.E. Knuth, “The Art of Computer Programming,” vol. 2, Addison-Wesley, 1981.
Y. Kim, A. Perrig and G. Tsudik, “Simple and Fault-Tolerant Key Agreement for Dynamic Collaborative Groups,” Proceedings of ACM Conference on Computer and Communication Security, CCS 2000.
R. Kumar, S. Rajagopalan and A. Sahai, “Coding Constructions for Blacklisting Problems without Computational Assumptions,” Advances in Cryptology—Crypto '99, Lecture Notes in Computer Science 1666, Springer, 1999, pp. 609-623.
M. Luby and J. Staddon, “Combinatorial Bounds for Broadcast Encryptions,” Advances in Cryptology—Eurocrypt '98, Lecture Notes in Computer Science 1403, Springer, 1998.
N. Matsuzaki, J. Anzai and T. Matsumoto, “Light Weight Broadcast Exclusion Using Secret Sharing,” Information Security and Privacy 5thAustralasian Conference, ACISP 2000, Lecture Notes in Computer Science 1841, Springer, 2000, pp. 313-327.
D.A. McGrew and A.T. Sherman, “Key Establishment in Large Dynamic Groups Using One-Way Function Trees,” Manuscript, available from http://www.csee.umbc.edu/sherman/Papers/itse.ps, 1998.
D. Naor, M. Naor and J. Lotspiech, “Revocation and Tracing Schemes for Stateless Receivers,” Advances in Cryptology—Crypto 2001, Lecture Notes in Computer Science 2139, Springer, 2001.
M. Naor and B. Pinkas, “Efficient Trace and Revoke Schemes,” Financial Cryptography '2000, Lecture Notes in Computer Science, Springer.
M. Naor and O. Reingold, “Number-Theoretic Constructions of Efficient Pseudo-Random Functions,” Proceedings of 38thIEEE Symposium on Foundations of Computer Science, 1997, pp. 458-467.
R. Poovendran and J.S. Baras, “An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes,” Advances in Cryptology—Crypto '99, Lecture Notes in Computer Science 1666, Springer, 1999.
R.L. Rivest, A. Shamir and L. Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,: Communications of the ACM, 21, 1978, pp. 120-126.
A. Shamir, “How to Share a Secret,” Communications of the ACM, 22, 1979, pp. 612-613.
D.R. Stinson, “Cryptography: Theory and Practice,”: CRC Press, 1995.
D. Wallner, E. Harder and R. Agee, “Key Management for Multicast: Issues and Architectures,” IETF Network Working Group, Request for Comments: 2627, ftp://ftp—ietf.org/rfc/rfc2627.txt, 1999.
C.K. Wong, M. Gouda and S. S. Lam, “Secure Group Communications Using Key Graphs,” Proceedings of ACM SIGCOMM '98, 1998.

Affiliated with

Also associated with

Rating

Efficient revocation of receivers does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient revocation of receivers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient revocation of receivers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3923077