An Integer Commitment Scheme based on Groups with Hidden Order

نویسندگان

  • Ivan Damgård
  • Eiichiro Fujisaki
چکیده

We present a commitment scheme allowing commitment to arbitrary size integers, based on any Abelian group with certain properties, most importantly that it is hard for the committer to compute its order. Potential examples include RSA and class groups. We also give efficient zero-knowledge protocols for proving knowledge of the contents of a commitment and for verifying multiplicative relations over the integers on committed values. This means that our scheme can support, for instance, the efficent interval proofs of Boudot[1]. The scheme can be seen as a modification and a generalization of an earlier scheme of Fujisaki and Okamoto [5], and in particular our results show that we can use a much larger class of RSA moduli than the safe prime products proposed in [5]. Also, we correct some mistakes in the proofs of [5] and give what appears to be the first multiplication protocol for a Fujisaki/Okamoto-like scheme with a complete proof of soundness.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integer-order Versus Fractional-order Adaptive Fuzzy Control of Electrically Driven Robots with Elastic Joints

Real-time robust adaptive fuzzy fractional-order control of electrically driven flexible-joint robots has been addressed in this paper. Two important practical situations have been considered: the fact that robot actuators have limited voltage, and the fact that current signals are contaminated with noise. Through of a novel voltage-based fractional order control for an integer-order dynamical ...

متن کامل

Image Steganalysis Based on Co-Occurrences of Integer Wavelet Coefficients

We present a steganalysis scheme for LSB matching steganography based on feature vectors extracted from integer wavelet transform (IWT). In integer wavelet decomposition of an image, the coefficients will be integer, so we can calculate co-occurrence matrix of them without rounding the coefficients. Before calculation of co-occurrence matrices, we clip some of the most significant bitplanes of ...

متن کامل

A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order

We present a statistically-hiding commitment scheme allowing commitment to arbitrary size integers, based on any (Abelian) group with certain properties, most importantly, that it is hard for the committer to compute its order. We also give efficient zero-knowledge protocols for proving knowledge of the contents of commitments and for verifying multiplicative relations over the integers on comm...

متن کامل

Short-term Price-based Unit Commitment of Hydrothermal GenCos: A Pre-emptive Goal Programming Approach

The solution of single-objective unit commitment problems for generation companies participating in deregulated markets may not directly be implementable mainly because of neglecting some conflicting secondary objectives arising from policy-making at internal/external environment. Benefiting an efficient multi-objective approach to improve the applicability of price-based unit commitment soluti...

متن کامل

Verifiable Member and Order Queries on a List in Zero-Knowledge

We introduce a formal model for order queries on lists in zero knowledge in the traditional authenticated data structure model. We call this model Privacy-Preserving Authenticated List (PPAL). In this model, the queries are performed on the list stored in the (untrusted) cloud where data integrity and privacy have to be maintained. To realize an efficient authenticated data structure, we first ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2001  شماره 

صفحات  -

تاریخ انتشار 2001