Welcome to the resource topic for 2003/214
Multi-Trapdoor Commitments and their Applications to Non-Malleable Protocols
Authors: Rosario GennaroAbstract:
We introduce the notion of multi-trapdoor commitments
which is a stronger form of trapdoor commitment schemes.
We then construct two very efficient instantiations of
multi-trapdoor commitment schemes, based on the Strong
RSA Assumption and the recently introduced Strong Diffie-Hellman
The main applications of our result are non-malleable
trapdoor commtiments and a compiler} that takes any proof of knowledge
and transforms it into one which is secure against a concurrent
man-in-the-middle attack. Such a proof of knowledge immediately
yields concurrently secure identification protocols.
When using our number-theoretic istantiations, the non-malleable
commitment and the
compiler are very efficient (require no more than
four exponentiations). The latter also maintains the round complexity of
the original proof of knowledge; it works in the common reference string
model, which in any case is necessary to prove security of proofs
of knowledge under this kind of attacks. Compared to previously
known efficient solutions, ours is a factor of two faster.
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .