Universally composable zero-knowledge sets

Authors:
Haixia Xu;Hongda Li;Bao Li
Affiliations:
State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, Beijing 100049, China.;State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, Beijing 100049, China.;State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, Beijing 100049, China
Venue:
International Journal of Grid and Utility Computing
Year:
2012

Citing 9
Cited 1

How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A digital signature scheme secure against adaptive chosen-message attacks

SIAM Journal on Computing - Special issue on cryptography
Universally Composable Commitments

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Universally Composable Security: A New Paradigm for Cryptographic Protocols

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Zero-Knowledge Sets

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Zero-knowledge sets with short proofs

EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Algebraic construction for zero-knowledge sets

Journal of Computer Science and Technology
Independent zero-knowledge sets

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Mercurial commitments with applications to zero-knowledge sets

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques

More DCCA-secure public-key encryptions from KEM + DEM style hybrid paradigms and some observations on the 'inner-outer' structure

International Journal of Grid and Utility Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define and construct universally composable (UC) Zero-Knowledge Set (ZKS) protocols. A ZKS protocol allows a prover to commit to a secret set S and prove statements of the form x ∈ S or x ∉ S without revealing any other information about S. The universal composability framework initiated by Canetti is very useful as it ensures stronger security such as concurrent composition, adaptive security and non-malleability. In this paper, we propose a UC ZKS protocol and prove its security in the random oracle model. Simultaneously, we give the negative result that a UC ZKS cannot exist in the standard model (without a random oracle). The negative result shows that the random oracle has both compression and extraction, which is a pair of paradoxical properties. To our knowledge, this is the first time this kind of property has been considered.