Secure multi-party computation protocol for sequencing problem

DOI10.1007/S11432-011-4272-1zbMath1267.68053OpenAlexW2027154656MaRDI QIDQ350932

Guihua Shi, Zheng-An Yao, Chun-Ming Tang

Publication date: 3 July 2013

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-011-4272-1

zbMATH Keywords

secret sharingsecure multi-party computationsequencing problem

Mathematics Subject Classification ID

Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proof of security of Yao's protocol for two-party computation
• How to share a secret
• An Efficient Solution to the Millionaires’ Problem Based on Homomorphic Encryption
• Practical Two-Party Computation Based on the Conditional Gate
• Strong Conditional Oblivious Transfer and Computing on Intervals

This page was built for publication: Secure multi-party computation protocol for sequencing problem