The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Aug. 03, 2021
Filed:
Jun. 30, 2017
Nippon Telegraph and Telephone Corporation, Chiyoda-ku, JP;
Tohoku University, Sendai, JP;
Koki Hamada, Musashino, JP;
Koji Chida, Musashino, JP;
Satoshi Hasegawa, Musashino, JP;
Masao Nagasaki, Sendai, JP;
Kazuharu Misawa, Sendai, JP;
NIPPON TELEGRAPH AND TELEPHONE CORPORATION, Chiyoda-ku, JP;
TOHOKU UNIVERSITY, Sendai, JP;
Abstract
Fisher's exact test is efficiently computed through secure computation. It is assumed that a, b, c and d are frequencies of a 2×2 contingency table, [a], [b], [c] and [d] are secure texts of the respective frequencies a, b, c and d, and N is an upper bound satisfying a+b+c+dN. A reference frequency computation part computes a secure text ([a], [b], [c], [d]) of a combination of reference frequencies (a, b, c, d) which are integers satisfying a+b=a+b, c+d=c+d, a+c=a+c, and b+d=b+d. A number-of-patterns determination part determines integers hand hsatisfying h≤h. A pattern computation part computes [ai]=[a]+i, [b]=[b]−i, [c]=[c]−i and [d]=[d]+i for i=h, . . . , h, and obtains a set S={([a], [b], [c], [d])}of secure texts of combinations of frequencies (a, b, c, d).