Abstract
We propose a discrete-logarithm based non-interactive non-malleable commitment scheme with an online knowledge extractor in the random oracle and the public parameter model (need a third party to distribute public parameters to both sender and receiver in advance). Our scheme is statistically-secret computationally-binding. The fundamental technique we employ is the construction of non-interactive zero-knowledge proofs of knowledge with online knowledge extractors from Fiat-Shamir proofs of knowledge for relations with logarithmic challenge length presented by Fischlin in Crypto’05. Compared with previous works, our scheme is practical and the online knowledge extractor is strictly polynomial-time.
This work is supported by the National Natural Science Foundation of China under Grant No. 60573031 and New Century Excellent Talent Program of Education Ministry of China under Grant NCET–05–0398.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barak, B.: Constant-Round Coin-Tossing With a Man in the Middle or Realizing the Shared Random String Model. In: Proc. 43rd FOCS, pp. 345–355. IEEE, Los Alamitos (2002)
Barak, B., Lindell, Y.: Strict Polynomial-time in Simulation and Extraction. Cryptology ePrint Archive, Report 2002/043, 2000. Extended abstract appeared in STOC 2002 (2002)
Bellare, M., Rogaway, P.: Random Oracles are Practical: A paradigm for Designing Efficient Protocols. In: Proc. of ACM Conference on Computer and Communication Security, pp. 62–73 (1993)
Canetti, R., Fischlin, M.: Universally Composable Commitments. Cryptology ePrint Archive, Report 2001/055, 2001. Extended abstract appeared in Crypto 2001 (2001)
Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. SIAM J. Comput. 30(2), 391–437 (2000) (electronic), Preliminary version in STOC 1991
De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., Sahai, A.: Robust Non-interactive zero-knowledge. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 566–598. Springer, Heidelberg (2001)
Di Crescenzo, G., Ishai, Y., Ostrovsky, R.: Non-interactive and non-malleable commitment. In: Proc. 30th STOC, pp. 141–150. ACM, New York (1998)
Di Crescenzo, G., Katz, J., Ostrovsky, R., Smith, A.: Efficient and Non-Interactive Non-Malleable Commitment. Cryptology ePrint Archive, Report 2001/032, 2001. Preliminary versoin in Eurocrypt 2001 (2001)
Fischlin, M.: Trapdoor Commitment Schemes and Their Application. PhD Dissertation, Goethe-University: Germany (2001)
Fischlin, M.: Communication-Efficient Non-Interactive Proofs of Knowledge with Online Extractors. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 152–168. Springer, Heidelberg (2005)
Fischlin, M., Fischlin, R.: Efficient Non-Malleable Commitment Schemes. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 413–431. Springer, Heidelberg (2000)
Okamoto, T.: Provably Secure and Practical Idenitification Schemes and Corresponding Signature Schemes. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 31–53. Springer, Heidelberg (1993)
Pedersen, T.: Non-interactive and Information-Theoretical Secure Verifiable Secret Sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129–140. Springer, Heidelberg (1992)
Sahai, A.: Non-malleable non-interactive zero-knowledge and adaptive chosen-ciphertext security. In: Proc. 40th FOCS, pp. 543–553. IEEE, Los Alamitos (1999)
De Santis, A., Persiano, G.: Zero-Knowledge Proofs of Knowledge Without Interaction. In: Proc. of FOCS 1992, pp. 427–436 (1992)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ding, N., Gu, D. (2008). A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor. In: Pei, D., Yung, M., Lin, D., Wu, C. (eds) Information Security and Cryptology. Inscrypt 2007. Lecture Notes in Computer Science, vol 4990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79499-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-79499-8_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79498-1
Online ISBN: 978-3-540-79499-8
eBook Packages: Computer ScienceComputer Science (R0)