메뉴 건너뛰기




Volumn 15, Issue 5, 2015, Pages

Secure distributed genome analysis for GWAS and sequence comparison computation

Author keywords

GWAS computation; Hamming distance; iDASH competition; oblivious merge; oblivious sorting; secret sharing; secure genome analysis

Indexed keywords

COMPETITION; EXPERIMENTAL MODEL; FEASIBILITY STUDY; GENE FREQUENCY; GENOME ANALYSIS; GENOME-WIDE ASSOCIATION STUDY; HUMAN; HUMAN EXPERIMENT; STATISTICS; ALGORITHM; COMPUTER SECURITY; DNA SEQUENCE; PROCEDURES; STANDARDS;

EID: 84977541139     PISSN: None     EISSN: 14726947     Source Type: Journal    
DOI: 10.1186/1472-6947-15-S5-S4     Document Type: Article
Times cited : (33)

References (17)
  • 5
    • 0018545449 scopus 로고
    • How to share a secret
    • Shamir A: How to share a secret. Communications of the ACM. 1979, 22 (11): 612-613.
    • (1979) Communications of the ACM , vol.22 , Issue.11 , pp. 612-613
    • Shamir, A.1
  • 7
    • 0000731055 scopus 로고    scopus 로고
    • Security and composition of multiparty cryptographic protocols
    • Canetti R: Security and composition of multiparty cryptographic protocols. Journal of Cryptology. 2000, 13 (1): 143-202.
    • (2000) Journal of Cryptology , vol.13 , Issue.1 , pp. 143-202
    • Canetti, R.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.