메뉴 건너뛰기




Volumn 34, Issue 1, 2010, Pages 53-72

Private predictions on hidden Markov models

Author keywords

Hidden Markov models; Performance; Prediction; Privacy

Indexed keywords

PERFORMANCE; PERFORMANCE PREDICTION; PREDICTION PROBLEM; PREDICTION SYSTEMS; PRIVACY CONCERNS; PRIVACY-PRESERVING PROTOCOLS; PRIVATE INFORMATION;

EID: 77953583996     PISSN: 02692821     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10462-010-9161-2     Document Type: Article
Times cited : (10)

References (45)
  • 4
    • 33646508997 scopus 로고    scopus 로고
    • A Tight lower bound for restricted pir protocols
    • DOI 10.1007/s00037-006-0208-3
    • R Beigel L Fortnow W Gasarch 2006 A nearly tight lower bound for restricted private information retrieval protocols Comput Complex 15 1 82 91 1099.68035 10.1007/s00037-006-0208-3 2226071 (Pubitemid 43706827)
    • (2006) Computational Complexity , vol.15 , Issue.1 , pp. 82-91
    • Beigel, R.1    Fortnow, L.2    Gasarch, W.3
  • 5
    • 54249090811 scopus 로고    scopus 로고
    • A single initialization server for multi-party cryptography
    • 10.1007/978-3-540-85093-9-8
    • H Blier A Tapp 2008 A single initialization server for multi-party cryptography Lect Notes Comput Sci 5155 71 85 10.1007/978-3-540-85093-9-8
    • (2008) Lect Notes Comput Sci , vol.5155 , pp. 71-85
    • Blier, H.1    Tapp, A.2
  • 6
    • 32844467091 scopus 로고    scopus 로고
    • Structural hidden Markov models using a relation of equivalence: Application to automotive designs
    • DOI 10.1007/s10618-005-0020-8
    • D Bouchaffra J Tan 2006 Structural hidden Markov models using a relation of equivalence: application to automotive designs Data Min Knowl Discov 12 1 79 96 10.1007/s10618-005-0020-8 2225528 (Pubitemid 43255932)
    • (2006) Data Mining and Knowledge Discovery , vol.12 , Issue.1 , pp. 79-96
    • Bouchaffra, D.1    Tan, J.2
  • 7
    • 1642602228 scopus 로고    scopus 로고
    • Computationally private information retrieval with polylogarithmic communication. Advances in Cryptology: EUROCRYPT '99
    • 10.1007/3-540-48910-X-28
    • C Cachin S Micali M Stadler 1999 Computationally private information retrieval with polylogarithmic communication. Advances in Cryptology: EUROCRYPT '99 Lect Notes Comput Sci 1592 402 414 10.1007/3-540-48910-X-28
    • (1999) Lect Notes Comput Sci , vol.1592 , pp. 402-414
    • Cachin, C.1    Micali, S.2    Stadler, M.3
  • 9
    • 0032201622 scopus 로고    scopus 로고
    • Private information retrieval
    • 1065.68524 10.1145/293347.293350 1678848
    • B Chor O Goldreich E Kushilevitz M Sudan 1998 Private information retrieval J ACM 45 6 965 982 1065.68524 10.1145/293347.293350 1678848
    • (1998) J ACM , vol.45 , Issue.6 , pp. 965-982
    • Chor, B.1    Goldreich, O.2    Kushilevitz, E.3    Sudan, M.4
  • 10
    • 54249132643 scopus 로고    scopus 로고
    • Statistical security conditions for two-party secure function evaluation
    • 10.1007/978-3-540-85093-9-9
    • C Crépeau J Wullschleger 2008 Statistical security conditions for two-party secure function evaluation Lect Notes Comput Sci 5155 86 99 10.1007/978-3-540-85093-9-9
    • (2008) Lect Notes Comput Sci , vol.5155 , pp. 86-99
    • Crépeau, C.1    Wullschleger, J.2
  • 11
    • 56749102679 scopus 로고    scopus 로고
    • Peer-to-peer private information retrieval
    • 10.1007/978-3-540-87471-3-26
    • J Domingo-Ferrer M Bras-Amorós 2008 Peer-to-peer private information retrieval Lect Notes Comput Sci 5262 315 323 10.1007/978-3-540- 87471-3-26
    • (2008) Lect Notes Comput Sci , vol.5262 , pp. 315-323
    • Domingo-Ferrer, J.1    Bras-Amorós, M.2
  • 18
    • 40249094508 scopus 로고    scopus 로고
    • A linear lower bound on the communication complexity of single-server private information retrieval
    • 10.1007/978-3-540-78524-8-25 2494156
    • I Haitner JJ Hoch G Segev 2008 A linear lower bound on the communication complexity of single-server private information retrieval Lect Notes Comput Sci 4948 445 464 10.1007/978-3-540-78524-8-25 2494156
    • (2008) Lect Notes Comput Sci , vol.4948 , pp. 445-464
    • Haitner, I.1    Hoch, J.J.2    Segev, G.3
  • 20
    • 77953604043 scopus 로고    scopus 로고
    • Road sign detection and recognition using hidden Markov model
    • J Hsien Y Liou S Chen 2006 Road sign detection and recognition using hidden Markov model Asian J Health Inf Sci 1 1 85 100
    • (2006) Asian J Health Inf Sci , vol.1 , Issue.1 , pp. 85-100
    • Hsien, J.1    Liou, Y.2    Chen, S.3
  • 21
    • 48249157833 scopus 로고    scopus 로고
    • Low-computation oblivious transfer scheme for private information retrieval
    • 2478517
    • HF Huang CC Chang 2008 Low-computation oblivious transfer scheme for private information retrieval Int J Innov Comput Inf Control 4 6 1365 1370 2478517
    • (2008) Int J Innov Comput Inf Control , vol.4 , Issue.6 , pp. 1365-1370
    • Huang, H.F.1    Chang, C.C.2
  • 23
    • 1842610660 scopus 로고    scopus 로고
    • Quantum symmetrically-private information retrieval
    • 1177.68081 10.1016/j.ipl.2004.02.003
    • I Kerenidis R Wolf 2004 Quantum symmetrically-private information retrieval Inf Process Lett 90 3 109 114 1177.68081 10.1016/j.ipl.2004.02.003
    • (2004) Inf Process Lett , vol.90 , Issue.3 , pp. 109-114
    • Kerenidis, I.1    Wolf, R.2
  • 24
    • 54249097947 scopus 로고    scopus 로고
    • A practical universal circuit construction and secure evaluation of private functions
    • 10.1007/978-3-540-85230-8-7
    • V Kolesnikov T Schneider 2008 A practical universal circuit construction and secure evaluation of private functions Lect Notes Comput Sci 5143 83 97 10.1007/978-3-540-85230-8-7
    • (2008) Lect Notes Comput Sci , vol.5143 , pp. 83-97
    • Kolesnikov, V.1    Schneider, T.2
  • 26
    • 38149125521 scopus 로고    scopus 로고
    • Accredited symmetrically private information retrieval
    • 10.1007/978-3-540-75651-4-18
    • M Layouni 2007 Accredited symmetrically private information retrieval Lect Notes Comput Sci 4752 262 277 10.1007/978-3-540-75651-4-18
    • (2007) Lect Notes Comput Sci , vol.4752 , pp. 262-277
    • Layouni, M.1
  • 27
    • 38049136534 scopus 로고    scopus 로고
    • An efficient protocol for secure two-party computation in the presence of malicious adversaries
    • 10.1007/978-3-540-72540-4-4 2449203
    • Y Lindell B Pinkas 2007 An efficient protocol for secure two-party computation in the presence of malicious adversaries Lect Notes Comput Sci 4515 52 78 10.1007/978-3-540-72540-4-4 2449203
    • (2007) Lect Notes Comput Sci , vol.4515 , pp. 52-78
    • Lindell, Y.1    Pinkas, B.2
  • 28
    • 56649091142 scopus 로고    scopus 로고
    • New communication-efficient oblivious transfer protocols based on pairings
    • 10.1007/978-3-540-85886-7-30
    • H Lipmaa 2008 New communication-efficient oblivious transfer protocols based on pairings Lect Notes Comput Sci 5222 441 454 10.1007/978-3-540-85886-7- 30
    • (2008) Lect Notes Comput Sci , vol.5222 , pp. 441-454
    • Lipmaa, H.1
  • 29
    • 29244457240 scopus 로고    scopus 로고
    • Secure multi-party computation made simple
    • DOI 10.1016/j.dam.2005.03.020, PII S0166218X05002428
    • U Maurer 2006 Secure multi-party computation made simple Discret Appl Math 154 2 370 381 1091.94035 10.1016/j.dam.2005.03.020 2194409 (Pubitemid 41827525)
    • (2006) Discrete Applied Mathematics , vol.154 , Issue.2 , pp. 370-381
    • Maurer, U.1
  • 30
    • 33746918412 scopus 로고    scopus 로고
    • Learning nonsingular phylogenies and hidden Markov models
    • DOI 10.1214/105051606000000024
    • E Mossel S Roch 2006 Learning nonsingular phylogenies and hidden Markov models Ann Appl Probab 16 2 583 614 1137.60034 10.1214/105051606000000024 2244426 (Pubitemid 44196526)
    • (2006) Annals of Applied Probability , vol.16 , Issue.2 , pp. 583-614
    • Mossel, E.1    Roch, S.2
  • 31
  • 32
    • 67651017547 scopus 로고    scopus 로고
    • Occam and Bayes in predicting category intuitiveness
    • 10.1007/s10462-009-9102-0
    • EM Pothos 2009 Occam and Bayes in predicting category intuitiveness Artif Intell Rev 28 3 257 274 10.1007/s10462-009-9102-0
    • (2009) Artif Intell Rev , vol.28 , Issue.3 , pp. 257-274
    • Pothos, E.M.1
  • 33
    • 59649104116 scopus 로고    scopus 로고
    • Querying pathways in protein interaction networks based on hidden Markov models
    • 10.1089/cmb.2008.02TT 2487545
    • X Qian S Sze B Yoon 2009 Querying pathways in protein interaction networks based on hidden Markov models J Comput Biol 16 2 145 157 10.1089/cmb.2008.02TT 2487545
    • (2009) J Comput Biol , vol.16 , Issue.2 , pp. 145-157
    • Qian, X.1    Sze, S.2    Yoon, B.3
  • 34
    • 48249101624 scopus 로고    scopus 로고
    • Modelling stabilograms with hidden Markov models
    • 10.1080/03091900600968908
    • J Rasku M Juhola T Tossavainen I Pyykko S Toppila 2008 Modelling stabilograms with hidden Markov models J Med Eng Technol 32 4 273 283 10.1080/03091900600968908
    • (2008) J Med Eng Technol , vol.32 , Issue.4 , pp. 273-283
    • Rasku, J.1    Juhola, M.2    Tossavainen, T.3    Pyykko, I.4    Toppila, S.5
  • 35
    • 68549133148 scopus 로고    scopus 로고
    • Providing predictions on distributed HMMs with privacy
    • 10.1007/s10462-009-9106-9
    • S Renckes H Polat Y Oysal 2008 Providing predictions on distributed HMMs with privacy Artif Intell Rev 28 4 343 362 10.1007/s10462-009-9106-9
    • (2008) Artif Intell Rev , vol.28 , Issue.4 , pp. 343-362
    • Renckes, S.1    Polat, H.2    Oysal, Y.3
  • 36
    • 43449102012 scopus 로고    scopus 로고
    • Hidden Markov models for the assessment of chromosomal alterations using high-throughput SNP arrays
    • 05591294 2524352
    • RB Scharpf G Parmigiani J Pevsner I Ruczinski 2008 Hidden Markov models for the assessment of chromosomal alterations using high-throughput SNP arrays Ann Appl Probab 2 2 687 713 05591294 2524352
    • (2008) Ann Appl Probab , vol.2 , Issue.2 , pp. 687-713
    • Scharpf, R.B.1    Parmigiani, G.2    Pevsner, J.3    Ruczinski, I.4
  • 38
    • 33748149905 scopus 로고    scopus 로고
    • Mining free-structured information based on hidden Markov models
    • DOI 10.1016/j.eswa.2005.11.022, PII S0957417405003118
    • B Tso PY Chang 2007 Mining free-structured information based on hidden Markov models Expert Syst Appl 32 1 97 102 10.1016/j.eswa.2005.11.022 (Pubitemid 44311468)
    • (2007) Expert Systems with Applications , vol.32 , Issue.1 , pp. 97-102
    • Tso, B.1    Chang, P.Y.2
  • 41
    • 53849129991 scopus 로고    scopus 로고
    • Detecting LTR structures in human genomic sequences using profile hidden Markov models
    • 10.1016/j.eswa.2007.10.045
    • LC Wu HD Huang YC Chang YC Lee JT Horng 2009 Detecting LTR structures in human genomic sequences using profile hidden Markov models Expert Syst Appl 36 668 674 10.1016/j.eswa.2007.10.045
    • (2009) Expert Syst Appl , vol.36 , pp. 668-674
    • Wu, L.C.1    Huang, H.D.2    Chang, Y.C.3    Lee, Y.C.4    Horng, J.T.5
  • 42
    • 33646358700 scopus 로고    scopus 로고
    • Experimental analysis of a privacy-preserving scalar product protocol
    • Z Yang RN Wright H Subramaniam 2006 Experimental analysis of a privacy-preserving scalar product protocol Int J Comput Syst Sci Eng 21 1 47 52
    • (2006) Int J Comput Syst Sci Eng , vol.21 , Issue.1 , pp. 47-52
    • Yang, Z.1    Wright, R.N.2    Subramaniam, H.3
  • 44
    • 38149103408 scopus 로고    scopus 로고
    • Visual speech recognition using motion features and hidden Markov models
    • 10.1007/978-3-540-74272-2-103
    • WC Yau DK Kumar H Weghorn 2007 Visual speech recognition using motion features and hidden Markov models Lect Notes Comput Sci 4673 832 839 10.1007/978-3-540-74272-2-103
    • (2007) Lect Notes Comput Sci , vol.4673 , pp. 832-839
    • Yau, W.C.1    Kumar, D.K.2    Weghorn, H.3
  • 45
    • 58149496207 scopus 로고    scopus 로고
    • A hidden Markov model-based text classification of medical documents
    • 10.1177/0165551508092257
    • K Yi J Beheshti 2009 A hidden Markov model-based text classification of medical documents J Inf Sci 35 1 67 81 10.1177/0165551508092257
    • (2009) J Inf Sci , vol.35 , Issue.1 , pp. 67-81
    • Yi, K.1    Beheshti, J.2


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