Comparing two sets without disclosing them

DOI10.1007/S11432-008-0112-3MaRDI QIDQ948505zbMATH OpenOpenAlexFDO

Authors Shundong Li, Yiqi Dai, Ping Luo, Daoshun Wang

Publication date 16 October 2008

Published in Science in China. Series F (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11432-008-0112-3

zbMATH Keywords

cryptographysecure multiparty computationsecurityset equality problemsolution

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 7267018
• scientific article; zbMATH DE number 2112427
• Secure multi-party computation solution to Yao's millionaires' problem based on set-inclusion
• A secure multi-party computation solution to intersection problems of sets and rectangles
• Secure computation of two set-relationships with the unencrypted method

Cites work

• Advances in Cryptology - EUROCRYPT 2004
• Foundations of Cryptography
• scientific article; zbMATH DE number 5169253 (Why is no real title available?)
• Survey of information security
• The Probabilistic Communication Complexity of Set Intersection

Cited in

(3)

• A secure multi-party computation solution to intersection problems of sets and rectangles
• Secure computation of two set-relationships with the unencrypted method
• scientific article; zbMATH DE number 2112427 (Why is no real title available?)

This page was built for publication: Comparing two sets without disclosing them

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