scientific article; zbMATH DE number 7267018

MaRDI QIDQ5127928zbMATH OpenFDO

Authors

Publication date 27 October 2020

zbMATH Keywords

fully homomorphic encryptionsecure multiparty computationset membershipVandermonde determinant

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Network protocols (68M12) Data encryption (aspects in computer science) (68P25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• An Unconditionally Secure Protocol for Multi-Party Set Intersection
• Secure Multiparty Computation
• Secure multi-party computation
• A secure multi-party computation protocol for the sorting problem
• Secure multiparty computation and secret sharing
• Secure and efficient multiparty private set intersection cardinality
• scientific article; zbMATH DE number 1583776
• A secure multi-party computation solution to intersection problems of sets and rectangles
• Secure multiparty computation of approximations

Cited in

(8)

• Secure multi-party computation solution to Yao's millionaires' problem based on set-inclusion
• Privacy-preserving mixed set operations
• Secure set computing in cloud environment
• Secure computation of two set-relationships with the unencrypted method
• A ciphertext-based proxy secure two-party computation protocol
• Protocols for secure test on relationship on number axis
• Application of secure multi-party computation in judging private path
• Comparing two sets without disclosing them

This page was built for publication:

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