Improved primitives for secure multiparty integer computation

O. Catrina; S.J.A. Hoogh, de

doi:10.1007/978-3-642-15317-4_13

Improved primitives for secure multiparty integer computation

O. Catrina, S.J.A. Hoogh, de

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

124 Citations (Scopus)

2 Downloads (Pure)

Abstract

We consider a collection of related multiparty computation protocols that provide core operations for secure integer and fixed-point computation. The higher-level protocols offer integer truncation and comparison, which are typically the main performance bottlenecks in complex applications. We present techniques and building blocks that allow to improve the efficiency of these protocols, in order to meet the performance requirements of a broader range of applications. The protocols can be constructed using different secure computation methods. We focus on solutions for multiparty computation using secret sharing.

Original language	English
Title of host publication	Security and Cryptography for Networks (7th International Conference, SCN 2010, Amalfi, Italy, September 13-15, 2010. Proceedings)
Editors	J.A. Garay, R. De Prisco
Place of Publication	Berlin
Publisher	Springer
Pages	182-199
ISBN (Print)	978-3-642-15316-7
DOIs	https://doi.org/10.1007/978-3-642-15317-4_13
Publication status	Published - 2010

Publication series

Name	Lecture Notes in Computer Science
Volume	6280
ISSN (Print)	0302-9743

Access to Document

10.1007/978-3-642-15317-4_13

Cite this

Catrina, O., & Hoogh, de, S. J. A. (2010). Improved primitives for secure multiparty integer computation. In J. A. Garay, & R. De Prisco (Eds.), Security and Cryptography for Networks (7th International Conference, SCN 2010, Amalfi, Italy, September 13-15, 2010. Proceedings) (pp. 182-199). (Lecture Notes in Computer Science; Vol. 6280). Springer. https://doi.org/10.1007/978-3-642-15317-4_13

@inproceedings{4abfea816d3745768de7e08f063cdaa1,

title = "Improved primitives for secure multiparty integer computation",

abstract = "We consider a collection of related multiparty computation protocols that provide core operations for secure integer and fixed-point computation. The higher-level protocols offer integer truncation and comparison, which are typically the main performance bottlenecks in complex applications. We present techniques and building blocks that allow to improve the efficiency of these protocols, in order to meet the performance requirements of a broader range of applications. The protocols can be constructed using different secure computation methods. We focus on solutions for multiparty computation using secret sharing.",

author = "O. Catrina and {Hoogh, de}, S.J.A.",

year = "2010",

doi = "10.1007/978-3-642-15317-4_13",

language = "English",

isbn = "978-3-642-15316-7",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "182--199",

editor = "J.A. Garay and {De Prisco}, R.",

booktitle = "Security and Cryptography for Networks (7th International Conference, SCN 2010, Amalfi, Italy, September 13-15, 2010. Proceedings)",

}

Catrina, O & Hoogh, de, SJA 2010, Improved primitives for secure multiparty integer computation. in JA Garay & R De Prisco (eds), Security and Cryptography for Networks (7th International Conference, SCN 2010, Amalfi, Italy, September 13-15, 2010. Proceedings). Lecture Notes in Computer Science, vol. 6280, Springer, Berlin, pp. 182-199. https://doi.org/10.1007/978-3-642-15317-4_13

Improved primitives for secure multiparty integer computation. / Catrina, O.; Hoogh, de, S.J.A.
Security and Cryptography for Networks (7th International Conference, SCN 2010, Amalfi, Italy, September 13-15, 2010. Proceedings). ed. / J.A. Garay; R. De Prisco. Berlin: Springer, 2010. p. 182-199 (Lecture Notes in Computer Science; Vol. 6280).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Improved primitives for secure multiparty integer computation

AU - Catrina, O.

AU - Hoogh, de, S.J.A.

PY - 2010

Y1 - 2010

N2 - We consider a collection of related multiparty computation protocols that provide core operations for secure integer and fixed-point computation. The higher-level protocols offer integer truncation and comparison, which are typically the main performance bottlenecks in complex applications. We present techniques and building blocks that allow to improve the efficiency of these protocols, in order to meet the performance requirements of a broader range of applications. The protocols can be constructed using different secure computation methods. We focus on solutions for multiparty computation using secret sharing.

AB - We consider a collection of related multiparty computation protocols that provide core operations for secure integer and fixed-point computation. The higher-level protocols offer integer truncation and comparison, which are typically the main performance bottlenecks in complex applications. We present techniques and building blocks that allow to improve the efficiency of these protocols, in order to meet the performance requirements of a broader range of applications. The protocols can be constructed using different secure computation methods. We focus on solutions for multiparty computation using secret sharing.

U2 - 10.1007/978-3-642-15317-4_13

DO - 10.1007/978-3-642-15317-4_13

M3 - Conference contribution

SN - 978-3-642-15316-7

T3 - Lecture Notes in Computer Science

SP - 182

EP - 199

BT - Security and Cryptography for Networks (7th International Conference, SCN 2010, Amalfi, Italy, September 13-15, 2010. Proceedings)

A2 - Garay, J.A.

A2 - De Prisco, R.

PB - Springer

CY - Berlin

ER -

Improved primitives for secure multiparty integer computation

Abstract

Publication series

Access to Document

Fingerprint

Cite this