Circuit-PSI With Linear Complexity via Relaxed Batch OPPRF

In 2-party Circuit-based Private Set Intersection (Circuit-PSI), P0 and P1 hold sets S0 and S1 respectively and wish to securely compute a function f over the set S0 ∩ S1 (e.g., cardinality, sum over associated attributes, or threshold intersection). Following a long line of work, Pinkas et al. (PST...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Chandran Nishanth, Gupta Divya, Shah Akash
Formato:	article
Lenguaje:	EN
Publicado:	Sciendo 2022
Materias:	private set intersection (psi) circuit-psi secure two party computation Ethics BJ1-1725 Electronic computers. Computer science QA75.5-76.95
Acceso en línea:	https://doaj.org/article/6dd0550a25da4c74aef589dff20387d2
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:6dd0550a25da4c74aef589dff20387d2
record_format	dspace
spelling	oai:doaj.org-article:6dd0550a25da4c74aef589dff20387d22021-12-05T14:11:10ZCircuit-PSI With Linear Complexity via Relaxed Batch OPPRF2299-098410.2478/popets-2022-0018https://doaj.org/article/6dd0550a25da4c74aef589dff20387d22022-01-01T00:00:00Zhttps://doi.org/10.2478/popets-2022-0018https://doaj.org/toc/2299-0984In 2-party Circuit-based Private Set Intersection (Circuit-PSI), P0 and P1 hold sets S0 and S1 respectively and wish to securely compute a function f over the set S0 ∩ S1 (e.g., cardinality, sum over associated attributes, or threshold intersection). Following a long line of work, Pinkas et al. (PSTY, Eurocrypt 2019) showed how to construct a concretely efficient Circuit-PSI protocol with linear communication complexity. However, their protocol requires super-linear computation.Chandran NishanthGupta DivyaShah AkashSciendoarticleprivate set intersection (psi)circuit-psisecure two party computationEthicsBJ1-1725Electronic computers. Computer scienceQA75.5-76.95ENProceedings on Privacy Enhancing Technologies, Vol 2022, Iss 1, Pp 353-372 (2022)
institution	DOAJ
collection	DOAJ
language	EN
topic	private set intersection (psi) circuit-psi secure two party computation Ethics BJ1-1725 Electronic computers. Computer science QA75.5-76.95
spellingShingle	private set intersection (psi) circuit-psi secure two party computation Ethics BJ1-1725 Electronic computers. Computer science QA75.5-76.95 Chandran Nishanth Gupta Divya Shah Akash Circuit-PSI With Linear Complexity via Relaxed Batch OPPRF
description	In 2-party Circuit-based Private Set Intersection (Circuit-PSI), P0 and P1 hold sets S0 and S1 respectively and wish to securely compute a function f over the set S0 ∩ S1 (e.g., cardinality, sum over associated attributes, or threshold intersection). Following a long line of work, Pinkas et al. (PSTY, Eurocrypt 2019) showed how to construct a concretely efficient Circuit-PSI protocol with linear communication complexity. However, their protocol requires super-linear computation.
format	article
author	Chandran Nishanth Gupta Divya Shah Akash
author_facet	Chandran Nishanth Gupta Divya Shah Akash
author_sort	Chandran Nishanth
title	Circuit-PSI With Linear Complexity via Relaxed Batch OPPRF
title_short	Circuit-PSI With Linear Complexity via Relaxed Batch OPPRF
title_full	Circuit-PSI With Linear Complexity via Relaxed Batch OPPRF
title_fullStr	Circuit-PSI With Linear Complexity via Relaxed Batch OPPRF
title_full_unstemmed	Circuit-PSI With Linear Complexity via Relaxed Batch OPPRF
title_sort	circuit-psi with linear complexity via relaxed batch opprf
publisher	Sciendo
publishDate	2022
url	https://doaj.org/article/6dd0550a25da4c74aef589dff20387d2
work_keys_str_mv	AT chandrannishanth circuitpsiwithlinearcomplexityviarelaxedbatchopprf AT guptadivya circuitpsiwithlinearcomplexityviarelaxedbatchopprf AT shahakash circuitpsiwithlinearcomplexityviarelaxedbatchopprf
_version_	1718371304370864128

Circuit-PSI With Linear Complexity via Relaxed Batch OPPRF

Ejemplares similares