{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/privacy-preserving-clustering-a-new","title":"Privacy-Preserving Clustering: A New ApproachBased on Invariant Order Encryption","arxiv_id":null,"date":"2020-12-20","proceeding":null,"authors":["Mihail-Iulian Pleșa","Cezar Pleșca"],"abstract":"Cloud  computing  is  increasingly  used.  One  main  use  of  cloud  computing  is  the  running  of  a  machine  learning  algorithm.  Due  to the  large  amount  of  data  required  for  these  algorithms,  they  can  no  longer  be  run  on  personal  computers.  Uploading  personal  data  to  the  cloud  automatically  raises  the  issues  of  confidentiality  of  this  data.  In  this  paper,  we  show  through   a   series   of   experiments   that   an   order-preserving encryption algorithm can    be    applied    to    guarantee    the    confidentiality   of   the   input   of   two   well-known   clustering   algorithms: K-Means  and  DBSCAN.  We  show  that  K-Means can be modified to be applied over the encrypted data. We also proposed    a    slight    improvement    to    an    order-preserving encryption  scheme  to  ensure  that  it  is  randomized,  therefore increasing   its   security   level.   Finally,   after   studying   the   performance  of  clustering  algorithms  over  encrypted  data  we  show  a  practical  application  of  this  idea,  namely  the  color reduction over an encrypted image.","url_abs":"https://jmiltechnol.mta.ro/6/10_PLESA,%20PLESCA-min.pdf","url_pdf":"https://jmiltechnol.mta.ro/6/10_PLESA,%20PLESCA-min.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"privacy-preserving-clustering-a-new","repo_url":"https://github.com/miiip/OPEML","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"cloud-computing","task_name":"Cloud Computing"},{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"privacy-preserving","task_name":"Privacy Preserving"}],"methods":[{"method_slug":"k-means-clustering","method_name":"k-Means Clustering"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"miiip/OPEML","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"0a96afdd0dd35fb0292a0611848acd0a66a91203ef1c0dd8bc9923ada0349017","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}