Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with bit commitment:
TR06-093 | 27th July 2006
Takeshi Koshiba, Yoshiharu Seri

Round-Efficient One-Way Permutation Based Perfectly Concealing Bit Commitment Scheme

We explicitly show the upper bound on the round complexity for perfectly concealing bit commitment schemes based on the general computational assumption. The best known scheme in the literature is the one-way permutation based scheme due to Naor, Ostrovsky, Venkatesan and Yung and its round complexity is O(n). We consider ... more >>>

ISSN 1433-8092 | Imprint