4.2 Article

Scalable Private Set Intersection Based on OT Extension

Related references

Note: Only part of the references are listed.
Proceedings Paper Computer Science, Information Systems

Malicious-Secure Private Set Intersection via Dual Execution

Peter Rindal et al.

CCS'17: PROCEEDINGS OF THE 2017 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (2017)

Proceedings Paper Computer Science, Information Systems

Improved Private Set Intersection Against Malicious Adversaries

Peter Rindal et al.

ADVANCES IN CRYPTOLOGY - EUROCRYPT 2017, PT I (2017)

Proceedings Paper Computer Science, Information Systems

Pushing the Communication Barrier in Secure Computation using Lookup Tables

Ghada Dessouky et al.

24TH ANNUAL NETWORK AND DISTRIBUTED SYSTEM SECURITY SYMPOSIUM (NDSS 2017) (2017)

Article Computer Science, Theory & Methods

Efficient Set Intersection with Simulation-Based Security

Michael J. Freedman et al.

JOURNAL OF CRYPTOLOGY (2016)

Proceedings Paper Computer Science, Information Systems

Efficient Batched Oblivious PRF with Applications to Private Set Intersection

Vladimir Kolesnikov et al.

CCS'16: PROCEEDINGS OF THE 2016 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (2016)

Proceedings Paper Computer Science, Information Systems

Ciphers for MPC and FHE

Martin R. Albrecht et al.

ADVANCES IN CRYPTOLOGY - EUROCRYPT 2015, PT I (2015)

Proceedings Paper Computer Science, Information Systems

More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries

Gilad Asharov et al.

ADVANCES IN CRYPTOLOGY - EUROCRYPT 2015, PT I (2015)

Proceedings Paper Computer Science, Information Systems

Secure and Efficient Private Set Intersection Cardinality Using Bloom Filter

Sumit Kumar Debnath et al.

INFORMATION SECURITY, ISC 2015 (2015)

Proceedings Paper Computer Science, Information Systems

ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation

Daniel Demmler et al.

22ND ANNUAL NETWORK AND DISTRIBUTED SYSTEM SECURITY SYMPOSIUM (NDSS 2015) (2015)

Proceedings Paper Computer Science, Theory & Methods

Efficient Garbling from a Fixed-Key Blockcipher

Mihir Bellare et al.

2013 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP) (2013)

Article Computer Science, Theory & Methods

MORE ROBUST HASHING: CUCKOO HASHING WITH A STASH

Adam Kirsch et al.

SIAM JOURNAL ON COMPUTING (2009)

Article Computer Science, Theory & Methods

Cuckoo hashing

R Pagh et al.

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC (2004)

Article Computer Science, Theory & Methods

The power of two choices in randomized load balancing

M Mitzenmacher

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (2001)