Welcome to the resource topic for 2003/178
Title:
Constructing Optimistic Fair Exchange Protocols from Committed Signatures
Authors: Huafei Zhu
Abstract:In PODC 2003, Park et al. \cite{PCSR} first introduce a connection between fair exchange and sequential two-party
multi-signature scheme and provide a novel method of constructing fair exchange protocol by distributing the computation
of RSA signature. This approach avoids the design of verifiable encryption scheme at the expense of having co-signer
store a piece of prime signer’s secret key. Dodis and Reyzin \cite{DR} showed that the protocol in \cite{PCSR} is totally
breakable in the registration phase, then presented a remedy scheme which is provably secure in the random oracle model,
by utilizing Boldyreva non-interactive two-party multi-signature scheme \cite{Bo}. Security in the random oracle model
does not imply security in the real world. In this paper, we provide the first two efficient committed signatures which
are provably secure in the standard complexity model from strong RSA assumption. Then we construct efficient optimistic
fair exchange protocols from those new primitives.
ePrint: https://eprint.iacr.org/2003/178
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 .