TY - GEN
T1 - A note on universal composable zero knowledge in common reference string model
AU - Yao, Andrew C.C.
AU - Yao, Frances F.
AU - Zhao, Yunlei
PY - 2007
Y1 - 2007
N2 - Pass observed that universal composable zero-knowledge (UCZK) protocols in the common reference string (CRS) model, where a common reference string is selected trustily by a trusted third party and is known to all players, lose deniability that is a natural property of any ZK protocol in the plain model [33]. An open problem (or, natural query) raised in the literature is: are there any other essential security properties, other than the well-known deniability property, that could be lost by universal composable zero-knowledge in the common reference string model, in comparison with UC security in the plain model? In this work, we answer this open question (or, natural query), by showing that UCZK protocols in the CRS model could lose concurrent general composability (CGC) and proof of knowledge (POK) properties that are very important and essential security implications of UCZK in the plain model. This is demonstrated by concrete attacks.
AB - Pass observed that universal composable zero-knowledge (UCZK) protocols in the common reference string (CRS) model, where a common reference string is selected trustily by a trusted third party and is known to all players, lose deniability that is a natural property of any ZK protocol in the plain model [33]. An open problem (or, natural query) raised in the literature is: are there any other essential security properties, other than the well-known deniability property, that could be lost by universal composable zero-knowledge in the common reference string model, in comparison with UC security in the plain model? In this work, we answer this open question (or, natural query), by showing that UCZK protocols in the CRS model could lose concurrent general composability (CGC) and proof of knowledge (POK) properties that are very important and essential security implications of UCZK in the plain model. This is demonstrated by concrete attacks.
UR - https://www.scopus.com/pages/publications/35448980259
U2 - 10.1007/978-3-540-72504-6_42
DO - 10.1007/978-3-540-72504-6_42
M3 - 会议稿件
AN - SCOPUS:35448980259
SN - 3540725032
SN - 9783540725039
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 462
EP - 473
BT - Theory and Applications of Models of Computation - 4th International Conference, TAMC 2007, Proceedings
PB - Springer Verlag
T2 - 4th International Conference on Theory and Applications of Models of Computation, TAMC 2007
Y2 - 22 May 2007 through 25 May 2007
ER -