Labeled PSI from Homomorphic Encryption with Reduced Computation and Communication

Reference. Labeled PSI from Homomorphic Encryption with Reduced Computation and Communication

Kelong Cong, Radames Cruz Moreno, Mariana Botelho da Gama, Wei Dai, Ilia Iliashenko, Kim Laine, Michael Rosenberg · CCS · 2021 · security · DOI

Cite

Cite as @cong-2021-labeled (helia, typst) · \cite{cong-2021-labeled} (LaTeX)

BibTeX

bibtex · 1 line

@inproceedings{cong-2021-labeled, series={CCS ’21}, title={Labeled PSI from Homomorphic Encryption with Reduced Computation and Communication}, url={http://dx.doi.org/10.1145/3460120.3484760}, DOI={10.1145/3460120.3484760}, booktitle={Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security}, publisher={ACM}, author={Cong, Kelong and Moreno, Radames Cruz and da Gama, Mariana Botelho and Dai, Wei and Iliashenko, Ilia and Laine, Kim and Rosenberg, Michael}, year={2021}, month=Nov, pages={1135–1150}, collection={CCS ’21} }

hayagriva YAML (typst)

yaml · 25 lines

cong-2021-labeled:
  type: article
  title: Labeled PSI from Homomorphic Encryption with Reduced Computation and Communication
  author:
  - Cong, Kelong
  - Moreno, Radames Cruz
  - name: Gama
    given-name: Mariana Botelho
    prefix: da
  - Dai, Wei
  - Iliashenko, Ilia
  - Laine, Kim
  - Rosenberg, Michael
  date: 2021-11
  page-range: 1135-1150
  url: http://dx.doi.org/10.1145/3460120.3484760
  serial-number:
    doi: 10.1145/3460120.3484760
  parent:
    type: proceedings
    title: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security
    publisher: ACM
    parent:
      type: proceedings
      title: CCS ’21

Download: cong-2021-labeled.bib · cong-2021-labeled.yml

Cites 59 works (0 here)

External (59)

All the Numbers are US: Large-scale Abuse of Contact Discovery in Mobile Messengers (2021)
Password Monitor: Safeguarding passwords in Microsoft Edge (2021)
NTL: A Library for doing Number Theory (11.4.3) (2021)
Revisiting Homomorphic Encryption Schemes for Finite Fields (2021)
Private Set Intersection in the Internet Setting from Lightweight Oblivious PRF (2020)
PSI from PaXoS: Fast, Malicious Private Set Intersection (2020)
Epione: Lightweight contact tracing with strong privacy (2020)
Design and implementation of HElib: a homomorphic encryption library (2020)
A note on the calculation of some functions in finite fields: Tricks of the Trade (2020)
Mobile Private Contact Discovery at Scale (2019)
PIR with Compressed Queries and Amortized Query Processing (2018)
Labeled PSI from Fully Homomorphic Encryption with Malicious Security (2018)
Efficient Circuit-Based PSI via Cuckoo Hashing (2018)
Faster Unbalanced Private Set Intersection (2018)
Validating Leaked Passwords with k-Anonymity (2018)
Fast Private Set Intersection from Homomorphic Encryption (2017)
Private Set Intersection for Unequal Set Sizes with Mobile Applications (2017)
Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection (2017)
Malicious-Secure Private Set Intersection via Dual Execution (2017)
Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds (2016)
Efficient Batched Oblivious PRF with Applications to Private Set Intersection (2016)
On the concrete hardness of Learning with Errors (2015)
FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second (2015)
Phasing: Private Set Intersection Using Permutation-based Hashing (2015)
FourQ: four-dimensional decompositions on a Q-curve over the Mersenne prime (2015)
Efficient Fully Homomorphic Encryption from (Standard) $\mathsfLWE $ (2014)
Cuckoo Filter: Practically Better Than Bloom (2014)
Fully homomorphic SIMD operations (2014)
The Difficulty Of Private Contact Discovery (2014)
Faster Private Set Intersection Based on OT Extension (2014)
Elligator: elliptic-curve points indistinguishable from uniform random strings (2013)
When private set intersection meets big data (2013)
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based (2013)
On Ideal Lattices and Learning with Errors over Rings (2013)
Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP (2012)
(Leveled) fully homomorphic encryption without bootstrapping (2012)
Homomorphic Evaluation of the AES Circuit (2012)
Somewhat Practical Fully Homomorphic Encryption (2012)
Private Set Intersection: Are Garbled Circuits Better than Custom Protocols? (2012)
(If) Size Matters: Size-Hiding Private Set Intersection (2011)
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages (2011)
Some extremal postage stamp bases (2010)
Fast Secure Computation of Set Intersection (2010)
Fully homomorphic encryption using ideal lattices (2009)
Secure Two-Party Computation Is Practical (2009)
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries (2008)
Keyword Search and Oblivious Pseudorandom Functions (2005)
On lattices, learning with errors, random linear codes, and cryptography (2005)
Efficient Private Matching and Set Intersection (2004)
Number-theoretic constructions of efficient pseudo-random functions (2004)
Extending Oblivious Transfers Efficiently (2003)
Privacy, economics, and price discrimination on the Internet (2003)
Enhancing privacy and trust in electronic communities (1999)
Private information retrieval by keywords (1997)
Two New Techniques for Computing Extremal h-bases Ak (1993)
A More Efficient Cryptographic Matchmaking Protocol for Use in the Absence of a Continuously Available Third Party (1986)
How to generate and exchange secrets (1986)
New directions in cryptography (1976)
On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials (1973)