Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor

Forfattere

  • Ivan B. Damgård
  • Jesper Buus Nielsen

DOI:

https://doi.org/10.7146/brics.v8i41.21701

Resumé

Canetti and Fischlin have recently proposed the security notion universal composability for commitment schemes and provided two examples. This new notion is very strong. It guarantees that security is maintained even when an unbounded number of copies of the scheme are running concurrently, also it guarantees non-malleability, resilience to selective decommitment, and security against adaptive adversaries. Both of their schemes uses Theta(k) bits to commit to one bit and can be based on the existence of trapdoor commitments and non-malleable encryption.

We present new universally composable commitment schemes based on the Paillier cryptosystem and the Okamoto-Uchiyama cryptosystem. The schemes are efficient: to commit to k bits, they use a constant number of modular exponentiations and communicates O(k) bits. Furthermore the scheme can be instantiated in either perfectly hiding or perfectly binding versions. These are the first schemes to show that constant expansion factor, perfect hiding, and perfect binding can be obtained for universally composable commitments.

We also show how the schemes can be applied to do efficient zero-knowledge proofs of knowledge that are universally composable.

Downloads

Publiceret

2001-10-04

Citation/Eksport

Damgård, I. B., & Nielsen, J. B. (2001). Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor. BRICS Report Series, 8(41). https://doi.org/10.7146/brics.v8i41.21701

Nummer

Nr. 41 (2001): RS-41 Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).