A secure multi-party computation solution to intersection problems of sets and rectangles

DOI10.1080/10020070612330032MaRDI QIDQ2455830zbMATH OpenOpenAlexFDO

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

Publication date 26 October 2007

Published in Progress in Natural Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10020070612330032

zbMATH Keywords

Cantor encodingcomputational complexityrectangle-intersectionsecure multi-party computationset-intersection

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 5283568
• Secure multi-party computation solution to Yao's millionaires' problem based on set-inclusion
• Secure multiparty computation of solid geometric problems and their applications
• Comparing two sets without disclosing them
• scientific article; zbMATH DE number 1830731

Cited in

(9)

• Secure multi-party computation solution to Yao's millionaires' problem based on set-inclusion
• Secure set computing in cloud environment
• Secure Top-k Subgroup Discovery
• Interactive compromise hypersphere method and its applications
• scientific article; zbMATH DE number 5283568 (Why is no real title available?)
• Information Theoretically Secure Multi Party Set Intersection Re-visited
• Secure multiparty computation of solid geometric problems and their applications
• scientific article; zbMATH DE number 7267018 (Why is no real title available?)
• Comparing two sets without disclosing them

This page was built for publication: A secure multi-party computation solution to intersection problems of sets and rectangles

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