Ivan Damgård, Jesper B. Nielsen  Home/Search
Context Related
| daimi.au.dk/~ivan/papers/UCC_v4.ps brics.dk/RS/01/41/...ICSRS0141.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: daimi.au.dk/~ivan/papers (more) Homepages: I.Damgard J.Nielsen |
Rate this article:      (best)Comment on this article |
Abstract: Canetti and Fischlin have recently proposed the security notion 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 #(k) bits to commit to one bit and can be based on the... (Update)
Similar documents based on text: More All
0.7: Mutually Independent Commitment - Liskov, Lysyanskaya, Micali, Reyzin, .. (2001) (Correct)
0.6: Non-interactive and Reusable Non-Malleable Commitment Schemes - Damgård, Groth (2003) (Correct)
0.5: Strengthening Zero-Knowledge Protocols using Signatures - Garay, MacKenzie, Yang (2003) (Correct)
BibTeX entry: (Update)
I. Damgard and J. Nielsen. Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor. In CRYPTO 2002. http://citeseer.ist.psu.edu/damg01perfect.html More
@misc{ damg02perfect,
author = "I. Damg and a Nielsen",
title = "Perfect hiding and perfect binding universally composable commitment schemes
with constant expansion factor",
text = "I. Damgard and J. Nielsen. Perfect hiding and perfect binding universally
composable commitment schemes with constant expansion factor. In CRYPTO
2002.",
year = "2002",
url = "citeseer.ist.psu.edu/damg01perfect.html" }
Citations (may not include all citations):189 Universally composable security: A new paradigm for cryptogr.. - Canetti - 2001
162 Public-key cryptosystems based on composite degree residue c.. - Paillier - 1999
119 Proofs of partial knowledge and simplified design of witness.. - Cramer, Damgard et al. - 1994
109 A new public-key cryptosystem as secure as factoring (context) - Okamoto, Uchiyama - 1998
56 Universally composable commitments - Canetti, Fischlin - 2001
45 a simplification and some applications of Paillier's probabi.. (context) - Damgard, Jurik et al. - 2001
17 Minimum resource zero-knowledge proofs - Kilian, Micali et al. - 1989
14 cient concurrent zero-knowledge in the auxiliary string mode.. (context) - Damgard - 2000
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.daimi.au.dk/~ivan/papers.html): More
Improved Non-Committing Encryption Schemes based on a General.. - Nielsen (2000) (Correct)
A Generalisation, a Simplification and some Applications of.. - Damgård, Jurik (2001) (Correct)
Efficient Zero-Knowledge Proofs of Knowledge Without.. - Cramer, Damgård.. (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC