Computing with data privacy: Steps toward realization

David W. Archer; Kurt Rohloff

doi:10.1109/MSP.2015.3

Computing with data privacy: Steps toward realization

David W. Archer, Kurt Rohloff

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

Abstract

Two new cryptographic methods - linear secret sharing (LSS) and fully homomorphic encryption (FHE) - allow computing on sensitive data without decrypting it. LSS and FHE differ in speed, ease of use, computational primitives, and cost.

Original language	English (US)
Article number	7031819
Pages (from-to)	22-29
Number of pages	8
Journal	IEEE Security and Privacy
Volume	13
Issue number	1
DOIs	https://doi.org/10.1109/MSP.2015.3
State	Published - Jan 2015

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Electrical and Electronic Engineering
Law

Keywords

FHE
LSS
cryptography
homomorphic encryption
linear secret sharing
privacy
secure multiparty computation

Access to Document

10.1109/MSP.2015.3

Cite this

@article{43b55fd688d34840b45ba33bb332aeeb,

title = "Computing with data privacy: Steps toward realization",

abstract = "Two new cryptographic methods - linear secret sharing (LSS) and fully homomorphic encryption (FHE) - allow computing on sensitive data without decrypting it. LSS and FHE differ in speed, ease of use, computational primitives, and cost.",

keywords = "FHE, LSS, cryptography, homomorphic encryption, linear secret sharing, privacy, secure multiparty computation",

author = "Archer, {David W.} and Kurt Rohloff",

note = "Publisher Copyright: {\textcopyright} 2003-2012 IEEE.",

year = "2015",

month = jan,

doi = "10.1109/MSP.2015.3",

language = "English (US)",

volume = "13",

pages = "22--29",

journal = "IEEE Security and Privacy",

issn = "1540-7993",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "1",

}

TY - JOUR

T1 - Computing with data privacy

T2 - Steps toward realization

AU - Archer, David W.

AU - Rohloff, Kurt

PY - 2015/1

Y1 - 2015/1

N2 - Two new cryptographic methods - linear secret sharing (LSS) and fully homomorphic encryption (FHE) - allow computing on sensitive data without decrypting it. LSS and FHE differ in speed, ease of use, computational primitives, and cost.

AB - Two new cryptographic methods - linear secret sharing (LSS) and fully homomorphic encryption (FHE) - allow computing on sensitive data without decrypting it. LSS and FHE differ in speed, ease of use, computational primitives, and cost.

KW - FHE

KW - LSS

KW - cryptography

KW - homomorphic encryption

KW - linear secret sharing

KW - privacy

KW - secure multiparty computation

UR - http://www.scopus.com/inward/record.url?scp=84922941535&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84922941535&partnerID=8YFLogxK

U2 - 10.1109/MSP.2015.3

DO - 10.1109/MSP.2015.3

M3 - Article

AN - SCOPUS:84922941535

SN - 1540-7993

VL - 13

SP - 22

EP - 29

JO - IEEE Security and Privacy

JF - IEEE Security and Privacy

IS - 1

M1 - 7031819

ER -

Computing with data privacy: Steps toward realization

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this