Skip to main content
SpringerLink
Log in

Unconditionally Secure Homomorphic Pre-distributed Commitments

  • Conference paper
  • First Online:
Book cover Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2643))

Abstract

In this paper we deal with unconditionally secure commitment schemes based on pre-distributed data. We provide bounds for the amount of data which has to be pre-distributed to the participants of the commitment, thus solving an open problem stated in the literature. We also introduce the issue of homomorphism in unconditionally secure commitment schemes. We provide a definition and a construction based on modules of mappings over finite rings. As an application of our constructions, we provide a new pre-distributed primitive which yields non-interactive unconditionally secure zero knowledge proofs of any polynomial relation among commitments.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Matsumoto and H. Imai, On the Key Predistribution Systems: A Practical Solution to the Key Distribution Problem, Advances in Cryptology — CRYPTO’ 87, Santa Barbara, California, USA, 1987, LNCS 293 Springer 1988

    Google Scholar 

  2. B. Pfitzmann and M. Waidner. Information theoretic pseudosignatures and byzantine agreement for t >= n/3, Reserach Report IBM Reserach, Nov. 1996

    Google Scholar 

  3. R.L. Rivest, Unconditionally secure commitment and oblivious transfer schemes using concealing channels and a trusted initializer, pre-print available from http://theory.lcs.mit.edu/~{}rivest/Rivest-commitment.pdf.

  4. C. Blundo, B. Masucci, D. R. Stinson, and R. Wei, Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes, Designs, Codes, and Cryptography, (special issue in honour of Ron Mullin), Vol. 26, pp. 97–110, 2002.

    MATH  MathSciNet  Google Scholar 

  5. G. Hanaoka, J. Shikata, Y. Zheng, H. Imai: Unconditionally Secure Digital Signature Schemes Admitting Transferability. Advances in Cryptology — ASIACRYPT 2000, Kyoto, Japan 2000, LNCS 1976, Springer 2000

    Chapter  Google Scholar 

  6. U. Maurer, Authentication Theory and Hypothesis Testing, IEEE Transaction on Information Theory, vol. 46 No. 4, pp. 1350–1356, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  7. J. Kilian, A Note on Efficient zero-knowledge Proofs and Arguments, 24th ACM Symposium on Theory of Computation, 1992, pp. 723–732

    Google Scholar 

  8. R. Blahut. Principles and Practice of Information Theory, Addison-Wesley Publishing Company, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Industrial Science, The University of Tokyo, 4-6-1, Komaba, Meguro-ku, Tokyo, 153-8505, Japan

    Anderson C. A. Nascimento, Akira Otsuka & Hideki Imai

  2. Institut fuer Algorithmen und Kognitive Systeme, Universitaet Karlsruhe, Am Fasanengarten 5, 76128, Karlsruhe, Germany

    Joern Mueller-Quade

Authors
  1. Anderson C. A. Nascimento
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Akira Otsuka
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hideki Imai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Joern Mueller-Quade
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering, University of Hawaii, 2540 Dole Street, Holmes Hall 455, Honolulu, HI, 96822, USA

    Marc Fossorier

  2. Department of Mathematics, The Technical University of Denmark, Bldg. 303, DK-2800, Lyngby, Denmark

    Tom Høholdt

  3. IRIT - Université Paul Sabatier, 31602, Toulouse cédex, France

    Alain Poli

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nascimento, A.C.A., Otsuka, A., Imai, H., Mueller-Quade, J. (2003). Unconditionally Secure Homomorphic Pre-distributed Commitments. In: Fossorier, M., Høholdt, T., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2003. Lecture Notes in Computer Science, vol 2643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44828-4_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-44828-4_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40111-7

  • Online ISBN: 978-3-540-44828-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation