Secure multiparty computation of solid geometric problems and their applications

DOI10.1016/J.INS.2014.04.004zbMath1355.68282OpenAlexW1987706396MaRDI QIDQ507770

Wu Chunying, Wang Daoshun, Li Shundong, 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

zbMATH Keywords

cryptographyprotocolsecure multiparty computationsimulation paradigmsolid geometry

Mathematics Subject Classification ID

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)

Related Items (5)

Secure two-party input-size reduction: challenges, solutions and applications ⋮ Quantum privacy-preserving two-party circle intersection protocol based on phase-encoded query ⋮ 3D Visibility Representations of 1-planar Graphs ⋮ Quantum private set intersection cardinality and its application to anonymous authentication ⋮ Privacy-preserving polynomial interpolation and its applications on predictive analysis

Cites Work

• 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
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Foundations of Cryptography
• Fully homomorphic encryption using ideal lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Secure multiparty computation of solid geometric problems and their applications