New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness
From MaRDI portal
Publication:2988351
DOI10.1007/978-3-319-53177-9_14zbMath1381.94068OpenAlexW2587185606MaRDI QIDQ2988351
Ratna Dutta, Sumit Kumar Debnath
Publication date: 19 May 2017
Published in: Information Security and Cryptology – ICISC 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53177-9_14
Related Items (2)
Quantum secure multi-party private set intersection cardinality ⋮ Secure and efficient multiparty private set intersection cardinality
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient set intersection with simulation-based security
- Secure and efficient private set intersection cardinality using Bloom filter
- A Fair and Efficient Mutual Private Set Intersection Protocol from a Two-Way Oblivious Pseudorandom Function
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
- Efficient Private Set Intersection Cardinality in the Presence of Malicious Adversaries
- Efficient Set Operations in the Presence of Malicious Adversaries
- Fast Secure Computation of Set Intersection
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Private Intersection of Certified Sets
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - CRYPTO 2003
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Privacy-Preserving Set Operations
- Information Security and Cryptology - ICISC 2005
This page was built for publication: New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness
