Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

116

Voted

CTRSA
2006
Springer

107views Cryptology» more CTRSA 2006»

A Round and Communication Efficient Secure Ranking Protocol

15 years 6 months ago

A Round and Communication Efficient Secure Ranking Protocol

Download www.cacr.math.uwaterloo.ca

In this work, we initiate the study of realizing a ranking functionality (m1,

Shaoquan Jiang, Guang Gong

Real-time Traffic

Communication Complexity | Cryptology | CTRSA 2006 | General Multi-party Computation | Non-adaptive Malicious Model |

claim paper

Related Content

» RoundEfficient Conference Key Agreement Protocols with Provable Security

» Secure Computation of the k thRanked Element

» RoundEfficient Broadcast Authentication Protocols for Fixed Topology Classes

» Simple and Efficient PerfectlySecure Asynchronous MPC

» Secure Distributed Linear Algebra in a Constant Number of Rounds

» CommunicationEfficient Group Key Agreement

» Asymptotically Optimal TwoRound Perfectly Secure Message Transmission

» Efficient OneRound Key Exchange in the Standard Model

» Efficient and Secure Evaluation of Multivariate Polynomials and Applications

Post Info
More Details (n/a)

Added	22 Aug 2010
Updated	22 Aug 2010
Type	Conference
Year	2006
Where	CTRSA
Authors	Shaoquan Jiang, Guang Gong

Comments (0)