Method for classifying private information securely

Details Method for classifying private information securely Method for classifying private information securely

2005-10-07

2010-02-02

Arani, Taghi (Department: 2438)

Cryptography

Particular algorithmic function encoding

C380S029000, C380S030000, C713S189000, C708S490000

Reexamination Certificate

active

07657028

ABSTRACT:
A method for securely classifying private data x of a first party Alice using a classifier H(x) of a second party Bob. The classifier isH⁡(x)=sign⁢⁢(∑n=1N⁢hn⁡(x)),wherehn⁡(x)={αnxT⁢yn>Θnβnotherwise,αn,βnand Θnare scalar values and ynis a vector storing parameters of the classifier. Bob generates a set of N random numbers, S1, . . . , SN, such thats=∑n=1N⁢sn,for each n=1, . . . , N, the following substeps are performed: applying a secure dot product to xTynto obtain anfor Alice and bnfor Bob; applying a secure millionaire protocol to determine whether anis larger than Θn−bn, and returning a result of an+Sn, or βn+Sn; accumulating, by Alice, the result in cn. Then, apply the secure millionaire protocol to determine whetherc=∑n=1N⁢cnis larger thans=∑n=1N⁢sn,and returning a positive sign if true, and a negative sign if false to classify the private data x.

REFERENCES:
patent: 2007/0053507 (2007-03-01), Smaragdis et al.
Yoav Freund, Robert E. Schapire; “A Short Introduction to Boosting”, Sep. 1999; Journal of Japanese Society for Artificial Intelligence.
Andrew C. Yao, “Protocols for Secure Computations”, 1982, IEEE.
N.N. Aizanberg, Yu. L. Ivaskiv, D.A. Pospelov, G.F. Khudyakov; “Multi-Valued Threshold Functions”, Jul.-Aug. 1971;Kibernetika.
Y.C. Chang; C.J. Lu “Oblivious polynomial evaluation and oblivious neural learning”; Springer-Verlag, 2001; AsiaCrypt:Advances in Cryptology.
Wikipedia (http://en.wikipedia.org/wiki/Sigmoid—function)—Sigmoid Function.
Wikipedia (hrrp://en.wikipedia.org/wiki/K-nearest—neighbor—algorithm)—K-nearest neighbor (k-nn) algorithm.
*Yoav Freund, Robert E. Schapire; “A Short Introduction to Boosting”, Sep. 1999; Journal of Japanese Society for Artificial Intelligence.
Wikipedia (http://en.wikipedia.org/wiki/Sigmoid—function)—Sigmoid Function, Cited as known concept, updated in wikipedia, Jan. 24, 2004 (Wayback machine).
Wikipedia (hrrp://en.wikipedia.org/wiki/K-nearest—neighbor—algorithm)—K-nearest neighbor (k-nn) algorithm, cited as known concept, updated in wikipedia , Dec. 2005.
Y.C. Chang and C.J. Lu.Oblivious polynomial evaluation and oblivious neural learning. In AsiaCrypt: Advances in Cryptology. LNCS, Springer-Verlag, 2001.
B. Chor, O. Goldreich, E. Kushilevitz and M. Sudan.Private Information Retrieval. FOCS, 1995.
S. Even, O. Goldreich and A. Lempel,A Randomized Protocol for Signing Contracts, Communications of the ACM 28, pp. 637-647, 1985.
E. Kushilevitz and R. Ostrovsky.Replication Is Not Needed: Single Database, Computationally-Private Information Retrieval. FOCS 1997.
Y. Lindell and B. Pinkas,Privacy preserving data mining. In Advances in Cryptology—Crypto2000, LNCS 1880, 2000.
M. Naor and B. Pinkas,Oblivious Polynomial Evaluation. In Proc. of the 31st Symp. on Theory of Computer Science (STOC), Atlanta, GA, pp. 245-254, May 1-4, 1999.
M. Naor and B. Pinkas,Efficient Oblivious Transfer Protocols. In Proc. of the twelfth annual ACM-SIAM symposium on Discrete algorithms , Washington, D.C., USA pp. 448-457, 2001.
Avidan S et al.; “Blind Vision”; Computer Vision- ECCV 2006, 9thEuropean Conference on Computer Vision. Proceedings, Part III. Lecture Notes in Computer Science, Springer-Verlag, vol. 3953, May 13, 2006 pp. 1-13.

Affiliated with

Also associated with

Rating

Method for classifying private information securely 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 for classifying private information securely, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for classifying private information securely will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4192117