Paper 2001/091
Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor
Ivan Damgård and Jesper B. Nielsen
Abstract
Canetti and Fischlin have recently proposed the security notion {\em
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
Metadata
- Available format(s)
-
PDF PS
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- bit commitment
- Contact author(s)
- buus @ brics dk
- History
- 2001-11-05: received
- Short URL
- https://ia.cr/2001/091
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2001/091, author = {Ivan Damgård and Jesper B. Nielsen}, title = {Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor}, howpublished = {Cryptology {ePrint} Archive, Paper 2001/091}, year = {2001}, url = {https://eprint.iacr.org/2001/091} }