Electrical computers and digital processing systems: support – Multiple computer communication using cryptography – Particular communication authentication technique
Reexamination Certificate
2006-10-30
2010-10-19
Zand, Kambiz (Department: 2434)
Electrical computers and digital processing systems: support
Multiple computer communication using cryptography
Particular communication authentication technique
C713S156000
Reexamination Certificate
active
07818570
ABSTRACT:
An (n,k,r,t)-exclusive set system over a set U includes elements Sƒeach of corresponds to a polynomial ƒ(u) in one or more coordinates of uεU. The polynomial is zero on U\Sƒbut is not zero on Sƒ. In some embodiments, an asymptotically low key complexity k is provided.
REFERENCES:
patent: 5592552 (1997-01-01), Fiat
patent: 5666416 (1997-09-01), Micali
patent: 2002/0007457 (2002-01-01), Neff
patent: WO03/090429 (2003-10-01), None
patent: WO2005/043326 (2005-05-01), None
W. Aiello, S. Lodha, and R. Ostrovsky. Fast digital identity revocation. InIn proceedings of Asiacrypt '01, 2001.
R.C. Baker, G. Harman, and J. Pintz. The difference between consecutive primes II, London Math. Soc. (3) 83 (2001), pp. 532.562.
U. Feige. A threshold of ln n for approximating set cover, JACM, 1998, pp. 634-652.
A. Fiat and M. Naor. Broadcast encryption, Crypto, 1993, pp. 480-491.
E. Gafni, J. Staddon, and Y. L. Yin. Efficient methods for integrating traceability and broadcast encryption, Crypto, 1999, pp. 372-387.
R. Kumar, S. Rajagopalan, and A. Sahai. Coding constructions for blacklisting problems without computational assumptions, Crypto, 1999, pp. 609-623.
R. Kumar and A. Russell. A note on the set systems used for broadcast encryption, SODA, 2003, pp. 470-471.
J. Lotspiech, D. Naor, and M. Naor. Revocation and tracing schemes for stateless receivers, Crypto, 2001, pp. 41-62.
A. Lubotzky, R. Phillips, and P. Samak. Explicit expanders and the Ramanujan conjectures, STOC, pp. 240-246. See also: A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica 8, 1988, pp. 261-277.
M. Luby and J. Staddon. Combinatorial Bounds for Broadcast Encryption, Eurocrypt, 1998, pp. 512-526.
C. Lund and M. Yannakakis. On the hardness of approximating minimization problems, JACM, 1994, pp. 960-981.
S. Micali. Efficient Certificate Revocation. MIT/LCS/TM 542b, Massachusetts Institute of Technology, 1996.
S. Micali. NOVOMODO: scalable certificate validation and simplified PKI management. In Proceedings of the 1st Annual PKI Research Workshop, 2002.
Kaltofen, E. et al. “Distributed Matrix-Free Solution of Large Sparse Linear Systems Over Finite Fields,” Journal Algorithmica, Publisher Springer New York Issue, vol. 24, Nos. 3-4, Aug. 1999, pp. 331-348.
International Search Report for PCT Application No. PCT/US2006/060405 dated Feb. 22, 2008, 2 pages.
Written Opinion of the International Searching Authority for PCT Application No. PCT/US2006/060405 dated Feb. 22, 2008, 2 pages.
Gentry Craig B.
Ramzan Zulfikar Amin
Woodruff David P.
Haynes and Boone LLP
NTT DoCoMo Inc.
Poltorak Peter
Shenker Michael
Zand Kambiz
LandOfFree
Exclusive set system constructions including, but not... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Exclusive set system constructions including, but not..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exclusive set system constructions including, but not... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4190405