Secure multi-party computational geometry

DOI10.1007/3-540-44634-6_16MaRDI QIDQ4778552zbMATH OpenFDO

Authors Wenliang Du, Mikhail J. Atallah

Publication date 18 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2125/21250165

Mathematics Subject Classification ID

Network protocols (68M12) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Secure multiparty computation of solid geometric problems and their applications
• scientific article; zbMATH DE number 5283568
• A secure three-party computational protocol for triangle area
• Secure multiparty computation without one-way functions
• scientific article; zbMATH DE number 6961849

Cited in

(26)

• A novel quantum scheme for secure two-party distance computation
• Quantum solution to a class of two-party private summation problems
• A protocol for the secure two-party quantum scalar product
• A novel quantum solution to secure two-party distance computation
• Quantum secure two-party Euclidean distance computation based on mutually unbiased bases
• Symmetric cryptographic protocols for extended millionaires' problem
• Privacy-preserving point-inclusion protocol for an arbitrary area based on phase-encoded quantum private query
• A secure multi-party computation solution to intersection problems of sets and rectangles
• Symmetric cryptographic solution to Yao's millionaires' problem and an evaluation of secure multiparty computations
• A secure scalar product protocol against malicious adversaries
• Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives
• Secure multi-party convex hull protocol based on quantum homomorphic encryption
• High-precision secure computation of satellite collision probabilities
• Homomorphic encryption scheme and a protocol on secure computing a line by two private points
• Blending FHE-NTRU keys -- the excalibur property
• scientific article; zbMATH DE number 5283568 (Why is no real title available?)
• How Should We Solve Search Problems Privately?
• Private graphic similarity estimating while concealing the number of edges and vertexes
• Secure multiparty computation of solid geometric problems and their applications
• A secure three-party computational protocol for triangle area
• Application of secure multi-party computation in judging private path
• Secure two-party input-size reduction: challenges, solutions and applications
• Faster Privacy-Preserving Location Proximity Schemes
• Quantum privacy-preserving two-party circle intersection protocol based on phase-encoded query
• Quantum secure clockwise sorting
• Cryptanalysis and improvement of the novel quantum scheme for secure two-party distance computation

This page was built for publication: Secure multi-party computational geometry

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