International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Non-Interactive Proofs for Integer Multiplication

Authors:
Ivan Damgård
Rune Thorbek
Download:
URL: http://eprint.iacr.org/2007/086
Search ePrint
Search Google
Abstract: We present two universally composable and practical protocols by which a dealer can, verifiably and non-interactively, secret-share an integer among a set of players. Moreover, at small extra cost and using a distributed verifier proof, it can be shown in zero-knowledge that three shared integers $a,b,c$ satisfy $ab =c$. This implies by known reductions non-interactive zero-knowledge proofs that a shared integer is in a given interval, or that one secret integer is larger than another. Such primitives are useful, e.g., for supplying inputs to a multiparty computation protocol, such as an auction or an election. The protocols use various set-up assumptions, but do not require the random oracle model.
BibTeX
@misc{eprint-2007-13368,
  title={Non-Interactive Proofs for Integer Multiplication},
  booktitle={IACR Eprint archive},
  keywords={cryptographic protocols},
  url={http://eprint.iacr.org/2007/086},
  note={A shorter version appears in proc. of EUROCRYPT 07 thorbek@brics.dk 13579 received 6 Mar 2007, last revised 7 Mar 2007},
  author={Ivan Damgård and Rune Thorbek},
  year=2007
}