A Secure Frequency Computation Method over Multisets 


Vol. 39,  No. 6, pp. 370-378, Jun.  2014


PDF
  Abstract

It is well known that data mining plays a crucial role in varities of real-world applications, by which extracts knowledge from large volume of datasets. Among functionalties provided by data mining, frequency mining over given multisets is a basic and essential one. However, most of users would like to obtain the frequency over their multisets without revealing their own multisets. In this work, we come up with a novel way to achive this goal and prove its security rigorously. Our scheme has several advantages over existing work as follows: Firstly, our scheme has the most efficient computational complexity in the cardinality of multisets. Further our security proof is rigorously in the simulation paradigm. Lastly our system assumption is general.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

M. Kim and J. Park, "A Secure Frequency Computation Method over Multisets," The Journal of Korean Institute of Communications and Information Sciences, vol. 39, no. 6, pp. 370-378, 2014. DOI: .

[ACM Style]

Myungsun Kim and Jaesung Park. 2014. A Secure Frequency Computation Method over Multisets. The Journal of Korean Institute of Communications and Information Sciences, 39, 6, (2014), 370-378. DOI: .

[KICS Style]

Myungsun Kim and Jaesung Park, "A Secure Frequency Computation Method over Multisets," The Journal of Korean Institute of Communications and Information Sciences, vol. 39, no. 6, pp. 370-378, 6. 2014.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880