New realizations of efficient and secure private set intersection protocols preserving fairness

DOI10.1007/978-3-319-53177-9_14MaRDI QIDQ2988351zbMATH OpenOpenAlexFDO

Authors Sumit Kumar Debnath, Ratna Dutta

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

zbMATH Keywords

fairnessmalicious adversarymPSImPSI-CAsemi-trusted arbiter

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Provably secure fair mutual private set intersection cardinality utilizing Bloom filter
• Efficient private set intersection cardinality in the presence of malicious adversaries
• Linear-complexity private set intersection protocols secure in malicious model
• A fair and efficient mutual private set intersection protocol from a two-way oblivious pseudorandom function
• Secure and efficient multiparty private set intersection cardinality

Cites work

• 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
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - EUROCRYPT 2004
• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
• Efficient private set intersection cardinality in the presence of malicious adversaries
• Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
• Efficient set intersection with simulation-based security
• Efficient set operations in the presence of malicious adversaries
• Fast secure computation of set intersection
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 1186931 (Why is no real title available?)
• scientific article; zbMATH DE number 1302835 (Why is no real title available?)
• scientific article; zbMATH DE number 708820 (Why is no real title available?)
• scientific article; zbMATH DE number 1088250 (Why is no real title available?)
• Information Security and Cryptology - ICISC 2005
• Linear-complexity private set intersection protocols secure in malicious model
• Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
• Privacy-Preserving Set Operations
• Private intersection of certified sets
• Secure and efficient private set intersection cardinality using Bloom filter

Cited in

(5)

• Secure and efficient multiparty private set intersection cardinality
• Quantum secure multi-party private set intersection cardinality
• A fair and efficient mutual private set intersection protocol from a two-way oblivious pseudorandom function
• Provably secure fair mutual private set intersection cardinality utilizing Bloom filter
• Practical multi-party private set intersection cardinality and intersection-sum under arbitrary collusion

This page was built for publication: New realizations of efficient and secure private set intersection protocols preserving fairness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988351)