Practical and employable protocols for UC-secure circuit evaluation over ℤn

Jan Camenisch, Robert R. Enderlein, Victor Shoup

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We present a set of new, efficient, universally composable two-party protocols for evaluating reactive arithmetic circuits modulo n, where n is a safe RSA modulus of unknown factorization. Our protocols are based on a homomorphic encryption scheme with message space ℤn, zero-knowledge proofs of existence, and a novel "mixed" trapdoor commitment scheme. Our protocols are proven secure against adaptive corruptions (assuming secure erasures) under standard assumptions in the CRS model (without random oracles). Our protocols appear to be the most efficient ones that satisfy these security requirements. In contrast to prior protocols, we provide facilities that allow for the use of our protocols as building blocks of higher-level protocols.

Original languageEnglish (US)
Title of host publicationComputer Security, ESORICS 2013 - 18th European Symposium on Research in Computer Security, Proceedings
Pages19-37
Number of pages19
Volume8134 LNCS
DOIs
StatePublished - 2013
Event18th European Symposium on Research in Computer Security, ESORICS 2013 - Egham, United Kingdom
Duration: Sep 9 2013Sep 13 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8134 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other18th European Symposium on Research in Computer Security, ESORICS 2013
CountryUnited Kingdom
CityEgham
Period9/9/139/13/13

Fingerprint

Factorization
Cryptography
Networks (circuits)
Evaluation
Arithmetic Circuits
Homomorphic Encryption
Zero-knowledge Proof
Random Oracle
Building Blocks
Modulo
Modulus
Unknown
Requirements

Keywords

  • Practical Protocols
  • Two-party computation
  • UC-Security

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Camenisch, J., Enderlein, R. R., & Shoup, V. (2013). Practical and employable protocols for UC-secure circuit evaluation over ℤn . In Computer Security, ESORICS 2013 - 18th European Symposium on Research in Computer Security, Proceedings (Vol. 8134 LNCS, pp. 19-37). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8134 LNCS). https://doi.org/10.1007/978-3-642-40203-6_2

Practical and employable protocols for UC-secure circuit evaluation over ℤn . / Camenisch, Jan; Enderlein, Robert R.; Shoup, Victor.

Computer Security, ESORICS 2013 - 18th European Symposium on Research in Computer Security, Proceedings. Vol. 8134 LNCS 2013. p. 19-37 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8134 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Camenisch, J, Enderlein, RR & Shoup, V 2013, Practical and employable protocols for UC-secure circuit evaluation over ℤn . in Computer Security, ESORICS 2013 - 18th European Symposium on Research in Computer Security, Proceedings. vol. 8134 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8134 LNCS, pp. 19-37, 18th European Symposium on Research in Computer Security, ESORICS 2013, Egham, United Kingdom, 9/9/13. https://doi.org/10.1007/978-3-642-40203-6_2
Camenisch J, Enderlein RR, Shoup V. Practical and employable protocols for UC-secure circuit evaluation over ℤn . In Computer Security, ESORICS 2013 - 18th European Symposium on Research in Computer Security, Proceedings. Vol. 8134 LNCS. 2013. p. 19-37. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-40203-6_2
Camenisch, Jan ; Enderlein, Robert R. ; Shoup, Victor. / Practical and employable protocols for UC-secure circuit evaluation over ℤn . Computer Security, ESORICS 2013 - 18th European Symposium on Research in Computer Security, Proceedings. Vol. 8134 LNCS 2013. pp. 19-37 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{005967099a4d41969322f71bc4a62717,
title = "Practical and employable protocols for UC-secure circuit evaluation over ℤn",
abstract = "We present a set of new, efficient, universally composable two-party protocols for evaluating reactive arithmetic circuits modulo n, where n is a safe RSA modulus of unknown factorization. Our protocols are based on a homomorphic encryption scheme with message space ℤn, zero-knowledge proofs of existence, and a novel {"}mixed{"} trapdoor commitment scheme. Our protocols are proven secure against adaptive corruptions (assuming secure erasures) under standard assumptions in the CRS model (without random oracles). Our protocols appear to be the most efficient ones that satisfy these security requirements. In contrast to prior protocols, we provide facilities that allow for the use of our protocols as building blocks of higher-level protocols.",
keywords = "Practical Protocols, Two-party computation, UC-Security",
author = "Jan Camenisch and Enderlein, {Robert R.} and Victor Shoup",
year = "2013",
doi = "10.1007/978-3-642-40203-6_2",
language = "English (US)",
isbn = "9783642402029",
volume = "8134 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "19--37",
booktitle = "Computer Security, ESORICS 2013 - 18th European Symposium on Research in Computer Security, Proceedings",

}

TY - GEN

T1 - Practical and employable protocols for UC-secure circuit evaluation over ℤn

AU - Camenisch, Jan

AU - Enderlein, Robert R.

AU - Shoup, Victor

PY - 2013

Y1 - 2013

N2 - We present a set of new, efficient, universally composable two-party protocols for evaluating reactive arithmetic circuits modulo n, where n is a safe RSA modulus of unknown factorization. Our protocols are based on a homomorphic encryption scheme with message space ℤn, zero-knowledge proofs of existence, and a novel "mixed" trapdoor commitment scheme. Our protocols are proven secure against adaptive corruptions (assuming secure erasures) under standard assumptions in the CRS model (without random oracles). Our protocols appear to be the most efficient ones that satisfy these security requirements. In contrast to prior protocols, we provide facilities that allow for the use of our protocols as building blocks of higher-level protocols.

AB - We present a set of new, efficient, universally composable two-party protocols for evaluating reactive arithmetic circuits modulo n, where n is a safe RSA modulus of unknown factorization. Our protocols are based on a homomorphic encryption scheme with message space ℤn, zero-knowledge proofs of existence, and a novel "mixed" trapdoor commitment scheme. Our protocols are proven secure against adaptive corruptions (assuming secure erasures) under standard assumptions in the CRS model (without random oracles). Our protocols appear to be the most efficient ones that satisfy these security requirements. In contrast to prior protocols, we provide facilities that allow for the use of our protocols as building blocks of higher-level protocols.

KW - Practical Protocols

KW - Two-party computation

KW - UC-Security

UR - http://www.scopus.com/inward/record.url?scp=84884742058&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84884742058&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-40203-6_2

DO - 10.1007/978-3-642-40203-6_2

M3 - Conference contribution

AN - SCOPUS:84884742058

SN - 9783642402029

VL - 8134 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 19

EP - 37

BT - Computer Security, ESORICS 2013 - 18th European Symposium on Research in Computer Security, Proceedings

ER -