IACR paper details
Title  NonInteractive Proofs for Integer Multiplication 

Booktitle  IACR Eprint archive 

Pages  

Year  2007 

URL  http://eprint.iacr.org/2007/086 

Author  Ivan Damgård 

Author  Rune Thorbek 

Abstract 
We present two universally composable and practical
protocols by which a dealer can, verifiably and
noninteractively, secretshare an integer among a set of players.
Moreover, at small extra cost and using a distributed verifier proof,
it can be shown in zeroknowledge
that three shared integers $a,b,c$ satisfy $ab =c$. This implies by
known reductions noninteractive zeroknowledge 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 setup assumptions, but do
not require the random oracle model.


Search for the paper
@misc{eprint200713368,
title={NonInteractive 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
}
Download a complete BibTeX file.