File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

박새롬

Park, Saerom
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.number 1 -
dc.citation.startPage 30 -
dc.citation.title INTERNATIONAL JOURNAL OF INFORMATION SECURITY -
dc.citation.volume 24 -
dc.contributor.author Lee, Joohee -
dc.contributor.author Cho, Sangrae -
dc.contributor.author Kim, Soohyung -
dc.contributor.author Park, Saerom -
dc.date.accessioned 2024-12-24T15:35:06Z -
dc.date.available 2024-12-24T15:35:06Z -
dc.date.created 2024-12-20 -
dc.date.issued 2025-02 -
dc.description.abstract In the current landscape of cloud-based data storage and analysis, concerns about data privacy and integrity have become more and more prevalent. Homomorphic encryption is a promising technology for preserving privacy by enabling computations on encrypted data while maintaining the confidentiality of sensitive information. However, relying solely on HE may pose challenges in ensuring the integrity of data and computation, which necessitates the verification of outsourced computations for users. In this paper, we propose a generic solution for verifiable computation over encrypted data. Our solution is based on a lattice-based approximate homomorphic encryption scheme with an MPC-in-the-Head style zero-knowledge proof system. We demonstrate that a user provided with a third party's certification of the computed function can verify the homomorphic evaluation over encrypted data. In the experiment, we provide a proof-of-concept implementation of our algorithms for privacy-preserving machine learning including regression, classification and validation. Our solution is post-quantum and can be extended to various scenarios such as privacy-preserving machine learning. -
dc.identifier.bibliographicCitation INTERNATIONAL JOURNAL OF INFORMATION SECURITY, v.24, no.1, pp.30 -
dc.identifier.doi 10.1007/s10207-024-00941-w -
dc.identifier.issn 1615-5262 -
dc.identifier.scopusid 2-s2.0-85210495019 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/85207 -
dc.identifier.wosid 001363400000002 -
dc.language 영어 -
dc.publisher SPRINGER -
dc.title Verifiable computation over encrypted data via MPC-in-the-head zero-knowledge proofs -
dc.type Article -
dc.description.isOpenAccess FALSE -
dc.relation.journalWebOfScienceCategory Computer Science, Information Systems; Computer Science, Software Engineering; Computer Science, Theory & Methods -
dc.relation.journalResearchArea Computer Science -
dc.type.docType Article -
dc.description.journalRegisteredClass scie -
dc.description.journalRegisteredClass scopus -
dc.subject.keywordAuthor Verifiable computation -
dc.subject.keywordAuthor Zero-knowledge proof -
dc.subject.keywordAuthor Homomorphic encryption -

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.