Cryptography – Communication system using cryptography – Symmetric key cryptography
Reexamination Certificate
2005-10-04
2011-10-18
Srivastava, Vivek (Department: 2433)
Cryptography
Communication system using cryptography
Symmetric key cryptography
C380S200000
Reexamination Certificate
active
08041037
ABSTRACT:
A cryptographic method and systems using a keyed one-way function. A sending device uses the keyed one-way function to authenticate one or more receiving devices prerequisite to communication. A multidimensional hypercube is generated, from which is formed a multidimensional vector by randomly selecting one corner of the multidimensional hypercube. The keyed one-way function is computed using the multidimensional vector.
REFERENCES:
patent: 5664016 (1997-09-01), Preneel et al.
patent: 6788788 (2004-09-01), Kasahara et al.
patent: 2003/0016770 (2003-01-01), Trans et al.
patent: 2003/0086515 (2003-05-01), Trans et al.
patent: 2004/0103325 (2004-05-01), Priebatsch
patent: 2006/0062389 (2006-03-01), Mukherjee et al.
American Mathematical Society, vol. 39, No. 1. pp. 1-49, “On the Mathematical Foundations of Learning”, Felipe Cucker and Steve Smale published Oct. 5, 2001.
Advances in Computational Mathematics 13 (2000) pp. 1-50, “Regularization Networks and Support Vector Machines”, Theodoros Evgeniou, Massimiliano Pontil and Tomaso Poggio, received Jan. 13, 1999.
Neural Computation 10, pp. 1455-1480 (1998) MIT, “An Equivalence Between Sparse Approximation and Support Vector Machines”, Federico Girosi.
Advances in Computational Mathematics 10 (1999) pp. 51-80, “Generalization bounds for Function Approximation From Scattered Noisy Data”, P. Niyogi and F. Girosi.
Neural Computation dated Feb. 1994, “On the Relationship Between Generalization Error, Hypothesis Complexity, and Sample Complexity for Radial Basis Functions”, Partha Niyogi and Federico Girosi, pp. 1-24.
Thomas M. Cover & Joy A. Thomas, “Elements of Information Theory,” John Wiley & Sons, Inc., 1991, pp. vii-xxii; 529-542.
A. Pinkus, “n-Widths in Approximation Theory”, Springer-Verlag, 1985, pp. 1-3.
V. N. Vapnik, “The Nature of Statistical Learning Theory”, Springer, 2nded., 2000, pp. 18-19; 235-236.
V. N. Vapnik & A.Y. Chervoenkis, “Necessary and Sufficient Conditions for the Uniform Convergence of Means to their Expectations”, Teoriya Veroyatnostei I Ee Primeneiya (Theory of Probability and Its Applications), vol. XXVI, No. 3, 1981, pp. 532-553.
O. Goldreich, “Modern Cryptography, Probabilistic Proofs, and Pseudorandomness,” Springer, New York, 1999, pp. 7, 8, 10, 23, 34, 51, 52, 81, 82, and 118.
Gershenfeld Neil A.
Rahimi Ali
Recht Benjamin H.
Massachusetts Institute of Technology
Miles & Stockbridge P.C.
Srivastava Vivek
Woldemariam Nega
LandOfFree
Cryptographic system and methods using a one way... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Cryptographic system and methods using a one way..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cryptographic system and methods using a one way... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4279948