A round and communication efficient secure ranking protocol

Authors:
Shaoquan Jiang;Guang Gong
Affiliations:
Department of Computer Science, University of Electronic Science and Technology of China, Chengdu, China;Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada
Venue:
CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
Year:
2006

Citing 13
Cited 0

How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Message-optimal protocols for byzantine agreement (extended abstract)

PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Complexity and security of distributed protocols

Complexity and security of distributed protocols
Verifiable partial key escrow

Proceedings of the 4th ACM conference on Computer and communications security
Robustness for Free in Unconditional Multi-party Computation

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Multiparty Computation from Threshold Homomorphic Encryption

EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Mix and Match: Secure Function Evaluation via Ciphertexts

ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Randomizing polynomials: A new representation with applications to round-efficient secure computation

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Protocols for secure computations

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Public-key encryption in a multi-user setting: security proofs and improvements

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
General secure multi-party computation from any linear secret-sharing scheme

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work, we initiate the study of realizing a ranking functionality (m1, ⋯, mn)↦ (r1, ⋯, rn) in the non-adaptive malicious model, where $r_{i}=+ \sharp \{m_{j}:m_{j}