MULTIPARTY COMPARISON - An Improved Multiparty Protocol for Comparison of Secret-shared Values

Tord Ingolf Reistad

2009

Abstract

Given any linear secret sharing scheme with a multiplication protocol, we show that a set of players holding shares of two values a,b ∈ Zp for some prime p (written [a] and [b]), it is possible to compute a sharing [result] such that [result] = ([a] < [b]). The protocol maintains the same security against active/adaptive adversaries as the underlying secret sharing scheme.

Paper Citation

in Harvard Style

Ingolf Reistad T. (2009). MULTIPARTY COMPARISON - An Improved Multiparty Protocol for Comparison of Secret-shared Values . In Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2009) ISBN 978-989-674-005-4, pages 325-330. DOI: 10.5220/0002233603250330

in Bibtex Style

@conference{secrypt09,
author={Tord Ingolf Reistad},
title={MULTIPARTY COMPARISON - An Improved Multiparty Protocol for Comparison of Secret-shared Values},
booktitle={Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2009)},
year={2009},
pages={325-330},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002233603250330},
isbn={978-989-674-005-4},
}

in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2009)
TI - MULTIPARTY COMPARISON - An Improved Multiparty Protocol for Comparison of Secret-shared Values
SN - 978-989-674-005-4
AU - Ingolf Reistad T.
PY - 2009
SP - 325
EP - 330
DO - 10.5220/0002233603250330