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

Jan Camenisch; Robert R. Enderlein; Victor Shoup

doi:10.1007/978-3-642-40203-6_2

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

Jan Camenisch, Robert R. Enderlein, Victor Shoup

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Computer Security, ESORICS 2013 - 18th European Symposium on Research in Computer Security, Proceedings
Pages	19-37
Number of pages	19
DOIs	https://doi.org/10.1007/978-3-642-40203-6_2
State	Published - 2013
Event	18th European Symposium on Research in Computer Security, ESORICS 2013 - Egham, United Kingdom Duration: Sep 9 2013 → Sep 13 2013

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8134 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	18th European Symposium on Research in Computer Security, ESORICS 2013
Country/Territory	United Kingdom
City	Egham
Period	9/9/13 → 9/13/13

Keywords

Practical Protocols
Two-party computation
UC-Security

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

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

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 (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. 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 proceeding › Conference 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. 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. 2013. p. 19-37. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 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. 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",

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",

note = "18th European Symposium on Research in Computer Security, ESORICS 2013 ; Conference date: 09-09-2013 Through 13-09-2013",

}

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

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

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

Y2 - 9 September 2013 through 13 September 2013

ER -