1994 | OriginalPaper | Buchkapitel
Language Dependent Secure Bit Commitment
verfasst von : Toshiya Itoh, Yuji Ohta, Hiroki Shizuya
Erschienen in: Advances in Cryptology — CRYPTO ’94
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.