Round-optimal black-box statistically binding selective-opening secure commitments

Authors:
David Xiao
Affiliations:
LIAFA, CNRS, Université Paris 7, France
Venue:
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
Year:
2012

Citing 13
Cited 2

Minimum disclosure proofs of knowledge

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds (extended abstract)

EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
On the existence of statistically hiding bit commitment schemes and fail-stop signatures

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On the Composition of Zero-Knowledge Proof Systems

SIAM Journal on Computing
Adaptive zero knowledge and computational equivocation (extended abstract)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Non-interactive and non-malleable commitment

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On Concurrent Zero-Knowledge with Pre-processing

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Magic Functions: In Memoriam: Bernard M. Dwork 1923--1998

Journal of the ACM (JACM)
Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening

EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
(Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks

TCC'11 Proceedings of the 8th conference on Theory of cryptography
Statistical secrecy and multibit commitments

IEEE Transactions on Information Theory

Revisiting lower and upper bounds for selective decommitments

TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Errata to (nearly) round-optimal black-box constructions of commitments secure against selective opening attacks

TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

Assuming t-round statistically hiding commitments in the stand-alone model, we build a (t+2)-round statistically binding commitment secure against selective opening attacks under parallel composition. In particular, assuming collision-resistant hash functions, we build such commitments in 4 rounds.