Non-malleable Statistically Hiding Commitment from Any One-Way Function

Authors:
Zongyang Zhang;Zhenfu Cao;Ning Ding;Rong Ma
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiao Tong University, P.R. China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, P.R. China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, P.R. China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, P.R. China
Venue:
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Year:
2009

Citing 15
Cited 4

A digital signature scheme secure against adaptive chosen-message attacks

SIAM Journal on Computing - Special issue on cryptography
Minimum disclosure proofs of knowledge

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
A discrete logarithm implementation of perfect zero-knowledge blobs

Journal of Cryptology
Witness indistinguishable and witness hiding protocols

STOC '90 Proceedings of the twenty-second 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
Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions

SIAM Journal on Computing
Nonmalleable Cryptography

SIAM Journal on Computing
Efficient Non-malleable Commitment Schemes

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Efficient and Non-interactive Non-malleable Commitment

EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Statistical Zero-Knowledge Arguments for NP from Any One-Way Function

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Foundations of Cryptography: Volume 1

Foundations of Cryptography: Volume 1
Statistically-hiding commitment from any one-way function

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
New and Improved Constructions of Nonmalleable Cryptographic Protocols

SIAM Journal on Computing
Concurrent non-malleable commitments from any one-way function

TCC'08 Proceedings of the 5th conference on Theory of cryptography
Reducing complexity assumptions for statistically-hiding commitment

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

Constant-Round concurrent non-malleable statistically binding commitments and decommitments

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Concurrent non-malleable statistically hiding commitment

Information Processing Letters
Multi-Committer threshold commitment scheme from lattice

PAISI'12 Proceedings of the 2012 Pacific Asia conference on Intelligence and Security Informatics
Fully leakage-resilient signatures with auxiliary inputs

ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a construction of non-malleable statistically hiding commitments based on the existence of one-way functions. Our construction employs statistically hiding commitment schemes recently proposed by Haitner and Reingold [1], and special-sound WI proofs. Our proof of security relies on the message scheduling technique introduced by Dolev, Dwork and Naor [2], and requires only the use of black-box techniques.