Secure multiparty computation of solid geometric problems and their applications
DOI10.1016/J.INS.2014.04.004zbMATH Open1355.68282OpenAlexW1987706396MaRDI QIDQ507770FDOQ507770
Authors: Li Shundong, Wu Chunying, Wang Daoshun, Dai Yiqi 
Publication date: 7 February 2017
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.04.004
Recommendations
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Fully homomorphic encryption using ideal lattices
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Computational geometry. Algorithms and applications.
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Foundations of Cryptography
- Title not available (Why is that?)
- A round-optimal three-party ID-based authenticated key agreement protocol
- Provably secure one-round identity-based authenticated asymmetric group key agreement protocol
- Strong \((n, t, n)\) verifiable secret sharing scheme
- A secure multi-party computation solution to intersection problems of sets and rectangles
- Title not available (Why is that?)
Cited In (14)
- Title not available (Why is that?)
- Application of secure multi-party computation in judging private path
- Quantum secure clockwise sorting
- Quantum privacy-preserving two-party circle intersection protocol based on phase-encoded query
- A secure multi-party computation solution to intersection problems of sets and rectangles
- 3D Visibility Representations of 1-planar Graphs
- Homomorphic encryption scheme and a protocol on secure computing a line by two private points
- A secure three-party computational protocol for triangle area
- Privacy-preserving polynomial interpolation and its applications on predictive analysis
- Secure two-party input-size reduction: challenges, solutions and applications
- Private graphic similarity estimating while concealing the number of edges and vertexes
- Interactive compromise hypersphere method and its applications
- Title not available (Why is that?)
- Quantum private set intersection cardinality and its application to anonymous authentication
This page was built for publication: Secure multiparty computation of solid geometric problems and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507770)
