Abstract
In this paper, we define two classes of languages, one induces opaque/transparent bit commitments and the other induces transparent/opaque bit commitments. As an application of opaque/transparent and transparent/opaque properties, we first show that if a language L induces an opaque/transparent bit commitment, then there exists a prover-practical perfect zero-knowledge proof for L, and we then show that if a language L induces a transparent/opaque bit commitment, then there exists a bounded round perfect zero-knowledge proof for L.
Cite
CITATION STYLE
Itoh, T., Ohta, Y., & Shiauya, H. (1994). Language dependent secure bit commitment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 839 LNCS, pp. 188–201). Springer Verlag. https://doi.org/10.1007/3-540-48658-5_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
