TY - GEN
T1 - Black-box constructions of composable protocols without set-up
AU - Lin, Huijia
AU - Pass, Rafael
PY - 2012
Y1 - 2012
N2 - We present the first black-box construction of a secure multi-party computation protocol that satisfies a meaningful notion of concurrent security in the plain model (without any set-up, and without assuming an honest majority). Moreover, our protocol relies on the minimal assumption of the existence of a semi-honest OT protocol, and our security notion "UC with super-polynomial helpers" (Canetti et al, STOC'10) is closed under universal composition, and implies super-polynomial-time simulation security.
AB - We present the first black-box construction of a secure multi-party computation protocol that satisfies a meaningful notion of concurrent security in the plain model (without any set-up, and without assuming an honest majority). Moreover, our protocol relies on the minimal assumption of the existence of a semi-honest OT protocol, and our security notion "UC with super-polynomial helpers" (Canetti et al, STOC'10) is closed under universal composition, and implies super-polynomial-time simulation security.
UR - http://www.scopus.com/inward/record.url?scp=84865525618&partnerID=8YFLogxK
U2 - https://doi.org/10.1007/978-3-642-32009-5_27
DO - https://doi.org/10.1007/978-3-642-32009-5_27
M3 - منشور من مؤتمر
SN - 9783642320088
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 461
EP - 478
BT - Advances in Cryptology, CRYPTO 2012 - 32nd Annual Cryptology Conference, Proceedings
T2 - 32nd Annual International Cryptology Conference, CRYPTO 2012
Y2 - 19 August 2012 through 23 August 2012
ER -